./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdf723aa-096d-4013-9e9b-67c84ae958fb/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdf723aa-096d-4013-9e9b-67c84ae958fb/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdf723aa-096d-4013-9e9b-67c84ae958fb/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdf723aa-096d-4013-9e9b-67c84ae958fb/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdf723aa-096d-4013-9e9b-67c84ae958fb/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdf723aa-096d-4013-9e9b-67c84ae958fb/bin/uautomizer-verify-aQ6SnzHsRB --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 d952a2ac4207d7207b65e88d163e23d18bb81c0593196a835eab903a81ce4e5c --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 03:05:13,980 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 03:05:14,074 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdf723aa-096d-4013-9e9b-67c84ae958fb/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-28 03:05:14,081 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 03:05:14,081 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 03:05:14,119 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 03:05:14,121 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 03:05:14,121 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 03:05:14,122 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 03:05:14,122 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 03:05:14,123 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 03:05:14,123 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 03:05:14,123 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 03:05:14,124 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 03:05:14,124 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 03:05:14,125 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 03:05:14,125 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 03:05:14,125 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 03:05:14,125 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 03:05:14,126 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 03:05:14,126 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 03:05:14,126 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 03:05:14,126 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 03:05:14,126 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 03:05:14,126 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 03:05:14,126 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 03:05:14,127 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 03:05:14,127 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 03:05:14,127 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 03:05:14,127 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:05:14,127 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:05:14,127 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:05:14,128 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:05:14,128 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 03:05:14,129 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:05:14,129 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:05:14,129 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:05:14,129 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:05:14,129 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 03:05:14,129 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 03:05:14,129 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 03:05:14,129 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 03:05:14,129 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 03:05:14,129 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 03:05:14,129 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 03:05:14,130 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 03:05:14,130 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 03:05:14,130 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 03:05:14,130 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdf723aa-096d-4013-9e9b-67c84ae958fb/bin/uautomizer-verify-aQ6SnzHsRB 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 -> d952a2ac4207d7207b65e88d163e23d18bb81c0593196a835eab903a81ce4e5c [2024-11-28 03:05:14,458 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 03:05:14,468 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 03:05:14,470 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 03:05:14,472 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 03:05:14,472 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 03:05:14,473 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdf723aa-096d-4013-9e9b-67c84ae958fb/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i [2024-11-28 03:05:17,593 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdf723aa-096d-4013-9e9b-67c84ae958fb/bin/uautomizer-verify-aQ6SnzHsRB/data/465571b7e/677dc775240c4b2fbd75da22af3ab58c/FLAG041eded0e [2024-11-28 03:05:18,069 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 03:05:18,070 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdf723aa-096d-4013-9e9b-67c84ae958fb/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i [2024-11-28 03:05:18,093 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdf723aa-096d-4013-9e9b-67c84ae958fb/bin/uautomizer-verify-aQ6SnzHsRB/data/465571b7e/677dc775240c4b2fbd75da22af3ab58c/FLAG041eded0e [2024-11-28 03:05:18,118 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdf723aa-096d-4013-9e9b-67c84ae958fb/bin/uautomizer-verify-aQ6SnzHsRB/data/465571b7e/677dc775240c4b2fbd75da22af3ab58c [2024-11-28 03:05:18,120 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 03:05:18,122 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 03:05:18,124 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 03:05:18,125 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 03:05:18,129 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 03:05:18,130 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:05:18" (1/1) ... [2024-11-28 03:05:18,133 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a4a548e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:18, skipping insertion in model container [2024-11-28 03:05:18,134 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:05:18" (1/1) ... [2024-11-28 03:05:18,198 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 03:05:18,963 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdf723aa-096d-4013-9e9b-67c84ae958fb/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i[44118,44131] [2024-11-28 03:05:18,987 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdf723aa-096d-4013-9e9b-67c84ae958fb/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i[44660,44673] [2024-11-28 03:05:19,155 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdf723aa-096d-4013-9e9b-67c84ae958fb/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i[56247,56260] [2024-11-28 03:05:19,156 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdf723aa-096d-4013-9e9b-67c84ae958fb/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i[56368,56381] [2024-11-28 03:05:19,177 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:05:19,194 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 03:05:19,267 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdf723aa-096d-4013-9e9b-67c84ae958fb/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i[44118,44131] [2024-11-28 03:05:19,273 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdf723aa-096d-4013-9e9b-67c84ae958fb/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i[44660,44673] [2024-11-28 03:05:19,359 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdf723aa-096d-4013-9e9b-67c84ae958fb/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i[56247,56260] [2024-11-28 03:05:19,360 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdf723aa-096d-4013-9e9b-67c84ae958fb/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i[56368,56381] [2024-11-28 03:05:19,371 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:05:19,436 INFO L204 MainTranslator]: Completed translation [2024-11-28 03:05:19,437 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:19 WrapperNode [2024-11-28 03:05:19,437 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 03:05:19,438 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 03:05:19,438 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 03:05:19,439 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 03:05:19,445 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:19" (1/1) ... [2024-11-28 03:05:19,476 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:19" (1/1) ... [2024-11-28 03:05:19,564 INFO L138 Inliner]: procedures = 282, calls = 349, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1607 [2024-11-28 03:05:19,566 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 03:05:19,570 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 03:05:19,570 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 03:05:19,570 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 03:05:19,580 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:19" (1/1) ... [2024-11-28 03:05:19,580 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:19" (1/1) ... [2024-11-28 03:05:19,620 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:19" (1/1) ... [2024-11-28 03:05:19,754 INFO L175 MemorySlicer]: Split 318 memory accesses to 4 slices as follows [2, 12, 34, 270]. 85 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 10, 0, 0]. The 62 writes are split as follows [0, 1, 4, 57]. [2024-11-28 03:05:19,754 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:19" (1/1) ... [2024-11-28 03:05:19,754 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:19" (1/1) ... [2024-11-28 03:05:19,813 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:19" (1/1) ... [2024-11-28 03:05:19,816 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:19" (1/1) ... [2024-11-28 03:05:19,846 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:19" (1/1) ... [2024-11-28 03:05:19,856 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:19" (1/1) ... [2024-11-28 03:05:19,863 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:19" (1/1) ... [2024-11-28 03:05:19,884 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 03:05:19,886 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 03:05:19,887 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 03:05:19,888 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 03:05:19,889 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:19" (1/1) ... [2024-11-28 03:05:19,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:05:19,913 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdf723aa-096d-4013-9e9b-67c84ae958fb/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:05:19,929 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdf723aa-096d-4013-9e9b-67c84ae958fb/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 03:05:19,938 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdf723aa-096d-4013-9e9b-67c84ae958fb/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 03:05:19,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-28 03:05:19,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-28 03:05:19,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-28 03:05:19,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-28 03:05:19,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-28 03:05:19,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-28 03:05:19,970 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2024-11-28 03:05:19,971 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2024-11-28 03:05:19,971 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-28 03:05:19,971 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-28 03:05:19,971 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-28 03:05:19,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-28 03:05:19,972 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-28 03:05:19,972 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-28 03:05:19,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-28 03:05:19,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-28 03:05:19,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-28 03:05:19,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-28 03:05:19,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 03:05:19,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 03:05:19,975 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2024-11-28 03:05:19,975 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2024-11-28 03:05:19,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-28 03:05:19,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-28 03:05:19,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-28 03:05:19,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-28 03:05:19,975 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2024-11-28 03:05:19,976 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2024-11-28 03:05:19,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 03:05:19,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-28 03:05:19,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-28 03:05:19,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-28 03:05:19,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 03:05:19,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 03:05:20,318 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 03:05:20,320 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 03:05:22,865 INFO L? ?]: Removed 365 outVars from TransFormulas that were not future-live. [2024-11-28 03:05:22,865 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 03:05:22,899 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 03:05:22,903 INFO L312 CfgBuilder]: Removed 41 assume(true) statements. [2024-11-28 03:05:22,904 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:05:22 BoogieIcfgContainer [2024-11-28 03:05:22,904 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 03:05:22,911 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 03:05:22,911 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 03:05:22,917 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 03:05:22,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:05:18" (1/3) ... [2024-11-28 03:05:22,918 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1056083e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:05:22, skipping insertion in model container [2024-11-28 03:05:22,918 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:19" (2/3) ... [2024-11-28 03:05:22,918 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1056083e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:05:22, skipping insertion in model container [2024-11-28 03:05:22,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:05:22" (3/3) ... [2024-11-28 03:05:22,920 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_BER_test6-2.i [2024-11-28 03:05:22,939 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 03:05:22,944 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_BER_test6-2.i that has 5 procedures, 478 locations, 1 initial locations, 41 loop locations, and 4 error locations. [2024-11-28 03:05:23,039 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 03:05:23,053 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;@2ddcfa1d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 03:05:23,053 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-28 03:05:23,059 INFO L276 IsEmpty]: Start isEmpty. Operand has 478 states, 454 states have (on average 1.592511013215859) internal successors, (723), 458 states have internal predecessors, (723), 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-11-28 03:05:23,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-28 03:05:23,066 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:05:23,067 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:05:23,068 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-11-28 03:05:23,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:05:23,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1938186709, now seen corresponding path program 1 times [2024-11-28 03:05:23,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:05:23,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902467544] [2024-11-28 03:05:23,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:05:23,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:05:23,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:05:23,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:05:23,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:05:23,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902467544] [2024-11-28 03:05:23,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902467544] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:05:23,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:05:23,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:05:23,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758719453] [2024-11-28 03:05:23,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:05:23,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-28 03:05:23,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:05:23,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-28 03:05:23,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 03:05:23,342 INFO L87 Difference]: Start difference. First operand has 478 states, 454 states have (on average 1.592511013215859) internal successors, (723), 458 states have internal predecessors, (723), 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 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:05:23,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:05:23,435 INFO L93 Difference]: Finished difference Result 952 states and 1517 transitions. [2024-11-28 03:05:23,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-28 03:05:23,437 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 8 [2024-11-28 03:05:23,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:05:23,450 INFO L225 Difference]: With dead ends: 952 [2024-11-28 03:05:23,451 INFO L226 Difference]: Without dead ends: 472 [2024-11-28 03:05:23,456 INFO L434 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-11-28 03:05:23,460 INFO L435 NwaCegarLoop]: 672 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:05:23,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:05:23,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2024-11-28 03:05:23,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 472. [2024-11-28 03:05:23,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 449 states have (on average 1.4209354120267261) internal successors, (638), 453 states have internal predecessors, (638), 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-11-28 03:05:23,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 668 transitions. [2024-11-28 03:05:23,547 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 668 transitions. Word has length 8 [2024-11-28 03:05:23,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:05:23,547 INFO L471 AbstractCegarLoop]: Abstraction has 472 states and 668 transitions. [2024-11-28 03:05:23,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:05:23,548 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 668 transitions. [2024-11-28 03:05:23,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-28 03:05:23,549 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:05:23,549 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:05:23,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 03:05:23,549 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-11-28 03:05:23,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:05:23,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1937955008, now seen corresponding path program 1 times [2024-11-28 03:05:23,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:05:23,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091028597] [2024-11-28 03:05:23,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:05:23,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:05:23,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:05:23,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:05:23,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:05:23,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091028597] [2024-11-28 03:05:23,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091028597] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:05:23,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:05:23,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:05:23,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52365144] [2024-11-28 03:05:23,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:05:23,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:05:23,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:05:23,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:05:23,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:05:23,923 INFO L87 Difference]: Start difference. First operand 472 states and 668 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:05:24,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:05:24,287 INFO L93 Difference]: Finished difference Result 1169 states and 1665 transitions. [2024-11-28 03:05:24,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 03:05:24,290 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2024-11-28 03:05:24,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:05:24,301 INFO L225 Difference]: With dead ends: 1169 [2024-11-28 03:05:24,302 INFO L226 Difference]: Without dead ends: 917 [2024-11-28 03:05:24,303 INFO L434 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-11-28 03:05:24,304 INFO L435 NwaCegarLoop]: 703 mSDtfsCounter, 611 mSDsluCounter, 1337 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 2040 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:05:24,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [625 Valid, 2040 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 03:05:24,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2024-11-28 03:05:24,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 474. [2024-11-28 03:05:24,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 451 states have (on average 1.419068736141907) internal successors, (640), 455 states have internal predecessors, (640), 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-11-28 03:05:24,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 670 transitions. [2024-11-28 03:05:24,380 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 670 transitions. Word has length 10 [2024-11-28 03:05:24,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:05:24,380 INFO L471 AbstractCegarLoop]: Abstraction has 474 states and 670 transitions. [2024-11-28 03:05:24,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:05:24,381 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 670 transitions. [2024-11-28 03:05:24,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-28 03:05:24,387 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:05:24,387 INFO L218 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-11-28 03:05:24,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 03:05:24,388 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-11-28 03:05:24,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:05:24,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1917721154, now seen corresponding path program 1 times [2024-11-28 03:05:24,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:05:24,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074774861] [2024-11-28 03:05:24,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:05:24,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:05:24,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:05:25,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:05:25,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:05:25,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074774861] [2024-11-28 03:05:25,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074774861] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:05:25,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:05:25,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:05:25,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309259140] [2024-11-28 03:05:25,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:05:25,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:05:25,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:05:25,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:05:25,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:05:25,045 INFO L87 Difference]: Start difference. First operand 474 states and 670 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 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-11-28 03:05:25,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:05:25,253 INFO L93 Difference]: Finished difference Result 901 states and 1269 transitions. [2024-11-28 03:05:25,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:05:25,254 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 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-11-28 03:05:25,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:05:25,257 INFO L225 Difference]: With dead ends: 901 [2024-11-28 03:05:25,258 INFO L226 Difference]: Without dead ends: 431 [2024-11-28 03:05:25,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-11-28 03:05:25,260 INFO L435 NwaCegarLoop]: 565 mSDtfsCounter, 30 mSDsluCounter, 1111 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1676 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:05:25,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1676 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:05:25,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2024-11-28 03:05:25,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 431. [2024-11-28 03:05:25,287 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-11-28 03:05:25,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 592 transitions. [2024-11-28 03:05:25,297 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 592 transitions. Word has length 67 [2024-11-28 03:05:25,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:05:25,297 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 592 transitions. [2024-11-28 03:05:25,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 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-11-28 03:05:25,298 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 592 transitions. [2024-11-28 03:05:25,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-28 03:05:25,301 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:05:25,302 INFO L218 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-11-28 03:05:25,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 03:05:25,303 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-11-28 03:05:25,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:05:25,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1732136014, now seen corresponding path program 1 times [2024-11-28 03:05:25,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:05:25,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110602062] [2024-11-28 03:05:25,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:05:25,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:05:25,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:05:26,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:05:26,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:05:26,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110602062] [2024-11-28 03:05:26,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110602062] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:05:26,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:05:26,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 03:05:26,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867029616] [2024-11-28 03:05:26,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:05:26,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:05:26,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:05:26,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:05:26,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:05:26,162 INFO L87 Difference]: Start difference. First operand 431 states and 592 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 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-11-28 03:05:26,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:05:26,823 INFO L93 Difference]: Finished difference Result 863 states and 1188 transitions. [2024-11-28 03:05:26,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:05:26,824 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 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-11-28 03:05:26,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:05:26,827 INFO L225 Difference]: With dead ends: 863 [2024-11-28 03:05:26,828 INFO L226 Difference]: Without dead ends: 436 [2024-11-28 03:05:26,829 INFO L434 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-11-28 03:05:26,830 INFO L435 NwaCegarLoop]: 569 mSDtfsCounter, 14 mSDsluCounter, 1979 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2548 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-28 03:05:26,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2548 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-28 03:05:26,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2024-11-28 03:05:26,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 433. [2024-11-28 03:05:26,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 410 states have (on average 1.3756097560975609) internal successors, (564), 414 states have internal predecessors, (564), 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-11-28 03:05:26,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 594 transitions. [2024-11-28 03:05:26,863 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 594 transitions. Word has length 67 [2024-11-28 03:05:26,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:05:26,864 INFO L471 AbstractCegarLoop]: Abstraction has 433 states and 594 transitions. [2024-11-28 03:05:26,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 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-11-28 03:05:26,864 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 594 transitions. [2024-11-28 03:05:26,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-28 03:05:26,866 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:05:26,866 INFO L218 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-11-28 03:05:26,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 03:05:26,867 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-11-28 03:05:26,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:05:26,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1162689855, now seen corresponding path program 1 times [2024-11-28 03:05:26,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:05:26,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829040420] [2024-11-28 03:05:26,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:05:26,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:05:26,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:05:27,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:05:27,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:05:27,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829040420] [2024-11-28 03:05:27,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829040420] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:05:27,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:05:27,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-28 03:05:27,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672421061] [2024-11-28 03:05:27,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:05:27,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 03:05:27,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:05:27,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 03:05:27,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-28 03:05:27,410 INFO L87 Difference]: Start difference. First operand 433 states and 594 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 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-11-28 03:05:28,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:05:28,037 INFO L93 Difference]: Finished difference Result 867 states and 1192 transitions. [2024-11-28 03:05:28,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 03:05:28,038 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 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-11-28 03:05:28,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:05:28,043 INFO L225 Difference]: With dead ends: 867 [2024-11-28 03:05:28,043 INFO L226 Difference]: Without dead ends: 438 [2024-11-28 03:05:28,044 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-28 03:05:28,045 INFO L435 NwaCegarLoop]: 563 mSDtfsCounter, 15 mSDsluCounter, 2495 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 3058 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-28 03:05:28,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 3058 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-28 03:05:28,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2024-11-28 03:05:28,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 437. [2024-11-28 03:05:28,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 414 states have (on average 1.3743961352657006) internal successors, (569), 418 states have internal predecessors, (569), 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-11-28 03:05:28,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 599 transitions. [2024-11-28 03:05:28,071 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 599 transitions. Word has length 68 [2024-11-28 03:05:28,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:05:28,071 INFO L471 AbstractCegarLoop]: Abstraction has 437 states and 599 transitions. [2024-11-28 03:05:28,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 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-11-28 03:05:28,071 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 599 transitions. [2024-11-28 03:05:28,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-28 03:05:28,073 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:05:28,073 INFO L218 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-11-28 03:05:28,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 03:05:28,074 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-11-28 03:05:28,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:05:28,075 INFO L85 PathProgramCache]: Analyzing trace with hash 671915861, now seen corresponding path program 1 times [2024-11-28 03:05:28,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:05:28,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641519377] [2024-11-28 03:05:28,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:05:28,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:05:28,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:05:28,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-11-28 03:05:28,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:05:28,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641519377] [2024-11-28 03:05:28,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641519377] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:05:28,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:05:28,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:05:28,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599225060] [2024-11-28 03:05:28,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:05:28,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:05:28,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:05:28,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:05:28,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:05:28,658 INFO L87 Difference]: Start difference. First operand 437 states and 599 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 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-11-28 03:05:28,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:05:28,877 INFO L93 Difference]: Finished difference Result 870 states and 1194 transitions. [2024-11-28 03:05:28,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 03:05:28,878 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 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-11-28 03:05:28,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:05:28,881 INFO L225 Difference]: With dead ends: 870 [2024-11-28 03:05:28,881 INFO L226 Difference]: Without dead ends: 437 [2024-11-28 03:05:28,882 INFO L434 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-11-28 03:05:28,883 INFO L435 NwaCegarLoop]: 574 mSDtfsCounter, 17 mSDsluCounter, 1019 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1593 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:05:28,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1593 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 03:05:28,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2024-11-28 03:05:28,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 437. [2024-11-28 03:05:28,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 414 states have (on average 1.3719806763285025) internal successors, (568), 418 states have internal predecessors, (568), 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-11-28 03:05:28,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 598 transitions. [2024-11-28 03:05:28,921 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 598 transitions. Word has length 68 [2024-11-28 03:05:28,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:05:28,922 INFO L471 AbstractCegarLoop]: Abstraction has 437 states and 598 transitions. [2024-11-28 03:05:28,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 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-11-28 03:05:28,923 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 598 transitions. [2024-11-28 03:05:28,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-28 03:05:28,924 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:05:28,924 INFO L218 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-11-28 03:05:28,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 03:05:28,924 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-11-28 03:05:28,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:05:28,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1163109374, now seen corresponding path program 1 times [2024-11-28 03:05:28,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:05:28,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110220230] [2024-11-28 03:05:28,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:05:28,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:05:29,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:05:29,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:05:29,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:05:29,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110220230] [2024-11-28 03:05:29,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110220230] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:05:29,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:05:29,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-28 03:05:29,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318965957] [2024-11-28 03:05:29,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:05:29,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 03:05:29,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:05:29,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 03:05:29,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-28 03:05:29,675 INFO L87 Difference]: Start difference. First operand 437 states and 598 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 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-11-28 03:05:30,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:05:30,504 INFO L93 Difference]: Finished difference Result 883 states and 1213 transitions. [2024-11-28 03:05:30,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 03:05:30,505 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 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-11-28 03:05:30,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:05:30,508 INFO L225 Difference]: With dead ends: 883 [2024-11-28 03:05:30,508 INFO L226 Difference]: Without dead ends: 450 [2024-11-28 03:05:30,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-28 03:05:30,511 INFO L435 NwaCegarLoop]: 564 mSDtfsCounter, 34 mSDsluCounter, 3561 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 4125 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-28 03:05:30,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 4125 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-28 03:05:30,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2024-11-28 03:05:30,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 447. [2024-11-28 03:05:30,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 424 states have (on average 1.3726415094339623) internal successors, (582), 428 states have internal predecessors, (582), 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-11-28 03:05:30,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 612 transitions. [2024-11-28 03:05:30,538 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 612 transitions. Word has length 69 [2024-11-28 03:05:30,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:05:30,538 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 612 transitions. [2024-11-28 03:05:30,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 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-11-28 03:05:30,538 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 612 transitions. [2024-11-28 03:05:30,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-28 03:05:30,541 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:05:30,541 INFO L218 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-11-28 03:05:30,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 03:05:30,541 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-11-28 03:05:30,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:05:30,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1519186921, now seen corresponding path program 1 times [2024-11-28 03:05:30,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:05:30,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505723219] [2024-11-28 03:05:30,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:05:30,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:05:30,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:05:31,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:05:31,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:05:31,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505723219] [2024-11-28 03:05:31,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505723219] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:05:31,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:05:31,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 03:05:31,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261471360] [2024-11-28 03:05:31,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:05:31,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 03:05:31,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:05:31,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 03:05:31,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-28 03:05:31,248 INFO L87 Difference]: Start difference. First operand 447 states and 612 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 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-11-28 03:05:31,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:05:31,929 INFO L93 Difference]: Finished difference Result 893 states and 1225 transitions. [2024-11-28 03:05:31,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 03:05:31,932 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 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-11-28 03:05:31,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:05:31,938 INFO L225 Difference]: With dead ends: 893 [2024-11-28 03:05:31,938 INFO L226 Difference]: Without dead ends: 450 [2024-11-28 03:05:31,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-28 03:05:31,940 INFO L435 NwaCegarLoop]: 568 mSDtfsCounter, 27 mSDsluCounter, 3044 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 3612 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-28 03:05:31,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 3612 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-28 03:05:31,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2024-11-28 03:05:31,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 450. [2024-11-28 03:05:31,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 427 states have (on average 1.370023419203747) internal successors, (585), 431 states have internal predecessors, (585), 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-11-28 03:05:31,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 615 transitions. [2024-11-28 03:05:31,970 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 615 transitions. Word has length 69 [2024-11-28 03:05:31,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:05:31,970 INFO L471 AbstractCegarLoop]: Abstraction has 450 states and 615 transitions. [2024-11-28 03:05:31,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 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-11-28 03:05:31,970 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 615 transitions. [2024-11-28 03:05:31,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-28 03:05:31,971 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:05:31,971 INFO L218 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-11-28 03:05:31,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 03:05:31,972 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-11-28 03:05:31,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:05:31,972 INFO L85 PathProgramCache]: Analyzing trace with hash -357887657, now seen corresponding path program 1 times [2024-11-28 03:05:31,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:05:31,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992003192] [2024-11-28 03:05:31,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:05:31,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:05:32,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:05:32,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:05:32,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:05:32,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992003192] [2024-11-28 03:05:32,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992003192] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:05:32,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:05:32,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 03:05:32,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584869787] [2024-11-28 03:05:32,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:05:32,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:05:32,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:05:32,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:05:32,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:05:32,294 INFO L87 Difference]: Start difference. First operand 450 states and 615 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 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-11-28 03:05:32,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:05:32,661 INFO L93 Difference]: Finished difference Result 899 states and 1231 transitions. [2024-11-28 03:05:32,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:05:32,662 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 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-11-28 03:05:32,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:05:32,666 INFO L225 Difference]: With dead ends: 899 [2024-11-28 03:05:32,666 INFO L226 Difference]: Without dead ends: 453 [2024-11-28 03:05:32,667 INFO L434 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-11-28 03:05:32,668 INFO L435 NwaCegarLoop]: 574 mSDtfsCounter, 8 mSDsluCounter, 1996 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2570 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 03:05:32,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2570 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 03:05:32,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2024-11-28 03:05:32,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 453. [2024-11-28 03:05:32,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 430 states have (on average 1.3674418604651162) internal successors, (588), 434 states have internal predecessors, (588), 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-11-28 03:05:32,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 618 transitions. [2024-11-28 03:05:32,690 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 618 transitions. Word has length 69 [2024-11-28 03:05:32,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:05:32,690 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 618 transitions. [2024-11-28 03:05:32,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 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-11-28 03:05:32,692 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 618 transitions. [2024-11-28 03:05:32,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-28 03:05:32,693 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:05:32,693 INFO L218 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-11-28 03:05:32,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-28 03:05:32,694 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-11-28 03:05:32,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:05:32,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1901356284, now seen corresponding path program 1 times [2024-11-28 03:05:32,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:05:32,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085038626] [2024-11-28 03:05:32,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:05:32,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:05:32,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:05:33,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:05:33,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:05:33,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085038626] [2024-11-28 03:05:33,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085038626] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:05:33,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:05:33,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-28 03:05:33,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30645151] [2024-11-28 03:05:33,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:05:33,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 03:05:33,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:05:33,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 03:05:33,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-28 03:05:33,604 INFO L87 Difference]: Start difference. First operand 453 states and 618 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-11-28 03:05:35,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:05:35,079 INFO L93 Difference]: Finished difference Result 1323 states and 1814 transitions. [2024-11-28 03:05:35,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 03:05:35,080 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-11-28 03:05:35,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:05:35,087 INFO L225 Difference]: With dead ends: 1323 [2024-11-28 03:05:35,087 INFO L226 Difference]: Without dead ends: 874 [2024-11-28 03:05:35,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-11-28 03:05:35,090 INFO L435 NwaCegarLoop]: 609 mSDtfsCounter, 692 mSDsluCounter, 2632 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 3241 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:05:35,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [704 Valid, 3241 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-28 03:05:35,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2024-11-28 03:05:35,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 492. [2024-11-28 03:05:35,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 469 states have (on average 1.3454157782515992) internal successors, (631), 473 states have internal predecessors, (631), 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-11-28 03:05:35,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 661 transitions. [2024-11-28 03:05:35,120 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 661 transitions. Word has length 70 [2024-11-28 03:05:35,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:05:35,121 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 661 transitions. [2024-11-28 03:05:35,121 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-11-28 03:05:35,121 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 661 transitions. [2024-11-28 03:05:35,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-28 03:05:35,123 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:05:35,123 INFO L218 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-11-28 03:05:35,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 03:05:35,124 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-11-28 03:05:35,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:05:35,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1164625832, now seen corresponding path program 1 times [2024-11-28 03:05:35,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:05:35,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76988277] [2024-11-28 03:05:35,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:05:35,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:05:35,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:05:35,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:05:35,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:05:35,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76988277] [2024-11-28 03:05:35,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76988277] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:05:35,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:05:35,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-28 03:05:35,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50425577] [2024-11-28 03:05:35,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:05:35,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 03:05:35,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:05:35,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 03:05:35,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-28 03:05:35,516 INFO L87 Difference]: Start difference. First operand 492 states and 661 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 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-11-28 03:05:36,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:05:36,173 INFO L93 Difference]: Finished difference Result 946 states and 1283 transitions. [2024-11-28 03:05:36,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 03:05:36,174 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 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-11-28 03:05:36,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:05:36,177 INFO L225 Difference]: With dead ends: 946 [2024-11-28 03:05:36,177 INFO L226 Difference]: Without dead ends: 497 [2024-11-28 03:05:36,178 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-28 03:05:36,179 INFO L435 NwaCegarLoop]: 569 mSDtfsCounter, 13 mSDsluCounter, 2495 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 3064 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-28 03:05:36,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 3064 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-28 03:05:36,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2024-11-28 03:05:36,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 492. [2024-11-28 03:05:36,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 469 states have (on average 1.3454157782515992) internal successors, (631), 473 states have internal predecessors, (631), 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-11-28 03:05:36,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 661 transitions. [2024-11-28 03:05:36,208 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 661 transitions. Word has length 70 [2024-11-28 03:05:36,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:05:36,208 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 661 transitions. [2024-11-28 03:05:36,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 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-11-28 03:05:36,208 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 661 transitions. [2024-11-28 03:05:36,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-28 03:05:36,209 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:05:36,210 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:05:36,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-28 03:05:36,210 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-11-28 03:05:36,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:05:36,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1034146717, now seen corresponding path program 1 times [2024-11-28 03:05:36,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:05:36,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33878844] [2024-11-28 03:05:36,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:05:36,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:05:36,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:05:36,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:05:36,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:05:36,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33878844] [2024-11-28 03:05:36,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33878844] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:05:36,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:05:36,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-28 03:05:36,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686782056] [2024-11-28 03:05:36,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:05:36,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 03:05:36,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:05:36,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 03:05:36,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-28 03:05:36,618 INFO L87 Difference]: Start difference. First operand 492 states and 661 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 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-11-28 03:05:37,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:05:37,177 INFO L93 Difference]: Finished difference Result 951 states and 1289 transitions. [2024-11-28 03:05:37,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 03:05:37,177 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 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 71 [2024-11-28 03:05:37,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:05:37,181 INFO L225 Difference]: With dead ends: 951 [2024-11-28 03:05:37,181 INFO L226 Difference]: Without dead ends: 502 [2024-11-28 03:05:37,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-28 03:05:37,183 INFO L435 NwaCegarLoop]: 563 mSDtfsCounter, 20 mSDsluCounter, 3075 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 3638 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-28 03:05:37,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 3638 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-28 03:05:37,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2024-11-28 03:05:37,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 495. [2024-11-28 03:05:37,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 472 states have (on average 1.3453389830508475) internal successors, (635), 476 states have internal predecessors, (635), 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-11-28 03:05:37,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 665 transitions. [2024-11-28 03:05:37,211 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 665 transitions. Word has length 71 [2024-11-28 03:05:37,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:05:37,212 INFO L471 AbstractCegarLoop]: Abstraction has 495 states and 665 transitions. [2024-11-28 03:05:37,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 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-11-28 03:05:37,212 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 665 transitions. [2024-11-28 03:05:37,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-28 03:05:37,213 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:05:37,213 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:05:37,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-28 03:05:37,214 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-11-28 03:05:37,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:05:37,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1103094087, now seen corresponding path program 1 times [2024-11-28 03:05:37,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:05:37,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813552302] [2024-11-28 03:05:37,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:05:37,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:05:37,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:05:37,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:05:37,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:05:37,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813552302] [2024-11-28 03:05:37,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813552302] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:05:37,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:05:37,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-28 03:05:37,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552648412] [2024-11-28 03:05:37,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:05:37,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 03:05:37,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:05:37,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 03:05:37,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-28 03:05:37,718 INFO L87 Difference]: Start difference. First operand 495 states and 665 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 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-11-28 03:05:38,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:05:38,563 INFO L93 Difference]: Finished difference Result 969 states and 1309 transitions. [2024-11-28 03:05:38,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 03:05:38,564 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 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 71 [2024-11-28 03:05:38,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:05:38,567 INFO L225 Difference]: With dead ends: 969 [2024-11-28 03:05:38,568 INFO L226 Difference]: Without dead ends: 517 [2024-11-28 03:05:38,569 INFO L434 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-11-28 03:05:38,571 INFO L435 NwaCegarLoop]: 575 mSDtfsCounter, 38 mSDsluCounter, 3527 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 4102 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-28 03:05:38,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 4102 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-28 03:05:38,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2024-11-28 03:05:38,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 495. [2024-11-28 03:05:38,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 472 states have (on average 1.3453389830508475) internal successors, (635), 476 states have internal predecessors, (635), 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-11-28 03:05:38,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 665 transitions. [2024-11-28 03:05:38,598 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 665 transitions. Word has length 71 [2024-11-28 03:05:38,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:05:38,600 INFO L471 AbstractCegarLoop]: Abstraction has 495 states and 665 transitions. [2024-11-28 03:05:38,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 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-11-28 03:05:38,600 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 665 transitions. [2024-11-28 03:05:38,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-28 03:05:38,601 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:05:38,601 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:05:38,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-28 03:05:38,601 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-11-28 03:05:38,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:05:38,602 INFO L85 PathProgramCache]: Analyzing trace with hash 747644936, now seen corresponding path program 1 times [2024-11-28 03:05:38,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:05:38,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956559012] [2024-11-28 03:05:38,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:05:38,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:05:38,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:05:39,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:05:39,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:05:39,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956559012] [2024-11-28 03:05:39,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956559012] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:05:39,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:05:39,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-28 03:05:39,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936729288] [2024-11-28 03:05:39,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:05:39,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 03:05:39,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:05:39,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 03:05:39,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-28 03:05:39,084 INFO L87 Difference]: Start difference. First operand 495 states and 665 transitions. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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-11-28 03:05:39,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:05:39,826 INFO L93 Difference]: Finished difference Result 963 states and 1306 transitions. [2024-11-28 03:05:39,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 03:05:39,827 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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 72 [2024-11-28 03:05:39,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:05:39,831 INFO L225 Difference]: With dead ends: 963 [2024-11-28 03:05:39,832 INFO L226 Difference]: Without dead ends: 511 [2024-11-28 03:05:39,833 INFO L434 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-11-28 03:05:39,833 INFO L435 NwaCegarLoop]: 570 mSDtfsCounter, 23 mSDsluCounter, 3576 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 4146 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-28 03:05:39,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 4146 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-28 03:05:39,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2024-11-28 03:05:39,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 505. [2024-11-28 03:05:39,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 482 states have (on average 1.342323651452282) internal successors, (647), 486 states have internal predecessors, (647), 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-11-28 03:05:39,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 677 transitions. [2024-11-28 03:05:39,860 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 677 transitions. Word has length 72 [2024-11-28 03:05:39,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:05:39,860 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 677 transitions. [2024-11-28 03:05:39,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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-11-28 03:05:39,861 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 677 transitions. [2024-11-28 03:05:39,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-28 03:05:39,861 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:05:39,862 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:05:39,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-28 03:05:39,862 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-11-28 03:05:39,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:05:39,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1717366876, now seen corresponding path program 1 times [2024-11-28 03:05:39,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:05:39,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192631523] [2024-11-28 03:05:39,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:05:39,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:05:39,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:05:40,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:05:40,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:05:40,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192631523] [2024-11-28 03:05:40,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192631523] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:05:40,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:05:40,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-28 03:05:40,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169248517] [2024-11-28 03:05:40,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:05:40,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 03:05:40,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:05:40,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 03:05:40,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-28 03:05:40,394 INFO L87 Difference]: Start difference. First operand 505 states and 677 transitions. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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-11-28 03:05:41,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:05:41,290 INFO L93 Difference]: Finished difference Result 983 states and 1330 transitions. [2024-11-28 03:05:41,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 03:05:41,291 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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 72 [2024-11-28 03:05:41,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:05:41,294 INFO L225 Difference]: With dead ends: 983 [2024-11-28 03:05:41,294 INFO L226 Difference]: Without dead ends: 521 [2024-11-28 03:05:41,295 INFO L434 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-11-28 03:05:41,296 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 17 mSDsluCounter, 4044 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4600 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-28 03:05:41,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4600 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-28 03:05:41,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2024-11-28 03:05:41,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 508. [2024-11-28 03:05:41,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 485 states have (on average 1.3422680412371133) internal successors, (651), 489 states have internal predecessors, (651), 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-11-28 03:05:41,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 681 transitions. [2024-11-28 03:05:41,321 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 681 transitions. Word has length 72 [2024-11-28 03:05:41,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:05:41,321 INFO L471 AbstractCegarLoop]: Abstraction has 508 states and 681 transitions. [2024-11-28 03:05:41,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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-11-28 03:05:41,322 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 681 transitions. [2024-11-28 03:05:41,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-28 03:05:41,323 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:05:41,323 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:05:41,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-28 03:05:41,323 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-11-28 03:05:41,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:05:41,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1079547684, now seen corresponding path program 1 times [2024-11-28 03:05:41,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:05:41,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231843254] [2024-11-28 03:05:41,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:05:41,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:05:41,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:05:41,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:05:41,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:05:41,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231843254] [2024-11-28 03:05:41,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231843254] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:05:41,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:05:41,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-28 03:05:41,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083033054] [2024-11-28 03:05:41,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:05:41,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 03:05:41,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:05:41,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 03:05:41,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-28 03:05:41,715 INFO L87 Difference]: Start difference. First operand 508 states and 681 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 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-11-28 03:05:42,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:05:42,197 INFO L93 Difference]: Finished difference Result 978 states and 1320 transitions. [2024-11-28 03:05:42,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 03:05:42,198 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 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 72 [2024-11-28 03:05:42,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:05:42,201 INFO L225 Difference]: With dead ends: 978 [2024-11-28 03:05:42,202 INFO L226 Difference]: Without dead ends: 513 [2024-11-28 03:05:42,203 INFO L434 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-11-28 03:05:42,203 INFO L435 NwaCegarLoop]: 564 mSDtfsCounter, 11 mSDsluCounter, 2524 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 3088 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-28 03:05:42,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 3088 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-28 03:05:42,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2024-11-28 03:05:42,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 508. [2024-11-28 03:05:42,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 485 states have (on average 1.3402061855670102) internal successors, (650), 489 states have internal predecessors, (650), 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-11-28 03:05:42,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 680 transitions. [2024-11-28 03:05:42,229 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 680 transitions. Word has length 72 [2024-11-28 03:05:42,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:05:42,229 INFO L471 AbstractCegarLoop]: Abstraction has 508 states and 680 transitions. [2024-11-28 03:05:42,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 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-11-28 03:05:42,230 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 680 transitions. [2024-11-28 03:05:42,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-28 03:05:42,231 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:05:42,231 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:05:42,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-28 03:05:42,231 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-11-28 03:05:42,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:05:42,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1602748611, now seen corresponding path program 1 times [2024-11-28 03:05:42,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:05:42,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873947851] [2024-11-28 03:05:42,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:05:42,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:05:42,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:05:42,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:05:42,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:05:42,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873947851] [2024-11-28 03:05:42,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873947851] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:05:42,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:05:42,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-28 03:05:42,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108284034] [2024-11-28 03:05:42,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:05:42,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 03:05:42,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:05:42,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 03:05:42,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-28 03:05:42,612 INFO L87 Difference]: Start difference. First operand 508 states and 680 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 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-11-28 03:05:43,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:05:43,138 INFO L93 Difference]: Finished difference Result 976 states and 1318 transitions. [2024-11-28 03:05:43,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 03:05:43,139 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 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 72 [2024-11-28 03:05:43,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:05:43,142 INFO L225 Difference]: With dead ends: 976 [2024-11-28 03:05:43,142 INFO L226 Difference]: Without dead ends: 511 [2024-11-28 03:05:43,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-28 03:05:43,144 INFO L435 NwaCegarLoop]: 568 mSDtfsCounter, 8 mSDsluCounter, 2479 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3047 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-28 03:05:43,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3047 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-28 03:05:43,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2024-11-28 03:05:43,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 511. [2024-11-28 03:05:43,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 488 states have (on average 1.3381147540983607) internal successors, (653), 492 states have internal predecessors, (653), 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-11-28 03:05:43,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 683 transitions. [2024-11-28 03:05:43,176 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 683 transitions. Word has length 72 [2024-11-28 03:05:43,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:05:43,176 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 683 transitions. [2024-11-28 03:05:43,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 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-11-28 03:05:43,177 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 683 transitions. [2024-11-28 03:05:43,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-28 03:05:43,178 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:05:43,178 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:05:43,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-28 03:05:43,178 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-11-28 03:05:43,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:05:43,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1348607590, now seen corresponding path program 1 times [2024-11-28 03:05:43,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:05:43,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020698533] [2024-11-28 03:05:43,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:05:43,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:05:43,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:05:43,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:05:43,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:05:43,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020698533] [2024-11-28 03:05:43,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020698533] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:05:43,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:05:43,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-28 03:05:43,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681108141] [2024-11-28 03:05:43,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:05:43,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 03:05:43,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:05:43,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 03:05:43,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-28 03:05:43,767 INFO L87 Difference]: Start difference. First operand 511 states and 683 transitions. Second operand has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 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-11-28 03:05:48,192 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-11-28 03:05:48,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:05:48,634 INFO L93 Difference]: Finished difference Result 991 states and 1337 transitions. [2024-11-28 03:05:48,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 03:05:48,635 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 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 73 [2024-11-28 03:05:48,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:05:48,638 INFO L225 Difference]: With dead ends: 991 [2024-11-28 03:05:48,638 INFO L226 Difference]: Without dead ends: 523 [2024-11-28 03:05:48,639 INFO L434 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-11-28 03:05:48,640 INFO L435 NwaCegarLoop]: 567 mSDtfsCounter, 13 mSDsluCounter, 3539 mSDsCounter, 0 mSdLazyCounter, 650 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 4106 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 650 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-11-28 03:05:48,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 4106 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 650 Invalid, 1 Unknown, 0 Unchecked, 4.8s Time] [2024-11-28 03:05:48,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2024-11-28 03:05:48,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 515. [2024-11-28 03:05:48,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 492 states have (on average 1.3373983739837398) internal successors, (658), 496 states have internal predecessors, (658), 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-11-28 03:05:48,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 688 transitions. [2024-11-28 03:05:48,664 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 688 transitions. Word has length 73 [2024-11-28 03:05:48,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:05:48,665 INFO L471 AbstractCegarLoop]: Abstraction has 515 states and 688 transitions. [2024-11-28 03:05:48,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 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-11-28 03:05:48,665 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 688 transitions. [2024-11-28 03:05:48,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-28 03:05:48,666 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:05:48,666 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:05:48,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-28 03:05:48,666 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-11-28 03:05:48,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:05:48,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1017786029, now seen corresponding path program 1 times [2024-11-28 03:05:48,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:05:48,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123803950] [2024-11-28 03:05:48,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:05:48,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:05:48,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:05:49,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:05:49,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:05:49,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123803950] [2024-11-28 03:05:49,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123803950] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:05:49,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:05:49,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-28 03:05:49,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98881078] [2024-11-28 03:05:49,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:05:49,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-28 03:05:49,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:05:49,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-28 03:05:49,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-28 03:05:49,120 INFO L87 Difference]: Start difference. First operand 515 states and 688 transitions. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 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-11-28 03:05:49,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:05:49,977 INFO L93 Difference]: Finished difference Result 1000 states and 1347 transitions. [2024-11-28 03:05:49,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 03:05:49,978 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 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 73 [2024-11-28 03:05:49,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:05:49,981 INFO L225 Difference]: With dead ends: 1000 [2024-11-28 03:05:49,982 INFO L226 Difference]: Without dead ends: 528 [2024-11-28 03:05:49,983 INFO L434 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-11-28 03:05:49,983 INFO L435 NwaCegarLoop]: 564 mSDtfsCounter, 26 mSDsluCounter, 4594 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 5158 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-28 03:05:49,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 5158 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-28 03:05:49,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2024-11-28 03:05:50,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 518. [2024-11-28 03:05:50,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 495 states have (on average 1.3353535353535353) internal successors, (661), 499 states have internal predecessors, (661), 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-11-28 03:05:50,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 691 transitions. [2024-11-28 03:05:50,006 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 691 transitions. Word has length 73 [2024-11-28 03:05:50,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:05:50,007 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 691 transitions. [2024-11-28 03:05:50,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 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-11-28 03:05:50,007 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 691 transitions. [2024-11-28 03:05:50,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-28 03:05:50,008 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:05:50,008 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:05:50,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-28 03:05:50,008 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-11-28 03:05:50,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:05:50,009 INFO L85 PathProgramCache]: Analyzing trace with hash -2052314550, now seen corresponding path program 1 times [2024-11-28 03:05:50,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:05:50,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758568316] [2024-11-28 03:05:50,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:05:50,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:05:50,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:05:50,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:05:50,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:05:50,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758568316] [2024-11-28 03:05:50,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758568316] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:05:50,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:05:50,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-28 03:05:50,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382460436] [2024-11-28 03:05:50,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:05:50,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 03:05:50,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:05:50,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 03:05:50,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-28 03:05:50,680 INFO L87 Difference]: Start difference. First operand 518 states and 691 transitions. Second operand has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 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-11-28 03:05:54,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.00s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:05:55,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:05:55,041 INFO L93 Difference]: Finished difference Result 1011 states and 1355 transitions. [2024-11-28 03:05:55,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 03:05:55,041 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 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 73 [2024-11-28 03:05:55,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:05:55,044 INFO L225 Difference]: With dead ends: 1011 [2024-11-28 03:05:55,045 INFO L226 Difference]: Without dead ends: 536 [2024-11-28 03:05:55,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-11-28 03:05:55,046 INFO L435 NwaCegarLoop]: 568 mSDtfsCounter, 45 mSDsluCounter, 4006 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 4574 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:05:55,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 4574 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-11-28 03:05:55,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2024-11-28 03:05:55,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 519. [2024-11-28 03:05:55,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 496 states have (on average 1.3346774193548387) internal successors, (662), 500 states have internal predecessors, (662), 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-11-28 03:05:55,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 692 transitions. [2024-11-28 03:05:55,070 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 692 transitions. Word has length 73 [2024-11-28 03:05:55,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:05:55,071 INFO L471 AbstractCegarLoop]: Abstraction has 519 states and 692 transitions. [2024-11-28 03:05:55,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 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-11-28 03:05:55,073 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 692 transitions. [2024-11-28 03:05:55,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-28 03:05:55,074 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:05:55,074 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:05:55,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-28 03:05:55,075 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-11-28 03:05:55,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:05:55,075 INFO L85 PathProgramCache]: Analyzing trace with hash -196801378, now seen corresponding path program 1 times [2024-11-28 03:05:55,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:05:55,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205150224] [2024-11-28 03:05:55,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:05:55,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:05:55,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:06:07,790 WARN L286 SmtUtils]: Spent 5.32s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-28 03:06:19,138 WARN L286 SmtUtils]: Spent 7.33s 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-11-28 03:06:43,597 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-28 03:06:51,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:06:51,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:06:51,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205150224] [2024-11-28 03:06:51,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205150224] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:06:51,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:06:51,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-28 03:06:51,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448724556] [2024-11-28 03:06:51,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:06:51,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-28 03:06:51,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:06:51,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-28 03:06:51,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=83, Unknown=5, NotChecked=0, Total=110 [2024-11-28 03:06:51,880 INFO L87 Difference]: Start difference. First operand 519 states and 692 transitions. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 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-11-28 03:06:55,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.40s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:06:59,653 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-11-28 03:07:03,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.79s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:07:07,563 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-11-28 03:07:09,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:07:12,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.61s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:07:16,719 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-11-28 03:07:18,700 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:07:22,706 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-11-28 03:07:26,708 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-11-28 03:07:30,712 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-11-28 03:07:34,716 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-11-28 03:07:38,727 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-11-28 03:07:42,734 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-11-28 03:07:44,889 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:07:48,891 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-11-28 03:07:52,893 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-11-28 03:07:56,895 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-11-28 03:08:00,899 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-11-28 03:08:04,906 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-11-28 03:08:08,916 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-11-28 03:08:11,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.40s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:08:15,344 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-11-28 03:08:19,347 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-11-28 03:08:23,353 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-11-28 03:08:27,355 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-11-28 03:08:31,361 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-11-28 03:08:35,365 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-11-28 03:08:48,356 WARN L286 SmtUtils]: Spent 8.94s on a formula simplification. DAG size of input: 42 DAG size of output: 41 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-28 03:08:52,426 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-11-28 03:08:54,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.40s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:08:58,844 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-11-28 03:09:02,846 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-11-28 03:09:06,851 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-11-28 03:09:09,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.56s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:09:13,508 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-11-28 03:09:17,512 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-11-28 03:09:21,518 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-11-28 03:09:25,880 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-11-28 03:09:29,882 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-11-28 03:09:33,887 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-11-28 03:09:34,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:09:34,403 INFO L93 Difference]: Finished difference Result 1022 states and 1379 transitions. [2024-11-28 03:09:34,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 03:09:34,405 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 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 73 [2024-11-28 03:09:34,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:09:34,409 INFO L225 Difference]: With dead ends: 1022 [2024-11-28 03:09:34,409 INFO L226 Difference]: Without dead ends: 546 [2024-11-28 03:09:34,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 51.1s TimeCoverageRelationStatistics Valid=26, Invalid=100, Unknown=6, NotChecked=0, Total=132 [2024-11-28 03:09:34,413 INFO L435 NwaCegarLoop]: 568 mSDtfsCounter, 52 mSDsluCounter, 3049 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 2 mSolverCounterUnsat, 31 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 149.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 3617 SdHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 31 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 149.5s IncrementalHoareTripleChecker+Time [2024-11-28 03:09:34,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 3617 Invalid, 730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 697 Invalid, 31 Unknown, 0 Unchecked, 149.5s Time] [2024-11-28 03:09:34,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2024-11-28 03:09:34,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 525. [2024-11-28 03:09:34,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 502 states have (on average 1.3346613545816732) internal successors, (670), 506 states have internal predecessors, (670), 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-11-28 03:09:34,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 700 transitions. [2024-11-28 03:09:34,436 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 700 transitions. Word has length 73 [2024-11-28 03:09:34,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:09:34,437 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 700 transitions. [2024-11-28 03:09:34,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 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-11-28 03:09:34,437 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 700 transitions. [2024-11-28 03:09:34,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-28 03:09:34,438 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:09:34,438 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:09:34,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-28 03:09:34,438 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-11-28 03:09:34,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:09:34,439 INFO L85 PathProgramCache]: Analyzing trace with hash 406189826, now seen corresponding path program 1 times [2024-11-28 03:09:34,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:09:34,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202395400] [2024-11-28 03:09:34,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:09:34,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:09:34,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:09:34,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:09:34,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:09:34,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202395400] [2024-11-28 03:09:34,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202395400] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:09:34,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:09:34,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-28 03:09:34,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604019895] [2024-11-28 03:09:34,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:09:34,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 03:09:34,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:09:34,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 03:09:34,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-28 03:09:34,797 INFO L87 Difference]: Start difference. First operand 525 states and 700 transitions. Second operand has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 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-11-28 03:09:35,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:09:35,733 INFO L93 Difference]: Finished difference Result 1028 states and 1378 transitions. [2024-11-28 03:09:35,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 03:09:35,734 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 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 73 [2024-11-28 03:09:35,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:09:35,738 INFO L225 Difference]: With dead ends: 1028 [2024-11-28 03:09:35,738 INFO L226 Difference]: Without dead ends: 546 [2024-11-28 03:09:35,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-28 03:09:35,741 INFO L435 NwaCegarLoop]: 575 mSDtfsCounter, 34 mSDsluCounter, 3527 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 4102 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-28 03:09:35,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 4102 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-28 03:09:35,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2024-11-28 03:09:35,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 522. [2024-11-28 03:09:35,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 499 states have (on average 1.3366733466933867) internal successors, (667), 503 states have internal predecessors, (667), 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-11-28 03:09:35,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 697 transitions. [2024-11-28 03:09:35,766 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 697 transitions. Word has length 73 [2024-11-28 03:09:35,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:09:35,766 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 697 transitions. [2024-11-28 03:09:35,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 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-11-28 03:09:35,767 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 697 transitions. [2024-11-28 03:09:35,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-28 03:09:35,767 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:09:35,768 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:09:35,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-28 03:09:35,768 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-11-28 03:09:35,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:09:35,768 INFO L85 PathProgramCache]: Analyzing trace with hash -461858095, now seen corresponding path program 1 times [2024-11-28 03:09:35,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:09:35,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803456530] [2024-11-28 03:09:35,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:09:35,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:09:35,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:09:36,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:09:36,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:09:36,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803456530] [2024-11-28 03:09:36,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803456530] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:09:36,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:09:36,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-28 03:09:36,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950611901] [2024-11-28 03:09:36,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:09:36,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-28 03:09:36,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:09:36,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-28 03:09:36,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-11-28 03:09:36,364 INFO L87 Difference]: Start difference. First operand 522 states and 697 transitions. Second operand has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 states have internal predecessors, (72), 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-11-28 03:09:37,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:09:37,475 INFO L93 Difference]: Finished difference Result 1013 states and 1365 transitions. [2024-11-28 03:09:37,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 03:09:37,476 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 states have internal predecessors, (72), 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 74 [2024-11-28 03:09:37,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:09:37,479 INFO L225 Difference]: With dead ends: 1013 [2024-11-28 03:09:37,479 INFO L226 Difference]: Without dead ends: 534 [2024-11-28 03:09:37,481 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-11-28 03:09:37,482 INFO L435 NwaCegarLoop]: 567 mSDtfsCounter, 16 mSDsluCounter, 4562 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 5129 SdHoareTripleChecker+Invalid, 866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:09:37,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 5129 Invalid, 866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-28 03:09:37,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2024-11-28 03:09:37,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 529. [2024-11-28 03:09:37,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 506 states have (on average 1.3359683794466404) internal successors, (676), 510 states have internal predecessors, (676), 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-11-28 03:09:37,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 706 transitions. [2024-11-28 03:09:37,507 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 706 transitions. Word has length 74 [2024-11-28 03:09:37,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:09:37,507 INFO L471 AbstractCegarLoop]: Abstraction has 529 states and 706 transitions. [2024-11-28 03:09:37,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 states have internal predecessors, (72), 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-11-28 03:09:37,508 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 706 transitions. [2024-11-28 03:09:37,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-28 03:09:37,509 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:09:37,509 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:09:37,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-28 03:09:37,509 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-28 03:09:37,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:09:37,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1123238857, now seen corresponding path program 1 times [2024-11-28 03:09:37,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:09:37,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839951381] [2024-11-28 03:09:37,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:09:37,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:09:37,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:09:37,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:09:37,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:09:37,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839951381] [2024-11-28 03:09:37,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839951381] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:09:37,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:09:37,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-28 03:09:37,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962062027] [2024-11-28 03:09:37,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:09:37,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 03:09:37,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:09:37,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 03:09:37,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-28 03:09:37,961 INFO L87 Difference]: Start difference. First operand 529 states and 706 transitions. Second operand has 9 states, 9 states have (on average 8.0) internal successors, (72), 9 states have internal predecessors, (72), 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-11-28 03:09:38,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:09:38,914 INFO L93 Difference]: Finished difference Result 1020 states and 1373 transitions. [2024-11-28 03:09:38,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 03:09:38,915 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 9 states have internal predecessors, (72), 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 74 [2024-11-28 03:09:38,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:09:38,917 INFO L225 Difference]: With dead ends: 1020 [2024-11-28 03:09:38,918 INFO L226 Difference]: Without dead ends: 534 [2024-11-28 03:09:38,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-28 03:09:38,920 INFO L435 NwaCegarLoop]: 571 mSDtfsCounter, 24 mSDsluCounter, 3585 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 4156 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-28 03:09:38,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 4156 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-28 03:09:38,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2024-11-28 03:09:38,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 526. [2024-11-28 03:09:38,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 503 states have (on average 1.3359840954274353) internal successors, (672), 507 states have internal predecessors, (672), 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-11-28 03:09:38,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 702 transitions. [2024-11-28 03:09:38,941 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 702 transitions. Word has length 74 [2024-11-28 03:09:38,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:09:38,942 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 702 transitions. [2024-11-28 03:09:38,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 9 states have internal predecessors, (72), 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-11-28 03:09:38,942 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 702 transitions. [2024-11-28 03:09:38,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-28 03:09:38,943 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:09:38,943 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:09:38,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-28 03:09:38,943 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-28 03:09:38,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:09:38,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1421328295, now seen corresponding path program 1 times [2024-11-28 03:09:38,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:09:38,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264793981] [2024-11-28 03:09:38,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:09:38,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:09:38,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:09:39,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:09:39,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:09:39,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264793981] [2024-11-28 03:09:39,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264793981] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:09:39,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:09:39,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-28 03:09:39,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775863969] [2024-11-28 03:09:39,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:09:39,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 03:09:39,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:09:39,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 03:09:39,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-28 03:09:39,266 INFO L87 Difference]: Start difference. First operand 526 states and 702 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 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-11-28 03:09:39,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:09:39,760 INFO L93 Difference]: Finished difference Result 1010 states and 1358 transitions. [2024-11-28 03:09:39,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 03:09:39,761 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 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 74 [2024-11-28 03:09:39,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:09:39,763 INFO L225 Difference]: With dead ends: 1010 [2024-11-28 03:09:39,763 INFO L226 Difference]: Without dead ends: 527 [2024-11-28 03:09:39,765 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-28 03:09:39,765 INFO L435 NwaCegarLoop]: 574 mSDtfsCounter, 53 mSDsluCounter, 2565 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 3139 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-28 03:09:39,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 3139 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-28 03:09:39,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2024-11-28 03:09:39,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 523. [2024-11-28 03:09:39,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 500 states have (on average 1.336) internal successors, (668), 504 states have internal predecessors, (668), 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-11-28 03:09:39,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 698 transitions. [2024-11-28 03:09:39,784 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 698 transitions. Word has length 74 [2024-11-28 03:09:39,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:09:39,784 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 698 transitions. [2024-11-28 03:09:39,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 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-11-28 03:09:39,785 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 698 transitions. [2024-11-28 03:09:39,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-28 03:09:39,785 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:09:39,785 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:09:39,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-28 03:09:39,786 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-28 03:09:39,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:09:39,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1089395943, now seen corresponding path program 1 times [2024-11-28 03:09:39,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:09:39,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112894409] [2024-11-28 03:09:39,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:09:39,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:09:39,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:09:40,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:09:40,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:09:40,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112894409] [2024-11-28 03:09:40,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112894409] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:09:40,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:09:40,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-28 03:09:40,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847191608] [2024-11-28 03:09:40,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:09:40,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-28 03:09:40,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:09:40,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-28 03:09:40,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-28 03:09:40,224 INFO L87 Difference]: Start difference. First operand 523 states and 698 transitions. Second operand has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 states have internal predecessors, (72), 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-11-28 03:09:42,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:09:43,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:09:43,431 INFO L93 Difference]: Finished difference Result 1019 states and 1374 transitions. [2024-11-28 03:09:43,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 03:09:43,432 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 states have internal predecessors, (72), 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 74 [2024-11-28 03:09:43,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:09:43,436 INFO L225 Difference]: With dead ends: 1019 [2024-11-28 03:09:43,436 INFO L226 Difference]: Without dead ends: 539 [2024-11-28 03:09:43,437 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-11-28 03:09:43,439 INFO L435 NwaCegarLoop]: 550 mSDtfsCounter, 18 mSDsluCounter, 5019 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 5569 SdHoareTripleChecker+Invalid, 885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:09:43,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 5569 Invalid, 885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-28 03:09:43,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2024-11-28 03:09:43,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 524. [2024-11-28 03:09:43,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 501 states have (on average 1.3353293413173652) internal successors, (669), 505 states have internal predecessors, (669), 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-11-28 03:09:43,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 699 transitions. [2024-11-28 03:09:43,464 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 699 transitions. Word has length 74 [2024-11-28 03:09:43,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:09:43,465 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 699 transitions. [2024-11-28 03:09:43,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 states have internal predecessors, (72), 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-11-28 03:09:43,465 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 699 transitions. [2024-11-28 03:09:43,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-28 03:09:43,466 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:09:43,466 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:09:43,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-28 03:09:43,467 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-28 03:09:43,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:09:43,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1971731707, now seen corresponding path program 1 times [2024-11-28 03:09:43,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:09:43,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040911242] [2024-11-28 03:09:43,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:09:43,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:09:43,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:09:44,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:09:44,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:09:44,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040911242] [2024-11-28 03:09:44,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040911242] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:09:44,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:09:44,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-28 03:09:44,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961169195] [2024-11-28 03:09:44,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:09:44,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-28 03:09:44,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:09:44,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-28 03:09:44,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2024-11-28 03:09:44,215 INFO L87 Difference]: Start difference. First operand 524 states and 699 transitions. Second operand has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 13 states have internal predecessors, (72), 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-11-28 03:09:45,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:09:45,541 INFO L93 Difference]: Finished difference Result 1037 states and 1394 transitions. [2024-11-28 03:09:45,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 03:09:45,542 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 13 states have internal predecessors, (72), 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 74 [2024-11-28 03:09:45,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:09:45,544 INFO L225 Difference]: With dead ends: 1037 [2024-11-28 03:09:45,545 INFO L226 Difference]: Without dead ends: 556 [2024-11-28 03:09:45,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2024-11-28 03:09:45,546 INFO L435 NwaCegarLoop]: 559 mSDtfsCounter, 47 mSDsluCounter, 5570 mSDsCounter, 0 mSdLazyCounter, 1052 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 6129 SdHoareTripleChecker+Invalid, 1053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:09:45,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 6129 Invalid, 1053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1052 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-28 03:09:45,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2024-11-28 03:09:45,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 533. [2024-11-28 03:09:45,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 510 states have (on average 1.3352941176470587) internal successors, (681), 514 states have internal predecessors, (681), 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-11-28 03:09:45,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 711 transitions. [2024-11-28 03:09:45,566 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 711 transitions. Word has length 74 [2024-11-28 03:09:45,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:09:45,567 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 711 transitions. [2024-11-28 03:09:45,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 13 states have internal predecessors, (72), 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-11-28 03:09:45,567 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 711 transitions. [2024-11-28 03:09:45,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-28 03:09:45,569 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:09:45,569 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:09:45,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-28 03:09:45,569 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-28 03:09:45,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:09:45,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1124895847, now seen corresponding path program 1 times [2024-11-28 03:09:45,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:09:45,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93539715] [2024-11-28 03:09:45,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:09:45,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:09:45,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:09:47,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:09:47,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:09:47,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93539715] [2024-11-28 03:09:47,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93539715] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:09:47,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:09:47,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-28 03:09:47,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831156173] [2024-11-28 03:09:47,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:09:47,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-28 03:09:47,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:09:47,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-28 03:09:47,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-28 03:09:47,192 INFO L87 Difference]: Start difference. First operand 533 states and 711 transitions. Second operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 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-11-28 03:09:50,332 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:09:51,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:09:51,180 INFO L93 Difference]: Finished difference Result 1095 states and 1476 transitions. [2024-11-28 03:09:51,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 03:09:51,180 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 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 74 [2024-11-28 03:09:51,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:09:51,183 INFO L225 Difference]: With dead ends: 1095 [2024-11-28 03:09:51,183 INFO L226 Difference]: Without dead ends: 605 [2024-11-28 03:09:51,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-28 03:09:51,185 INFO L435 NwaCegarLoop]: 633 mSDtfsCounter, 112 mSDsluCounter, 4573 mSDsCounter, 0 mSdLazyCounter, 925 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 5206 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-28 03:09:51,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 5206 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 925 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-28 03:09:51,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2024-11-28 03:09:51,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 534. [2024-11-28 03:09:51,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 511 states have (on average 1.3365949119373777) internal successors, (683), 515 states have internal predecessors, (683), 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-11-28 03:09:51,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 713 transitions. [2024-11-28 03:09:51,224 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 713 transitions. Word has length 74 [2024-11-28 03:09:51,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:09:51,224 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 713 transitions. [2024-11-28 03:09:51,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 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-11-28 03:09:51,225 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 713 transitions. [2024-11-28 03:09:51,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-28 03:09:51,226 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:09:51,226 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:09:51,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-28 03:09:51,226 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-28 03:09:51,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:09:51,227 INFO L85 PathProgramCache]: Analyzing trace with hash 935546669, now seen corresponding path program 1 times [2024-11-28 03:09:51,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:09:51,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676133810] [2024-11-28 03:09:51,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:09:51,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:09:51,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:09:51,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:09:51,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:09:51,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676133810] [2024-11-28 03:09:51,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676133810] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:09:51,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:09:51,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-28 03:09:51,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352147629] [2024-11-28 03:09:51,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:09:51,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 03:09:51,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:09:51,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 03:09:51,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-28 03:09:51,987 INFO L87 Difference]: Start difference. First operand 534 states and 713 transitions. Second operand has 9 states, 9 states have (on average 8.0) internal successors, (72), 9 states have internal predecessors, (72), 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-11-28 03:09:56,406 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-11-28 03:09:58,064 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:10:02,067 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-11-28 03:10:06,965 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-11-28 03:10:10,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.36s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:10:11,942 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:10:13,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:10:14,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:10:14,315 INFO L93 Difference]: Finished difference Result 1046 states and 1409 transitions. [2024-11-28 03:10:14,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 03:10:14,316 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 9 states have internal predecessors, (72), 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 74 [2024-11-28 03:10:14,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:10:14,319 INFO L225 Difference]: With dead ends: 1046 [2024-11-28 03:10:14,319 INFO L226 Difference]: Without dead ends: 555 [2024-11-28 03:10:14,320 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-28 03:10:14,321 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 82 mSDsluCounter, 3508 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 9 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 4065 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:10:14,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 4065 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 641 Invalid, 3 Unknown, 0 Unchecked, 22.2s Time] [2024-11-28 03:10:14,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2024-11-28 03:10:14,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 534. [2024-11-28 03:10:14,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 511 states have (on average 1.3365949119373777) internal successors, (683), 515 states have internal predecessors, (683), 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-11-28 03:10:14,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 713 transitions. [2024-11-28 03:10:14,348 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 713 transitions. Word has length 74 [2024-11-28 03:10:14,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:10:14,348 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 713 transitions. [2024-11-28 03:10:14,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 9 states have internal predecessors, (72), 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-11-28 03:10:14,349 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 713 transitions. [2024-11-28 03:10:14,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-28 03:10:14,349 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:10:14,350 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:10:14,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-28 03:10:14,350 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-28 03:10:14,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:10:14,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1040881089, now seen corresponding path program 1 times [2024-11-28 03:10:14,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:10:14,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738343748] [2024-11-28 03:10:14,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:10:14,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:10:14,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:10:14,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:10:14,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:10:14,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738343748] [2024-11-28 03:10:14,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738343748] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:10:14,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:10:14,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-28 03:10:14,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042425305] [2024-11-28 03:10:14,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:10:14,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 03:10:14,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:10:14,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 03:10:14,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-28 03:10:14,732 INFO L87 Difference]: Start difference. First operand 534 states and 713 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 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-11-28 03:10:15,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:10:15,658 INFO L93 Difference]: Finished difference Result 1059 states and 1421 transitions. [2024-11-28 03:10:15,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 03:10:15,659 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 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 74 [2024-11-28 03:10:15,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:10:15,662 INFO L225 Difference]: With dead ends: 1059 [2024-11-28 03:10:15,663 INFO L226 Difference]: Without dead ends: 568 [2024-11-28 03:10:15,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-11-28 03:10:15,681 INFO L435 NwaCegarLoop]: 571 mSDtfsCounter, 99 mSDsluCounter, 2513 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 3084 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-28 03:10:15,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 3084 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-28 03:10:15,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2024-11-28 03:10:15,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 530. [2024-11-28 03:10:15,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 507 states have (on average 1.339250493096647) internal successors, (679), 511 states have internal predecessors, (679), 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-11-28 03:10:15,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 709 transitions. [2024-11-28 03:10:15,707 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 709 transitions. Word has length 74 [2024-11-28 03:10:15,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:10:15,708 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 709 transitions. [2024-11-28 03:10:15,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 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-11-28 03:10:15,708 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 709 transitions. [2024-11-28 03:10:15,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-28 03:10:15,710 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:10:15,710 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:10:15,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-28 03:10:15,711 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-28 03:10:15,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:10:15,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1846562487, now seen corresponding path program 1 times [2024-11-28 03:10:15,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:10:15,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697062541] [2024-11-28 03:10:15,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:10:15,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:10:15,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:10:16,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:10:16,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:10:16,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697062541] [2024-11-28 03:10:16,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697062541] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:10:16,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:10:16,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-28 03:10:16,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548003510] [2024-11-28 03:10:16,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:10:16,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 03:10:16,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:10:16,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 03:10:16,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-28 03:10:16,197 INFO L87 Difference]: Start difference. First operand 530 states and 709 transitions. Second operand has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 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-11-28 03:10:17,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:10:17,073 INFO L93 Difference]: Finished difference Result 1036 states and 1394 transitions. [2024-11-28 03:10:17,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 03:10:17,074 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 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 74 [2024-11-28 03:10:17,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:10:17,077 INFO L225 Difference]: With dead ends: 1036 [2024-11-28 03:10:17,078 INFO L226 Difference]: Without dead ends: 540 [2024-11-28 03:10:17,079 INFO L434 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-11-28 03:10:17,080 INFO L435 NwaCegarLoop]: 569 mSDtfsCounter, 12 mSDsluCounter, 4059 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 4628 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-28 03:10:17,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 4628 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-28 03:10:17,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2024-11-28 03:10:17,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 530. [2024-11-28 03:10:17,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 507 states have (on average 1.339250493096647) internal successors, (679), 511 states have internal predecessors, (679), 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-11-28 03:10:17,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 709 transitions. [2024-11-28 03:10:17,109 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 709 transitions. Word has length 74 [2024-11-28 03:10:17,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:10:17,109 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 709 transitions. [2024-11-28 03:10:17,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 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-11-28 03:10:17,110 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 709 transitions. [2024-11-28 03:10:17,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-28 03:10:17,111 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:10:17,111 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:10:17,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-28 03:10:17,112 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-28 03:10:17,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:10:17,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1177135627, now seen corresponding path program 1 times [2024-11-28 03:10:17,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:10:17,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123043337] [2024-11-28 03:10:17,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:10:17,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:10:17,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:10:18,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:10:18,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:10:18,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123043337] [2024-11-28 03:10:18,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123043337] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:10:18,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:10:18,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-28 03:10:18,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325937899] [2024-11-28 03:10:18,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:10:18,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-28 03:10:18,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:10:18,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-28 03:10:18,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-28 03:10:18,140 INFO L87 Difference]: Start difference. First operand 530 states and 709 transitions. Second operand has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 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-11-28 03:10:18,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:10:18,991 INFO L93 Difference]: Finished difference Result 1022 states and 1376 transitions. [2024-11-28 03:10:18,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 03:10:18,995 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 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 75 [2024-11-28 03:10:18,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:10:18,999 INFO L225 Difference]: With dead ends: 1022 [2024-11-28 03:10:19,002 INFO L226 Difference]: Without dead ends: 526 [2024-11-28 03:10:19,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-28 03:10:19,007 INFO L435 NwaCegarLoop]: 563 mSDtfsCounter, 12 mSDsluCounter, 3512 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 4075 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-28 03:10:19,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 4075 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-28 03:10:19,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2024-11-28 03:10:19,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 516. [2024-11-28 03:10:19,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 493 states have (on average 1.3427991886409736) internal successors, (662), 497 states have internal predecessors, (662), 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-11-28 03:10:19,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 692 transitions. [2024-11-28 03:10:19,086 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 692 transitions. Word has length 75 [2024-11-28 03:10:19,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:10:19,086 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 692 transitions. [2024-11-28 03:10:19,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 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-11-28 03:10:19,087 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 692 transitions. [2024-11-28 03:10:19,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-28 03:10:19,088 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:10:19,089 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:10:19,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-28 03:10:19,089 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-28 03:10:19,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:10:19,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1302510926, now seen corresponding path program 1 times [2024-11-28 03:10:19,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:10:19,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542046368] [2024-11-28 03:10:19,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:10:19,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:10:19,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:10:19,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:10:19,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:10:19,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542046368] [2024-11-28 03:10:19,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542046368] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:10:19,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:10:19,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-28 03:10:19,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544990839] [2024-11-28 03:10:19,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:10:19,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 03:10:19,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:10:19,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 03:10:19,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-28 03:10:19,597 INFO L87 Difference]: Start difference. First operand 516 states and 692 transitions. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 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-11-28 03:10:20,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:10:20,293 INFO L93 Difference]: Finished difference Result 1014 states and 1365 transitions. [2024-11-28 03:10:20,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 03:10:20,294 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 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 75 [2024-11-28 03:10:20,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:10:20,297 INFO L225 Difference]: With dead ends: 1014 [2024-11-28 03:10:20,297 INFO L226 Difference]: Without dead ends: 532 [2024-11-28 03:10:20,298 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-28 03:10:20,299 INFO L435 NwaCegarLoop]: 564 mSDtfsCounter, 13 mSDsluCounter, 3564 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 4128 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-28 03:10:20,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 4128 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-28 03:10:20,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2024-11-28 03:10:20,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 527. [2024-11-28 03:10:20,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 504 states have (on average 1.3373015873015872) internal successors, (674), 508 states have internal predecessors, (674), 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-11-28 03:10:20,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 704 transitions. [2024-11-28 03:10:20,331 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 704 transitions. Word has length 75 [2024-11-28 03:10:20,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:10:20,331 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 704 transitions. [2024-11-28 03:10:20,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 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-11-28 03:10:20,332 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 704 transitions. [2024-11-28 03:10:20,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-28 03:10:20,332 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:10:20,332 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:10:20,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-28 03:10:20,333 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-28 03:10:20,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:10:20,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1118575210, now seen corresponding path program 1 times [2024-11-28 03:10:20,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:10:20,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356843605] [2024-11-28 03:10:20,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:10:20,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:10:20,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:10:21,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:10:21,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:10:21,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356843605] [2024-11-28 03:10:21,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356843605] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:10:21,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:10:21,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-28 03:10:21,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044419340] [2024-11-28 03:10:21,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:10:21,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-28 03:10:21,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:10:21,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-28 03:10:21,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-28 03:10:21,003 INFO L87 Difference]: Start difference. First operand 527 states and 704 transitions. Second operand has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 states have internal predecessors, (73), 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-11-28 03:10:21,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:10:21,992 INFO L93 Difference]: Finished difference Result 1035 states and 1391 transitions. [2024-11-28 03:10:21,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 03:10:21,993 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 states have internal predecessors, (73), 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 75 [2024-11-28 03:10:21,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:10:21,996 INFO L225 Difference]: With dead ends: 1035 [2024-11-28 03:10:21,996 INFO L226 Difference]: Without dead ends: 542 [2024-11-28 03:10:21,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-11-28 03:10:21,998 INFO L435 NwaCegarLoop]: 570 mSDtfsCounter, 17 mSDsluCounter, 5044 mSDsCounter, 0 mSdLazyCounter, 1012 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 5614 SdHoareTripleChecker+Invalid, 1013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-28 03:10:21,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 5614 Invalid, 1013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1012 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-28 03:10:21,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2024-11-28 03:10:22,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 532. [2024-11-28 03:10:22,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 509 states have (on average 1.3359528487229861) internal successors, (680), 513 states have internal predecessors, (680), 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-11-28 03:10:22,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 710 transitions. [2024-11-28 03:10:22,017 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 710 transitions. Word has length 75 [2024-11-28 03:10:22,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:10:22,017 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 710 transitions. [2024-11-28 03:10:22,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 states have internal predecessors, (73), 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-11-28 03:10:22,017 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 710 transitions. [2024-11-28 03:10:22,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-28 03:10:22,018 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:10:22,018 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:10:22,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-28 03:10:22,019 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-28 03:10:22,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:10:22,019 INFO L85 PathProgramCache]: Analyzing trace with hash -754320420, now seen corresponding path program 1 times [2024-11-28 03:10:22,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:10:22,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981292392] [2024-11-28 03:10:22,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:10:22,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:10:22,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:10:22,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:10:22,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:10:22,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981292392] [2024-11-28 03:10:22,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981292392] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:10:22,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:10:22,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-28 03:10:22,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385161064] [2024-11-28 03:10:22,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:10:22,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-28 03:10:22,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:10:22,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-28 03:10:22,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2024-11-28 03:10:22,792 INFO L87 Difference]: Start difference. First operand 532 states and 710 transitions. Second operand has 14 states, 14 states have (on average 5.214285714285714) internal successors, (73), 14 states have internal predecessors, (73), 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-11-28 03:10:24,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:10:24,315 INFO L93 Difference]: Finished difference Result 1053 states and 1414 transitions. [2024-11-28 03:10:24,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 03:10:24,316 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.214285714285714) internal successors, (73), 14 states have internal predecessors, (73), 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 75 [2024-11-28 03:10:24,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:10:24,319 INFO L225 Difference]: With dead ends: 1053 [2024-11-28 03:10:24,319 INFO L226 Difference]: Without dead ends: 555 [2024-11-28 03:10:24,321 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2024-11-28 03:10:24,321 INFO L435 NwaCegarLoop]: 569 mSDtfsCounter, 49 mSDsluCounter, 6102 mSDsCounter, 0 mSdLazyCounter, 1300 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 6671 SdHoareTripleChecker+Invalid, 1303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-28 03:10:24,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 6671 Invalid, 1303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1300 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-28 03:10:24,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2024-11-28 03:10:24,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 532. [2024-11-28 03:10:24,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 509 states have (on average 1.3359528487229861) internal successors, (680), 513 states have internal predecessors, (680), 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-11-28 03:10:24,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 710 transitions. [2024-11-28 03:10:24,346 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 710 transitions. Word has length 75 [2024-11-28 03:10:24,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:10:24,346 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 710 transitions. [2024-11-28 03:10:24,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.214285714285714) internal successors, (73), 14 states have internal predecessors, (73), 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-11-28 03:10:24,347 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 710 transitions. [2024-11-28 03:10:24,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-28 03:10:24,348 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:10:24,348 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:10:24,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-28 03:10:24,348 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-28 03:10:24,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:10:24,349 INFO L85 PathProgramCache]: Analyzing trace with hash 92515440, now seen corresponding path program 1 times [2024-11-28 03:10:24,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:10:24,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161195694] [2024-11-28 03:10:24,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:10:24,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:10:24,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:10:24,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:10:24,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:10:24,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161195694] [2024-11-28 03:10:24,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161195694] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:10:24,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:10:24,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-28 03:10:24,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539836365] [2024-11-28 03:10:24,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:10:24,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-28 03:10:24,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:10:24,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-28 03:10:24,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-28 03:10:24,890 INFO L87 Difference]: Start difference. First operand 532 states and 710 transitions. Second operand has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 states have internal predecessors, (73), 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-11-28 03:10:25,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:10:25,841 INFO L93 Difference]: Finished difference Result 1042 states and 1401 transitions. [2024-11-28 03:10:25,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 03:10:25,841 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 states have internal predecessors, (73), 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 75 [2024-11-28 03:10:25,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:10:25,843 INFO L225 Difference]: With dead ends: 1042 [2024-11-28 03:10:25,843 INFO L226 Difference]: Without dead ends: 544 [2024-11-28 03:10:25,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-11-28 03:10:25,845 INFO L435 NwaCegarLoop]: 559 mSDtfsCounter, 17 mSDsluCounter, 5030 mSDsCounter, 0 mSdLazyCounter, 958 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 5589 SdHoareTripleChecker+Invalid, 959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-28 03:10:25,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 5589 Invalid, 959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 958 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-28 03:10:25,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2024-11-28 03:10:25,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 530. [2024-11-28 03:10:25,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 507 states have (on average 1.3353057199211045) internal successors, (677), 511 states have internal predecessors, (677), 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-11-28 03:10:25,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 707 transitions. [2024-11-28 03:10:25,861 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 707 transitions. Word has length 75 [2024-11-28 03:10:25,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:10:25,861 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 707 transitions. [2024-11-28 03:10:25,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 states have internal predecessors, (73), 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-11-28 03:10:25,862 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 707 transitions. [2024-11-28 03:10:25,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-28 03:10:25,863 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:10:25,863 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:10:25,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-28 03:10:25,863 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-28 03:10:25,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:10:25,864 INFO L85 PathProgramCache]: Analyzing trace with hash -2142009340, now seen corresponding path program 1 times [2024-11-28 03:10:25,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:10:25,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344984834] [2024-11-28 03:10:25,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:10:25,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:10:25,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:10:26,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:10:26,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:10:26,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344984834] [2024-11-28 03:10:26,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344984834] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:10:26,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:10:26,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-28 03:10:26,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56677230] [2024-11-28 03:10:26,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:10:26,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 03:10:26,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:10:26,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 03:10:26,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-28 03:10:26,254 INFO L87 Difference]: Start difference. First operand 530 states and 707 transitions. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 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-11-28 03:10:26,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:10:26,971 INFO L93 Difference]: Finished difference Result 1035 states and 1390 transitions. [2024-11-28 03:10:26,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 03:10:26,972 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 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 75 [2024-11-28 03:10:26,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:10:26,975 INFO L225 Difference]: With dead ends: 1035 [2024-11-28 03:10:26,975 INFO L226 Difference]: Without dead ends: 539 [2024-11-28 03:10:26,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-28 03:10:26,978 INFO L435 NwaCegarLoop]: 559 mSDtfsCounter, 48 mSDsluCounter, 4015 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 4574 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-28 03:10:26,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 4574 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 673 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-28 03:10:26,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2024-11-28 03:10:26,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 528. [2024-11-28 03:10:26,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 505 states have (on average 1.3346534653465347) internal successors, (674), 509 states have internal predecessors, (674), 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-11-28 03:10:26,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 704 transitions. [2024-11-28 03:10:27,000 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 704 transitions. Word has length 75 [2024-11-28 03:10:27,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:10:27,001 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 704 transitions. [2024-11-28 03:10:27,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 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-11-28 03:10:27,001 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 704 transitions. [2024-11-28 03:10:27,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-28 03:10:27,002 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:10:27,002 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:10:27,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-28 03:10:27,003 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-28 03:10:27,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:10:27,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1236855830, now seen corresponding path program 1 times [2024-11-28 03:10:27,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:10:27,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138309046] [2024-11-28 03:10:27,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:10:27,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:10:27,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:10:27,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:10:27,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:10:27,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138309046] [2024-11-28 03:10:27,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138309046] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:10:27,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:10:27,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-28 03:10:27,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007906128] [2024-11-28 03:10:27,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:10:27,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-28 03:10:27,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:10:27,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-28 03:10:27,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-11-28 03:10:27,941 INFO L87 Difference]: Start difference. First operand 528 states and 704 transitions. Second operand has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 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-11-28 03:10:29,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:10:29,639 INFO L93 Difference]: Finished difference Result 1048 states and 1409 transitions. [2024-11-28 03:10:29,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 03:10:29,641 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 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 75 [2024-11-28 03:10:29,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:10:29,643 INFO L225 Difference]: With dead ends: 1048 [2024-11-28 03:10:29,644 INFO L226 Difference]: Without dead ends: 554 [2024-11-28 03:10:29,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-11-28 03:10:29,645 INFO L435 NwaCegarLoop]: 546 mSDtfsCounter, 36 mSDsluCounter, 4534 mSDsCounter, 0 mSdLazyCounter, 911 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 5080 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-28 03:10:29,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 5080 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 911 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-28 03:10:29,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2024-11-28 03:10:29,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 538. [2024-11-28 03:10:29,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 515 states have (on average 1.3339805825242719) internal successors, (687), 519 states have internal predecessors, (687), 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-11-28 03:10:29,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 717 transitions. [2024-11-28 03:10:29,665 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 717 transitions. Word has length 75 [2024-11-28 03:10:29,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:10:29,665 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 717 transitions. [2024-11-28 03:10:29,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 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-11-28 03:10:29,665 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 717 transitions. [2024-11-28 03:10:29,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-28 03:10:29,666 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:10:29,667 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:10:29,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-28 03:10:29,667 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-28 03:10:29,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:10:29,668 INFO L85 PathProgramCache]: Analyzing trace with hash -103242493, now seen corresponding path program 1 times [2024-11-28 03:10:29,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:10:29,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505796568] [2024-11-28 03:10:29,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:10:29,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:10:29,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:10:35,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:10:35,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:10:35,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505796568] [2024-11-28 03:10:35,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505796568] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:10:35,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:10:35,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-28 03:10:35,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071094742] [2024-11-28 03:10:35,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:10:35,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-28 03:10:35,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:10:35,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-28 03:10:35,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2024-11-28 03:10:35,345 INFO L87 Difference]: Start difference. First operand 538 states and 717 transitions. Second operand has 14 states, 14 states have (on average 5.214285714285714) internal successors, (73), 14 states have internal predecessors, (73), 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-11-28 03:10:40,215 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-11-28 03:10:44,230 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-11-28 03:10:48,238 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-11-28 03:10:52,247 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-11-28 03:10:56,252 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-11-28 03:11:00,263 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-11-28 03:11:04,266 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-11-28 03:11:08,277 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-11-28 03:11:12,294 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-11-28 03:11:16,307 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-11-28 03:11:20,316 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-11-28 03:11:24,327 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-11-28 03:11:25,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:11:25,975 INFO L93 Difference]: Finished difference Result 1053 states and 1414 transitions. [2024-11-28 03:11:25,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 03:11:25,976 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.214285714285714) internal successors, (73), 14 states have internal predecessors, (73), 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 75 [2024-11-28 03:11:25,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:11:25,979 INFO L225 Difference]: With dead ends: 1053 [2024-11-28 03:11:25,979 INFO L226 Difference]: Without dead ends: 549 [2024-11-28 03:11:25,980 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2024-11-28 03:11:25,981 INFO L435 NwaCegarLoop]: 551 mSDtfsCounter, 22 mSDsluCounter, 5495 mSDsCounter, 0 mSdLazyCounter, 1003 mSolverCounterSat, 1 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 50.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 6046 SdHoareTripleChecker+Invalid, 1016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1003 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 50.6s IncrementalHoareTripleChecker+Time [2024-11-28 03:11:25,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 6046 Invalid, 1016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1003 Invalid, 12 Unknown, 0 Unchecked, 50.6s Time] [2024-11-28 03:11:25,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2024-11-28 03:11:25,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 542. [2024-11-28 03:11:25,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 519 states have (on average 1.3333333333333333) internal successors, (692), 523 states have internal predecessors, (692), 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-11-28 03:11:25,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 722 transitions. [2024-11-28 03:11:26,000 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 722 transitions. Word has length 75 [2024-11-28 03:11:26,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:11:26,000 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 722 transitions. [2024-11-28 03:11:26,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.214285714285714) internal successors, (73), 14 states have internal predecessors, (73), 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-11-28 03:11:26,001 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 722 transitions. [2024-11-28 03:11:26,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-28 03:11:26,001 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:11:26,002 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:11:26,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-28 03:11:26,002 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-28 03:11:26,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:11:26,003 INFO L85 PathProgramCache]: Analyzing trace with hash 2097801795, now seen corresponding path program 1 times [2024-11-28 03:11:26,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:11:26,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291255820] [2024-11-28 03:11:26,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:11:26,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:11:26,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:11:57,950 WARN L286 SmtUtils]: Spent 5.59s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-28 03:12:03,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:12:03,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:12:03,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291255820] [2024-11-28 03:12:03,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291255820] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:12:03,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:12:03,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-28 03:12:03,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967007026] [2024-11-28 03:12:03,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:12:03,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-28 03:12:03,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:12:03,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-28 03:12:03,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=86, Unknown=5, NotChecked=0, Total=110 [2024-11-28 03:12:03,590 INFO L87 Difference]: Start difference. First operand 542 states and 722 transitions. Second operand has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 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-11-28 03:12:05,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:12:09,773 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-11-28 03:12:11,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:12:14,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.98s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:12:18,743 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-11-28 03:12:22,748 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-11-28 03:12:26,755 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-11-28 03:12:27,938 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:12:31,947 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-11-28 03:12:35,950 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-11-28 03:12:39,955 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-11-28 03:12:43,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.56s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:12:44,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:12:44,028 INFO L93 Difference]: Finished difference Result 1059 states and 1421 transitions. [2024-11-28 03:12:44,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 03:12:44,029 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 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 75 [2024-11-28 03:12:44,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:12:44,032 INFO L225 Difference]: With dead ends: 1059 [2024-11-28 03:12:44,032 INFO L226 Difference]: Without dead ends: 551 [2024-11-28 03:12:44,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 29.8s TimeCoverageRelationStatistics Valid=19, Invalid=86, Unknown=5, NotChecked=0, Total=110 [2024-11-28 03:12:44,033 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 17 mSDsluCounter, 4503 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 1 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 5060 SdHoareTripleChecker+Invalid, 806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40.4s IncrementalHoareTripleChecker+Time [2024-11-28 03:12:44,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 5060 Invalid, 806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 798 Invalid, 7 Unknown, 0 Unchecked, 40.4s Time] [2024-11-28 03:12:44,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2024-11-28 03:12:44,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 547. [2024-11-28 03:12:44,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 524 states have (on average 1.333969465648855) internal successors, (699), 528 states have internal predecessors, (699), 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-11-28 03:12:44,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 729 transitions. [2024-11-28 03:12:44,051 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 729 transitions. Word has length 75 [2024-11-28 03:12:44,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:12:44,051 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 729 transitions. [2024-11-28 03:12:44,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 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-11-28 03:12:44,051 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 729 transitions. [2024-11-28 03:12:44,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-28 03:12:44,052 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:12:44,052 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:12:44,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-28 03:12:44,052 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-28 03:12:44,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:12:44,053 INFO L85 PathProgramCache]: Analyzing trace with hash -677889174, now seen corresponding path program 1 times [2024-11-28 03:12:44,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:12:44,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021541556] [2024-11-28 03:12:44,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:12:44,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:12:44,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:12:44,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:12:44,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:12:44,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021541556] [2024-11-28 03:12:44,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021541556] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:12:44,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:12:44,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-28 03:12:44,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031316637] [2024-11-28 03:12:44,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:12:44,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 03:12:44,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:12:44,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 03:12:44,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-28 03:12:44,448 INFO L87 Difference]: Start difference. First operand 547 states and 729 transitions. Second operand has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 9 states have internal predecessors, (73), 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-11-28 03:12:45,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:12:45,693 INFO L93 Difference]: Finished difference Result 1127 states and 1513 transitions. [2024-11-28 03:12:45,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-28 03:12:45,694 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 9 states have internal predecessors, (73), 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 75 [2024-11-28 03:12:45,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:12:45,699 INFO L225 Difference]: With dead ends: 1127 [2024-11-28 03:12:45,700 INFO L226 Difference]: Without dead ends: 614 [2024-11-28 03:12:45,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2024-11-28 03:12:45,705 INFO L435 NwaCegarLoop]: 568 mSDtfsCounter, 133 mSDsluCounter, 3066 mSDsCounter, 0 mSdLazyCounter, 897 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 3634 SdHoareTripleChecker+Invalid, 919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:12:45,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 3634 Invalid, 919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 897 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-28 03:12:45,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2024-11-28 03:12:45,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 550. [2024-11-28 03:12:45,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 527 states have (on average 1.333965844402277) internal successors, (703), 531 states have internal predecessors, (703), 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-11-28 03:12:45,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 733 transitions. [2024-11-28 03:12:45,728 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 733 transitions. Word has length 75 [2024-11-28 03:12:45,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:12:45,732 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 733 transitions. [2024-11-28 03:12:45,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 9 states have internal predecessors, (73), 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-11-28 03:12:45,732 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 733 transitions. [2024-11-28 03:12:45,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-28 03:12:45,733 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:12:45,733 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:12:45,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-11-28 03:12:45,733 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-28 03:12:45,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:12:45,734 INFO L85 PathProgramCache]: Analyzing trace with hash -381844758, now seen corresponding path program 1 times [2024-11-28 03:12:45,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:12:45,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629827708] [2024-11-28 03:12:45,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:12:45,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:12:45,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:12:46,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:12:46,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:12:46,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629827708] [2024-11-28 03:12:46,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629827708] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:12:46,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:12:46,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-28 03:12:46,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951538521] [2024-11-28 03:12:46,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:12:46,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-28 03:12:46,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:12:46,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-28 03:12:46,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2024-11-28 03:12:46,553 INFO L87 Difference]: Start difference. First operand 550 states and 733 transitions. Second operand has 17 states, 17 states have (on average 4.294117647058823) internal successors, (73), 17 states have internal predecessors, (73), 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-11-28 03:12:48,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:12:48,060 INFO L93 Difference]: Finished difference Result 1094 states and 1472 transitions. [2024-11-28 03:12:48,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-28 03:12:48,064 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.294117647058823) internal successors, (73), 17 states have internal predecessors, (73), 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 75 [2024-11-28 03:12:48,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:12:48,067 INFO L225 Difference]: With dead ends: 1094 [2024-11-28 03:12:48,071 INFO L226 Difference]: Without dead ends: 578 [2024-11-28 03:12:48,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2024-11-28 03:12:48,073 INFO L435 NwaCegarLoop]: 549 mSDtfsCounter, 37 mSDsluCounter, 6511 mSDsCounter, 0 mSdLazyCounter, 1465 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 7060 SdHoareTripleChecker+Invalid, 1465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-28 03:12:48,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 7060 Invalid, 1465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1465 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-28 03:12:48,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2024-11-28 03:12:48,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 562. [2024-11-28 03:12:48,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 539 states have (on average 1.3358070500927643) internal successors, (720), 543 states have internal predecessors, (720), 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-11-28 03:12:48,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 750 transitions. [2024-11-28 03:12:48,117 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 750 transitions. Word has length 75 [2024-11-28 03:12:48,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:12:48,121 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 750 transitions. [2024-11-28 03:12:48,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.294117647058823) internal successors, (73), 17 states have internal predecessors, (73), 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-11-28 03:12:48,122 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 750 transitions. [2024-11-28 03:12:48,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-28 03:12:48,122 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:12:48,123 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:12:48,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-28 03:12:48,124 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-28 03:12:48,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:12:48,124 INFO L85 PathProgramCache]: Analyzing trace with hash -117514365, now seen corresponding path program 1 times [2024-11-28 03:12:48,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:12:48,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162500603] [2024-11-28 03:12:48,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:12:48,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:12:48,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat