./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-1.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_9bc39e3c-6c1b-4d51-b26c-ae93b3a57c3e/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bc39e3c-6c1b-4d51-b26c-ae93b3a57c3e/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_9bc39e3c-6c1b-4d51-b26c-ae93b3a57c3e/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bc39e3c-6c1b-4d51-b26c-ae93b3a57c3e/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bc39e3c-6c1b-4d51-b26c-ae93b3a57c3e/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_9bc39e3c-6c1b-4d51-b26c-ae93b3a57c3e/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 ac848265e1daab3ca0f2905a3d0d6fdafaee38399ca7123ad8517babc999ef80 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 05:18:41,818 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 05:18:41,931 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bc39e3c-6c1b-4d51-b26c-ae93b3a57c3e/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-28 05:18:41,941 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 05:18:41,941 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 05:18:41,982 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 05:18:41,983 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 05:18:41,983 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 05:18:41,984 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 05:18:41,984 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 05:18:41,985 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 05:18:41,986 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 05:18:41,986 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 05:18:41,987 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 05:18:41,987 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 05:18:41,987 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 05:18:41,987 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 05:18:41,987 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 05:18:41,987 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 05:18:41,987 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 05:18:41,987 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 05:18:41,988 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 05:18:41,988 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 05:18:41,988 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 05:18:41,988 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 05:18:41,988 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 05:18:41,988 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 05:18:41,988 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 05:18:41,988 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 05:18:41,988 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 05:18:41,988 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 05:18:41,988 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 05:18:41,989 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:18:41,989 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 05:18:41,989 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 05:18:41,989 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 05:18:41,989 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 05:18:41,989 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:18:41,989 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 05:18:41,989 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 05:18:41,989 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 05:18:41,990 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 05:18:41,990 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 05:18:41,990 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 05:18:41,990 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 05:18:41,990 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 05:18:41,991 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 05:18:41,992 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 05:18:41,992 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_9bc39e3c-6c1b-4d51-b26c-ae93b3a57c3e/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 -> ac848265e1daab3ca0f2905a3d0d6fdafaee38399ca7123ad8517babc999ef80 [2024-11-28 05:18:42,340 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 05:18:42,356 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 05:18:42,360 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 05:18:42,361 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 05:18:42,362 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 05:18:42,364 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bc39e3c-6c1b-4d51-b26c-ae93b3a57c3e/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-1.i [2024-11-28 05:18:45,547 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bc39e3c-6c1b-4d51-b26c-ae93b3a57c3e/bin/uautomizer-verify-aQ6SnzHsRB/data/9d0445cee/8a0651be659b44f3bdfed457c0cb2379/FLAG9c288127e [2024-11-28 05:18:45,922 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 05:18:45,923 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bc39e3c-6c1b-4d51-b26c-ae93b3a57c3e/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-1.i [2024-11-28 05:18:45,940 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bc39e3c-6c1b-4d51-b26c-ae93b3a57c3e/bin/uautomizer-verify-aQ6SnzHsRB/data/9d0445cee/8a0651be659b44f3bdfed457c0cb2379/FLAG9c288127e [2024-11-28 05:18:45,955 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bc39e3c-6c1b-4d51-b26c-ae93b3a57c3e/bin/uautomizer-verify-aQ6SnzHsRB/data/9d0445cee/8a0651be659b44f3bdfed457c0cb2379 [2024-11-28 05:18:45,957 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 05:18:45,959 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 05:18:45,960 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 05:18:45,960 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 05:18:45,965 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 05:18:45,966 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:18:45" (1/1) ... [2024-11-28 05:18:45,967 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f9bb4a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:18:45, skipping insertion in model container [2024-11-28 05:18:45,967 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:18:45" (1/1) ... [2024-11-28 05:18:46,043 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 05:18:46,590 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_9bc39e3c-6c1b-4d51-b26c-ae93b3a57c3e/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-1.i[44118,44131] [2024-11-28 05:18:46,608 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_9bc39e3c-6c1b-4d51-b26c-ae93b3a57c3e/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-1.i[44660,44673] [2024-11-28 05:18:46,734 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_9bc39e3c-6c1b-4d51-b26c-ae93b3a57c3e/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-1.i[56247,56260] [2024-11-28 05:18:46,735 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_9bc39e3c-6c1b-4d51-b26c-ae93b3a57c3e/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-1.i[56368,56381] [2024-11-28 05:18:46,747 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 05:18:46,764 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 05:18:46,840 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_9bc39e3c-6c1b-4d51-b26c-ae93b3a57c3e/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-1.i[44118,44131] [2024-11-28 05:18:46,846 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_9bc39e3c-6c1b-4d51-b26c-ae93b3a57c3e/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-1.i[44660,44673] [2024-11-28 05:18:46,940 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_9bc39e3c-6c1b-4d51-b26c-ae93b3a57c3e/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-1.i[56247,56260] [2024-11-28 05:18:46,940 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_9bc39e3c-6c1b-4d51-b26c-ae93b3a57c3e/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-1.i[56368,56381] [2024-11-28 05:18:46,944 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 05:18:47,023 INFO L204 MainTranslator]: Completed translation [2024-11-28 05:18:47,024 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:18:47 WrapperNode [2024-11-28 05:18:47,024 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 05:18:47,026 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 05:18:47,026 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 05:18:47,026 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 05:18:47,034 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:18:47" (1/1) ... [2024-11-28 05:18:47,079 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:18:47" (1/1) ... [2024-11-28 05:18:47,148 INFO L138 Inliner]: procedures = 282, calls = 296, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1442 [2024-11-28 05:18:47,152 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 05:18:47,152 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 05:18:47,152 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 05:18:47,156 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 05:18:47,163 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:18:47" (1/1) ... [2024-11-28 05:18:47,164 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:18:47" (1/1) ... [2024-11-28 05:18:47,180 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:18:47" (1/1) ... [2024-11-28 05:18:47,280 INFO L175 MemorySlicer]: Split 268 memory accesses to 4 slices as follows [2, 220, 12, 34]. 82 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 0, 10, 0]. The 54 writes are split as follows [0, 49, 1, 4]. [2024-11-28 05:18:47,280 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:18:47" (1/1) ... [2024-11-28 05:18:47,281 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:18:47" (1/1) ... [2024-11-28 05:18:47,333 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:18:47" (1/1) ... [2024-11-28 05:18:47,339 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:18:47" (1/1) ... [2024-11-28 05:18:47,361 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:18:47" (1/1) ... [2024-11-28 05:18:47,365 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:18:47" (1/1) ... [2024-11-28 05:18:47,369 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:18:47" (1/1) ... [2024-11-28 05:18:47,379 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 05:18:47,380 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 05:18:47,380 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 05:18:47,380 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 05:18:47,381 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:18:47" (1/1) ... [2024-11-28 05:18:47,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:18:47,398 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bc39e3c-6c1b-4d51-b26c-ae93b3a57c3e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:18:47,412 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bc39e3c-6c1b-4d51-b26c-ae93b3a57c3e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 05:18:47,415 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bc39e3c-6c1b-4d51-b26c-ae93b3a57c3e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 05:18:47,438 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-28 05:18:47,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-28 05:18:47,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-28 05:18:47,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-28 05:18:47,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-28 05:18:47,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-28 05:18:47,439 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2024-11-28 05:18:47,439 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2024-11-28 05:18:47,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-28 05:18:47,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-28 05:18:47,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-28 05:18:47,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-28 05:18:47,439 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-28 05:18:47,440 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-28 05:18:47,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-28 05:18:47,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-28 05:18:47,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-28 05:18:47,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-28 05:18:47,440 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 05:18:47,440 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 05:18:47,440 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2024-11-28 05:18:47,441 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2024-11-28 05:18:47,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-28 05:18:47,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-28 05:18:47,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-28 05:18:47,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-28 05:18:47,441 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2024-11-28 05:18:47,441 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2024-11-28 05:18:47,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 05:18:47,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-28 05:18:47,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-28 05:18:47,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-28 05:18:47,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 05:18:47,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 05:18:47,693 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 05:18:47,696 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 05:18:49,556 INFO L? ?]: Removed 335 outVars from TransFormulas that were not future-live. [2024-11-28 05:18:49,556 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 05:18:49,577 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 05:18:49,578 INFO L312 CfgBuilder]: Removed 36 assume(true) statements. [2024-11-28 05:18:49,578 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:18:49 BoogieIcfgContainer [2024-11-28 05:18:49,582 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 05:18:49,584 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 05:18:49,584 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 05:18:49,590 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 05:18:49,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:18:45" (1/3) ... [2024-11-28 05:18:49,591 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c2efa2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:18:49, skipping insertion in model container [2024-11-28 05:18:49,592 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:18:47" (2/3) ... [2024-11-28 05:18:49,592 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c2efa2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:18:49, skipping insertion in model container [2024-11-28 05:18:49,592 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:18:49" (3/3) ... [2024-11-28 05:18:49,593 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test6-1.i [2024-11-28 05:18:49,611 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 05:18:49,613 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_OAT_test6-1.i that has 5 procedures, 440 locations, 1 initial locations, 36 loop locations, and 4 error locations. [2024-11-28 05:18:49,688 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 05:18:49,702 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;@61cb2373, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 05:18:49,703 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-28 05:18:49,721 INFO L276 IsEmpty]: Start isEmpty. Operand has 440 states, 418 states have (on average 1.5909090909090908) internal successors, (665), 422 states have internal predecessors, (665), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-28 05:18:49,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-28 05:18:49,727 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:18:49,728 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:18:49,728 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 05:18:49,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:18:49,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1938186709, now seen corresponding path program 1 times [2024-11-28 05:18:49,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:18:49,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408940924] [2024-11-28 05:18:49,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:18:49,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:18:49,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:18:49,944 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 05:18:49,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:18:49,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408940924] [2024-11-28 05:18:49,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408940924] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:18:49,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:18:49,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:18:49,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780548239] [2024-11-28 05:18:49,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:18:49,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-28 05:18:49,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:18:49,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-28 05:18:49,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 05:18:49,981 INFO L87 Difference]: Start difference. First operand has 440 states, 418 states have (on average 1.5909090909090908) internal successors, (665), 422 states have internal predecessors, (665), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) 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 05:18:50,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:18:50,060 INFO L93 Difference]: Finished difference Result 876 states and 1391 transitions. [2024-11-28 05:18:50,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-28 05:18:50,062 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 05:18:50,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:18:50,074 INFO L225 Difference]: With dead ends: 876 [2024-11-28 05:18:50,074 INFO L226 Difference]: Without dead ends: 434 [2024-11-28 05:18:50,081 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 05:18:50,085 INFO L435 NwaCegarLoop]: 619 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, 619 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 05:18:50,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 05:18:50,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2024-11-28 05:18:50,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2024-11-28 05:18:50,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 413 states have (on average 1.4285714285714286) internal successors, (590), 418 states have internal predecessors, (590), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-28 05:18:50,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 615 transitions. [2024-11-28 05:18:50,152 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 615 transitions. Word has length 8 [2024-11-28 05:18:50,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:18:50,153 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 615 transitions. [2024-11-28 05:18:50,153 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 05:18:50,153 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 615 transitions. [2024-11-28 05:18:50,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-28 05:18:50,154 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:18:50,154 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:18:50,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 05:18:50,154 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 05:18:50,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:18:50,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1937955008, now seen corresponding path program 1 times [2024-11-28 05:18:50,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:18:50,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110595870] [2024-11-28 05:18:50,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:18:50,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:18:50,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:18:50,429 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 05:18:50,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:18:50,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110595870] [2024-11-28 05:18:50,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110595870] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:18:50,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:18:50,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 05:18:50,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177061765] [2024-11-28 05:18:50,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:18:50,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 05:18:50,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:18:50,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 05:18:50,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 05:18:50,434 INFO L87 Difference]: Start difference. First operand 434 states and 615 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 05:18:50,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:18:50,705 INFO L93 Difference]: Finished difference Result 1055 states and 1506 transitions. [2024-11-28 05:18:50,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 05:18:50,705 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 05:18:50,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:18:50,711 INFO L225 Difference]: With dead ends: 1055 [2024-11-28 05:18:50,711 INFO L226 Difference]: Without dead ends: 841 [2024-11-28 05:18:50,713 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 05:18:50,714 INFO L435 NwaCegarLoop]: 640 mSDtfsCounter, 563 mSDsluCounter, 1223 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 574 SdHoareTripleChecker+Valid, 1863 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 05:18:50,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [574 Valid, 1863 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 05:18:50,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2024-11-28 05:18:50,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 436. [2024-11-28 05:18:50,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 415 states have (on average 1.4265060240963856) internal successors, (592), 420 states have internal predecessors, (592), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-28 05:18:50,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 617 transitions. [2024-11-28 05:18:50,751 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 617 transitions. Word has length 10 [2024-11-28 05:18:50,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:18:50,751 INFO L471 AbstractCegarLoop]: Abstraction has 436 states and 617 transitions. [2024-11-28 05:18:50,751 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 05:18:50,751 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 617 transitions. [2024-11-28 05:18:50,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-28 05:18:50,755 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:18:50,755 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 05:18:50,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 05:18:50,756 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 05:18:50,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:18:50,757 INFO L85 PathProgramCache]: Analyzing trace with hash -128835798, now seen corresponding path program 1 times [2024-11-28 05:18:50,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:18:50,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588360496] [2024-11-28 05:18:50,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:18:50,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:18:50,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:18:51,328 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 05:18:51,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:18:51,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588360496] [2024-11-28 05:18:51,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588360496] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:18:51,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:18:51,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 05:18:51,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252063488] [2024-11-28 05:18:51,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:18:51,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 05:18:51,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:18:51,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 05:18:51,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 05:18:51,330 INFO L87 Difference]: Start difference. First operand 436 states and 617 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 05:18:51,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:18:51,469 INFO L93 Difference]: Finished difference Result 825 states and 1163 transitions. [2024-11-28 05:18:51,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 05:18:51,469 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 05:18:51,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:18:51,472 INFO L225 Difference]: With dead ends: 825 [2024-11-28 05:18:51,472 INFO L226 Difference]: Without dead ends: 393 [2024-11-28 05:18:51,477 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 05:18:51,478 INFO L435 NwaCegarLoop]: 512 mSDtfsCounter, 30 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1517 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 05:18:51,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1517 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 05:18:51,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-11-28 05:18:51,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2024-11-28 05:18:51,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 372 states have (on average 1.381720430107527) internal successors, (514), 377 states have internal predecessors, (514), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-28 05:18:51,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 539 transitions. [2024-11-28 05:18:51,507 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 539 transitions. Word has length 67 [2024-11-28 05:18:51,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:18:51,507 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 539 transitions. [2024-11-28 05:18:51,507 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 05:18:51,508 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 539 transitions. [2024-11-28 05:18:51,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-28 05:18:51,512 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:18:51,512 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 05:18:51,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 05:18:51,513 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 05:18:51,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:18:51,514 INFO L85 PathProgramCache]: Analyzing trace with hash 56749342, now seen corresponding path program 1 times [2024-11-28 05:18:51,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:18:51,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015184832] [2024-11-28 05:18:51,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:18:51,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:18:51,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:18:52,150 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 05:18:52,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:18:52,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015184832] [2024-11-28 05:18:52,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015184832] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:18:52,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:18:52,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 05:18:52,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331439316] [2024-11-28 05:18:52,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:18:52,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 05:18:52,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:18:52,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 05:18:52,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 05:18:52,155 INFO L87 Difference]: Start difference. First operand 393 states and 539 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 05:18:52,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:18:52,721 INFO L93 Difference]: Finished difference Result 787 states and 1082 transitions. [2024-11-28 05:18:52,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 05:18:52,722 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 05:18:52,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:18:52,724 INFO L225 Difference]: With dead ends: 787 [2024-11-28 05:18:52,724 INFO L226 Difference]: Without dead ends: 398 [2024-11-28 05:18:52,727 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 05:18:52,730 INFO L435 NwaCegarLoop]: 516 mSDtfsCounter, 14 mSDsluCounter, 1767 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2283 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.5s IncrementalHoareTripleChecker+Time [2024-11-28 05:18:52,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2283 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-28 05:18:52,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2024-11-28 05:18:52,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 395. [2024-11-28 05:18:52,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 374 states have (on average 1.3796791443850267) internal successors, (516), 379 states have internal predecessors, (516), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-28 05:18:52,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 541 transitions. [2024-11-28 05:18:52,755 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 541 transitions. Word has length 67 [2024-11-28 05:18:52,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:18:52,755 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 541 transitions. [2024-11-28 05:18:52,756 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 05:18:52,756 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 541 transitions. [2024-11-28 05:18:52,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-28 05:18:52,760 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:18:52,760 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 05:18:52,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 05:18:52,761 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 05:18:52,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:18:52,761 INFO L85 PathProgramCache]: Analyzing trace with hash 626195501, now seen corresponding path program 1 times [2024-11-28 05:18:52,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:18:52,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283622891] [2024-11-28 05:18:52,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:18:52,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:18:52,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:18:53,234 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 05:18:53,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:18:53,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283622891] [2024-11-28 05:18:53,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283622891] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:18:53,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:18:53,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-28 05:18:53,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706104907] [2024-11-28 05:18:53,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:18:53,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 05:18:53,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:18:53,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 05:18:53,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-28 05:18:53,236 INFO L87 Difference]: Start difference. First operand 395 states and 541 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 05:18:53,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:18:53,663 INFO L93 Difference]: Finished difference Result 791 states and 1086 transitions. [2024-11-28 05:18:53,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 05:18:53,664 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 05:18:53,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:18:53,666 INFO L225 Difference]: With dead ends: 791 [2024-11-28 05:18:53,667 INFO L226 Difference]: Without dead ends: 400 [2024-11-28 05:18:53,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-28 05:18:53,670 INFO L435 NwaCegarLoop]: 510 mSDtfsCounter, 15 mSDsluCounter, 2230 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 2740 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.4s IncrementalHoareTripleChecker+Time [2024-11-28 05:18:53,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 2740 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-28 05:18:53,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2024-11-28 05:18:53,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 399. [2024-11-28 05:18:53,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 378 states have (on average 1.3783068783068784) internal successors, (521), 383 states have internal predecessors, (521), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-28 05:18:53,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 546 transitions. [2024-11-28 05:18:53,690 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 546 transitions. Word has length 68 [2024-11-28 05:18:53,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:18:53,690 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 546 transitions. [2024-11-28 05:18:53,690 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 05:18:53,690 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 546 transitions. [2024-11-28 05:18:53,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-28 05:18:53,694 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:18:53,694 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 05:18:53,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 05:18:53,695 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 05:18:53,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:18:53,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1834166079, now seen corresponding path program 1 times [2024-11-28 05:18:53,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:18:53,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717876938] [2024-11-28 05:18:53,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:18:53,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:18:53,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:18:54,126 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 05:18:54,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:18:54,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717876938] [2024-11-28 05:18:54,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717876938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:18:54,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:18:54,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 05:18:54,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529937377] [2024-11-28 05:18:54,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:18:54,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 05:18:54,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:18:54,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 05:18:54,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 05:18:54,128 INFO L87 Difference]: Start difference. First operand 399 states and 546 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 05:18:54,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:18:54,298 INFO L93 Difference]: Finished difference Result 794 states and 1088 transitions. [2024-11-28 05:18:54,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 05:18:54,299 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 05:18:54,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:18:54,302 INFO L225 Difference]: With dead ends: 794 [2024-11-28 05:18:54,302 INFO L226 Difference]: Without dead ends: 399 [2024-11-28 05:18:54,303 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 05:18:54,303 INFO L435 NwaCegarLoop]: 521 mSDtfsCounter, 17 mSDsluCounter, 913 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1434 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.1s IncrementalHoareTripleChecker+Time [2024-11-28 05:18:54,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1434 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 05:18:54,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2024-11-28 05:18:54,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 399. [2024-11-28 05:18:54,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 378 states have (on average 1.3756613756613756) internal successors, (520), 383 states have internal predecessors, (520), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-28 05:18:54,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 545 transitions. [2024-11-28 05:18:54,322 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 545 transitions. Word has length 68 [2024-11-28 05:18:54,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:18:54,322 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 545 transitions. [2024-11-28 05:18:54,322 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 05:18:54,323 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 545 transitions. [2024-11-28 05:18:54,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-28 05:18:54,323 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:18:54,324 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 05:18:54,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 05:18:54,324 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 05:18:54,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:18:54,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1342972566, now seen corresponding path program 1 times [2024-11-28 05:18:54,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:18:54,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068404716] [2024-11-28 05:18:54,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:18:54,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:18:54,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:18:54,913 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 05:18:54,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:18:54,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068404716] [2024-11-28 05:18:54,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068404716] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:18:54,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:18:54,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-28 05:18:54,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12483378] [2024-11-28 05:18:54,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:18:54,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 05:18:54,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:18:54,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 05:18:54,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-28 05:18:54,916 INFO L87 Difference]: Start difference. First operand 399 states and 545 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 05:18:55,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:18:55,584 INFO L93 Difference]: Finished difference Result 807 states and 1107 transitions. [2024-11-28 05:18:55,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 05:18:55,584 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 05:18:55,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:18:55,587 INFO L225 Difference]: With dead ends: 807 [2024-11-28 05:18:55,587 INFO L226 Difference]: Without dead ends: 412 [2024-11-28 05:18:55,588 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 05:18:55,589 INFO L435 NwaCegarLoop]: 511 mSDtfsCounter, 34 mSDsluCounter, 3190 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 3701 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.6s IncrementalHoareTripleChecker+Time [2024-11-28 05:18:55,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 3701 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-28 05:18:55,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2024-11-28 05:18:55,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 409. [2024-11-28 05:18:55,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 388 states have (on average 1.3762886597938144) internal successors, (534), 393 states have internal predecessors, (534), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-28 05:18:55,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 559 transitions. [2024-11-28 05:18:55,605 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 559 transitions. Word has length 69 [2024-11-28 05:18:55,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:18:55,605 INFO L471 AbstractCegarLoop]: Abstraction has 409 states and 559 transitions. [2024-11-28 05:18:55,605 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 05:18:55,606 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 559 transitions. [2024-11-28 05:18:55,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-28 05:18:55,607 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:18:55,607 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 05:18:55,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 05:18:55,607 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 05:18:55,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:18:55,607 INFO L85 PathProgramCache]: Analyzing trace with hash 269698435, now seen corresponding path program 1 times [2024-11-28 05:18:55,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:18:55,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378737089] [2024-11-28 05:18:55,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:18:55,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:18:55,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:18:56,204 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 05:18:56,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:18:56,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378737089] [2024-11-28 05:18:56,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378737089] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:18:56,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:18:56,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 05:18:56,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315402051] [2024-11-28 05:18:56,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:18:56,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 05:18:56,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:18:56,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 05:18:56,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-28 05:18:56,207 INFO L87 Difference]: Start difference. First operand 409 states and 559 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 05:18:56,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:18:56,778 INFO L93 Difference]: Finished difference Result 817 states and 1119 transitions. [2024-11-28 05:18:56,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 05:18:56,780 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 05:18:56,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:18:56,784 INFO L225 Difference]: With dead ends: 817 [2024-11-28 05:18:56,784 INFO L226 Difference]: Without dead ends: 412 [2024-11-28 05:18:56,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-28 05:18:56,785 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 27 mSDsluCounter, 2726 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 3241 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.5s IncrementalHoareTripleChecker+Time [2024-11-28 05:18:56,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 3241 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-28 05:18:56,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2024-11-28 05:18:56,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 412. [2024-11-28 05:18:56,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 391 states have (on average 1.3734015345268542) internal successors, (537), 396 states have internal predecessors, (537), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-28 05:18:56,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 562 transitions. [2024-11-28 05:18:56,809 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 562 transitions. Word has length 69 [2024-11-28 05:18:56,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:18:56,809 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 562 transitions. [2024-11-28 05:18:56,809 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 05:18:56,809 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 562 transitions. [2024-11-28 05:18:56,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-28 05:18:56,810 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:18:56,810 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 05:18:56,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 05:18:56,811 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 05:18:56,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:18:56,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1430997699, now seen corresponding path program 1 times [2024-11-28 05:18:56,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:18:56,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473459300] [2024-11-28 05:18:56,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:18:56,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:18:56,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:18:57,103 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 05:18:57,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:18:57,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473459300] [2024-11-28 05:18:57,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473459300] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:18:57,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:18:57,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 05:18:57,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152003178] [2024-11-28 05:18:57,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:18:57,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 05:18:57,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:18:57,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 05:18:57,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-28 05:18:57,105 INFO L87 Difference]: Start difference. First operand 412 states and 562 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 05:18:57,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:18:57,466 INFO L93 Difference]: Finished difference Result 823 states and 1125 transitions. [2024-11-28 05:18:57,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 05:18:57,468 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 05:18:57,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:18:57,470 INFO L225 Difference]: With dead ends: 823 [2024-11-28 05:18:57,471 INFO L226 Difference]: Without dead ends: 415 [2024-11-28 05:18:57,473 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 05:18:57,475 INFO L435 NwaCegarLoop]: 521 mSDtfsCounter, 8 mSDsluCounter, 1784 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2305 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 05:18:57,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2305 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 05:18:57,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2024-11-28 05:18:57,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 415. [2024-11-28 05:18:57,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 394 states have (on average 1.3705583756345177) internal successors, (540), 399 states have internal predecessors, (540), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-28 05:18:57,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 565 transitions. [2024-11-28 05:18:57,492 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 565 transitions. Word has length 69 [2024-11-28 05:18:57,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:18:57,493 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 565 transitions. [2024-11-28 05:18:57,493 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 05:18:57,493 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 565 transitions. [2024-11-28 05:18:57,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-28 05:18:57,496 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:18:57,496 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 05:18:57,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-28 05:18:57,497 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 05:18:57,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:18:57,497 INFO L85 PathProgramCache]: Analyzing trace with hash -112470928, now seen corresponding path program 1 times [2024-11-28 05:18:57,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:18:57,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269124261] [2024-11-28 05:18:57,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:18:57,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:18:57,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:18:58,272 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 05:18:58,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:18:58,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269124261] [2024-11-28 05:18:58,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269124261] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:18:58,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:18:58,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-28 05:18:58,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858606317] [2024-11-28 05:18:58,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:18:58,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 05:18:58,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:18:58,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 05:18:58,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-28 05:18:58,274 INFO L87 Difference]: Start difference. First operand 415 states and 565 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 05:18:59,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:18:59,291 INFO L93 Difference]: Finished difference Result 1209 states and 1655 transitions. [2024-11-28 05:18:59,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 05:18:59,292 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 05:18:59,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:18:59,296 INFO L225 Difference]: With dead ends: 1209 [2024-11-28 05:18:59,296 INFO L226 Difference]: Without dead ends: 798 [2024-11-28 05:18:59,297 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 05:18:59,298 INFO L435 NwaCegarLoop]: 552 mSDtfsCounter, 645 mSDsluCounter, 2377 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 654 SdHoareTripleChecker+Valid, 2929 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-28 05:18:59,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [654 Valid, 2929 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-28 05:18:59,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2024-11-28 05:18:59,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 454. [2024-11-28 05:18:59,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 433 states have (on average 1.346420323325635) internal successors, (583), 438 states have internal predecessors, (583), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-28 05:18:59,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 608 transitions. [2024-11-28 05:18:59,320 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 608 transitions. Word has length 70 [2024-11-28 05:18:59,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:18:59,320 INFO L471 AbstractCegarLoop]: Abstraction has 454 states and 608 transitions. [2024-11-28 05:18:59,321 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 05:18:59,321 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 608 transitions. [2024-11-28 05:18:59,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-28 05:18:59,322 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:18:59,322 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 05:18:59,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 05:18:59,322 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 05:18:59,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:18:59,323 INFO L85 PathProgramCache]: Analyzing trace with hash 624259524, now seen corresponding path program 1 times [2024-11-28 05:18:59,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:18:59,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123464109] [2024-11-28 05:18:59,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:18:59,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:18:59,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:18:59,627 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 05:18:59,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:18:59,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123464109] [2024-11-28 05:18:59,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123464109] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:18:59,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:18:59,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-28 05:18:59,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159409979] [2024-11-28 05:18:59,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:18:59,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 05:18:59,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:18:59,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 05:18:59,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-28 05:18:59,629 INFO L87 Difference]: Start difference. First operand 454 states and 608 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 05:19:00,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:19:00,113 INFO L93 Difference]: Finished difference Result 870 states and 1177 transitions. [2024-11-28 05:19:00,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 05:19:00,114 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 05:19:00,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:19:00,116 INFO L225 Difference]: With dead ends: 870 [2024-11-28 05:19:00,116 INFO L226 Difference]: Without dead ends: 459 [2024-11-28 05:19:00,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-28 05:19:00,119 INFO L435 NwaCegarLoop]: 516 mSDtfsCounter, 13 mSDsluCounter, 2230 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 2746 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.4s IncrementalHoareTripleChecker+Time [2024-11-28 05:19:00,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 2746 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-28 05:19:00,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2024-11-28 05:19:00,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 454. [2024-11-28 05:19:00,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 433 states have (on average 1.346420323325635) internal successors, (583), 438 states have internal predecessors, (583), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-28 05:19:00,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 608 transitions. [2024-11-28 05:19:00,141 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 608 transitions. Word has length 70 [2024-11-28 05:19:00,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:19:00,142 INFO L471 AbstractCegarLoop]: Abstraction has 454 states and 608 transitions. [2024-11-28 05:19:00,142 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 05:19:00,142 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 608 transitions. [2024-11-28 05:19:00,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-28 05:19:00,143 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:19:00,143 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 05:19:00,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-28 05:19:00,143 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 05:19:00,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:19:00,144 INFO L85 PathProgramCache]: Analyzing trace with hash 754738639, now seen corresponding path program 1 times [2024-11-28 05:19:00,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:19:00,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668508524] [2024-11-28 05:19:00,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:19:00,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:19:00,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:19:00,504 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 05:19:00,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:19:00,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668508524] [2024-11-28 05:19:00,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668508524] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:19:00,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:19:00,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-28 05:19:00,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433234357] [2024-11-28 05:19:00,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:19:00,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 05:19:00,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:19:00,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 05:19:00,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-28 05:19:00,507 INFO L87 Difference]: Start difference. First operand 454 states and 608 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 05:19:00,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:19:00,863 INFO L93 Difference]: Finished difference Result 875 states and 1183 transitions. [2024-11-28 05:19:00,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 05:19:00,864 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 05:19:00,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:19:00,866 INFO L225 Difference]: With dead ends: 875 [2024-11-28 05:19:00,866 INFO L226 Difference]: Without dead ends: 464 [2024-11-28 05:19:00,867 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 05:19:00,868 INFO L435 NwaCegarLoop]: 510 mSDtfsCounter, 20 mSDsluCounter, 2333 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 2843 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 05:19:00,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 2843 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 05:19:00,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2024-11-28 05:19:00,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 457. [2024-11-28 05:19:00,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 436 states have (on average 1.3463302752293578) internal successors, (587), 441 states have internal predecessors, (587), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-28 05:19:00,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 612 transitions. [2024-11-28 05:19:00,887 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 612 transitions. Word has length 71 [2024-11-28 05:19:00,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:19:00,887 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 612 transitions. [2024-11-28 05:19:00,887 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 05:19:00,887 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 612 transitions. [2024-11-28 05:19:00,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-28 05:19:00,888 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:19:00,888 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 05:19:00,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-28 05:19:00,888 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 05:19:00,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:19:00,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1402987853, now seen corresponding path program 1 times [2024-11-28 05:19:00,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:19:00,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638736097] [2024-11-28 05:19:00,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:19:00,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:19:00,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:19:01,263 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 05:19:01,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:19:01,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638736097] [2024-11-28 05:19:01,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638736097] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:19:01,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:19:01,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-28 05:19:01,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973016283] [2024-11-28 05:19:01,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:19:01,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 05:19:01,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:19:01,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 05:19:01,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-28 05:19:01,265 INFO L87 Difference]: Start difference. First operand 457 states and 612 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 05:19:02,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:19:02,009 INFO L93 Difference]: Finished difference Result 893 states and 1203 transitions. [2024-11-28 05:19:02,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 05:19:02,010 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 05:19:02,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:19:02,013 INFO L225 Difference]: With dead ends: 893 [2024-11-28 05:19:02,013 INFO L226 Difference]: Without dead ends: 479 [2024-11-28 05:19:02,015 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 05:19:02,015 INFO L435 NwaCegarLoop]: 522 mSDtfsCounter, 38 mSDsluCounter, 3156 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 3678 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.6s IncrementalHoareTripleChecker+Time [2024-11-28 05:19:02,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 3678 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-28 05:19:02,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2024-11-28 05:19:02,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 457. [2024-11-28 05:19:02,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 436 states have (on average 1.3463302752293578) internal successors, (587), 441 states have internal predecessors, (587), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-28 05:19:02,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 612 transitions. [2024-11-28 05:19:02,044 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 612 transitions. Word has length 71 [2024-11-28 05:19:02,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:19:02,044 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 612 transitions. [2024-11-28 05:19:02,045 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 05:19:02,045 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 612 transitions. [2024-11-28 05:19:02,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-28 05:19:02,046 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:19:02,046 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 05:19:02,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-28 05:19:02,046 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 05:19:02,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:19:02,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1758437004, now seen corresponding path program 1 times [2024-11-28 05:19:02,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:19:02,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362647163] [2024-11-28 05:19:02,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:19:02,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:19:02,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:19:02,470 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 05:19:02,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:19:02,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362647163] [2024-11-28 05:19:02,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362647163] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:19:02,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:19:02,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-28 05:19:02,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868319400] [2024-11-28 05:19:02,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:19:02,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 05:19:02,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:19:02,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 05:19:02,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-28 05:19:02,473 INFO L87 Difference]: Start difference. First operand 457 states and 612 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 05:19:03,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:19:03,124 INFO L93 Difference]: Finished difference Result 887 states and 1200 transitions. [2024-11-28 05:19:03,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 05:19:03,124 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 05:19:03,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:19:03,127 INFO L225 Difference]: With dead ends: 887 [2024-11-28 05:19:03,127 INFO L226 Difference]: Without dead ends: 473 [2024-11-28 05:19:03,128 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 05:19:03,129 INFO L435 NwaCegarLoop]: 517 mSDtfsCounter, 26 mSDsluCounter, 3175 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 3692 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-28 05:19:03,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 3692 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-28 05:19:03,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2024-11-28 05:19:03,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 467. [2024-11-28 05:19:03,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 446 states have (on average 1.34304932735426) internal successors, (599), 451 states have internal predecessors, (599), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-28 05:19:03,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 624 transitions. [2024-11-28 05:19:03,151 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 624 transitions. Word has length 72 [2024-11-28 05:19:03,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:19:03,151 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 624 transitions. [2024-11-28 05:19:03,151 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 05:19:03,151 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 624 transitions. [2024-11-28 05:19:03,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-28 05:19:03,152 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:19:03,152 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 05:19:03,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-28 05:19:03,153 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 05:19:03,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:19:03,153 INFO L85 PathProgramCache]: Analyzing trace with hash 71518480, now seen corresponding path program 1 times [2024-11-28 05:19:03,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:19:03,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904893791] [2024-11-28 05:19:03,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:19:03,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:19:03,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:19:03,540 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 05:19:03,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:19:03,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904893791] [2024-11-28 05:19:03,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904893791] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:19:03,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:19:03,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-28 05:19:03,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339364058] [2024-11-28 05:19:03,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:19:03,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 05:19:03,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:19:03,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 05:19:03,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-28 05:19:03,542 INFO L87 Difference]: Start difference. First operand 467 states and 624 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 05:19:04,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:19:04,224 INFO L93 Difference]: Finished difference Result 907 states and 1224 transitions. [2024-11-28 05:19:04,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 05:19:04,226 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 05:19:04,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:19:04,228 INFO L225 Difference]: With dead ends: 907 [2024-11-28 05:19:04,228 INFO L226 Difference]: Without dead ends: 483 [2024-11-28 05:19:04,230 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 05:19:04,231 INFO L435 NwaCegarLoop]: 503 mSDtfsCounter, 17 mSDsluCounter, 3620 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4123 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.6s IncrementalHoareTripleChecker+Time [2024-11-28 05:19:04,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4123 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-28 05:19:04,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2024-11-28 05:19:04,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 470. [2024-11-28 05:19:04,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 449 states have (on average 1.3429844097995545) internal successors, (603), 454 states have internal predecessors, (603), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-28 05:19:04,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 628 transitions. [2024-11-28 05:19:04,255 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 628 transitions. Word has length 72 [2024-11-28 05:19:04,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:19:04,256 INFO L471 AbstractCegarLoop]: Abstraction has 470 states and 628 transitions. [2024-11-28 05:19:04,256 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 05:19:04,256 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 628 transitions. [2024-11-28 05:19:04,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-28 05:19:04,257 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:19:04,257 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 05:19:04,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-28 05:19:04,257 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 05:19:04,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:19:04,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1426534256, now seen corresponding path program 1 times [2024-11-28 05:19:04,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:19:04,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966895134] [2024-11-28 05:19:04,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:19:04,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:19:04,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:19:04,620 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 05:19:04,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:19:04,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966895134] [2024-11-28 05:19:04,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966895134] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:19:04,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:19:04,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-28 05:19:04,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149969957] [2024-11-28 05:19:04,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:19:04,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 05:19:04,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:19:04,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 05:19:04,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-28 05:19:04,624 INFO L87 Difference]: Start difference. First operand 470 states and 628 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 05:19:05,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:19:05,066 INFO L93 Difference]: Finished difference Result 902 states and 1214 transitions. [2024-11-28 05:19:05,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 05:19:05,067 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 05:19:05,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:19:05,070 INFO L225 Difference]: With dead ends: 902 [2024-11-28 05:19:05,070 INFO L226 Difference]: Without dead ends: 475 [2024-11-28 05:19:05,071 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 05:19:05,072 INFO L435 NwaCegarLoop]: 511 mSDtfsCounter, 11 mSDsluCounter, 2259 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 2770 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 05:19:05,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 2770 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-28 05:19:05,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2024-11-28 05:19:05,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 470. [2024-11-28 05:19:05,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 449 states have (on average 1.3407572383073496) internal successors, (602), 454 states have internal predecessors, (602), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-28 05:19:05,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 627 transitions. [2024-11-28 05:19:05,092 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 627 transitions. Word has length 72 [2024-11-28 05:19:05,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:19:05,092 INFO L471 AbstractCegarLoop]: Abstraction has 470 states and 627 transitions. [2024-11-28 05:19:05,093 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 05:19:05,093 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 627 transitions. [2024-11-28 05:19:05,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-28 05:19:05,093 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:19:05,093 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 05:19:05,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-28 05:19:05,094 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 05:19:05,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:19:05,094 INFO L85 PathProgramCache]: Analyzing trace with hash 186136745, now seen corresponding path program 1 times [2024-11-28 05:19:05,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:19:05,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144497270] [2024-11-28 05:19:05,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:19:05,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:19:05,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:19:05,412 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 05:19:05,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:19:05,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144497270] [2024-11-28 05:19:05,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144497270] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:19:05,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:19:05,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-28 05:19:05,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794281022] [2024-11-28 05:19:05,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:19:05,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 05:19:05,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:19:05,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 05:19:05,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-28 05:19:05,414 INFO L87 Difference]: Start difference. First operand 470 states and 627 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 05:19:06,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:19:06,089 INFO L93 Difference]: Finished difference Result 900 states and 1212 transitions. [2024-11-28 05:19:06,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 05:19:06,090 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 05:19:06,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:19:06,093 INFO L225 Difference]: With dead ends: 900 [2024-11-28 05:19:06,093 INFO L226 Difference]: Without dead ends: 473 [2024-11-28 05:19:06,094 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 05:19:06,094 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 8 mSDsluCounter, 2214 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2729 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.6s IncrementalHoareTripleChecker+Time [2024-11-28 05:19:06,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2729 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-28 05:19:06,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2024-11-28 05:19:06,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 473. [2024-11-28 05:19:06,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 452 states have (on average 1.3384955752212389) internal successors, (605), 457 states have internal predecessors, (605), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-28 05:19:06,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 630 transitions. [2024-11-28 05:19:06,116 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 630 transitions. Word has length 72 [2024-11-28 05:19:06,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:19:06,116 INFO L471 AbstractCegarLoop]: Abstraction has 473 states and 630 transitions. [2024-11-28 05:19:06,116 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 05:19:06,117 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 630 transitions. [2024-11-28 05:19:06,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-28 05:19:06,117 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:19:06,118 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 05:19:06,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-28 05:19:06,118 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 05:19:06,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:19:06,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1157474350, now seen corresponding path program 1 times [2024-11-28 05:19:06,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:19:06,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532053311] [2024-11-28 05:19:06,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:19:06,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:19:06,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:19:06,626 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 05:19:06,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:19:06,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532053311] [2024-11-28 05:19:06,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532053311] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:19:06,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:19:06,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-28 05:19:06,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601033817] [2024-11-28 05:19:06,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:19:06,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 05:19:06,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:19:06,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 05:19:06,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-28 05:19:06,629 INFO L87 Difference]: Start difference. First operand 473 states and 630 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 05:19:07,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:19:07,332 INFO L93 Difference]: Finished difference Result 915 states and 1231 transitions. [2024-11-28 05:19:07,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 05:19:07,333 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 05:19:07,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:19:07,336 INFO L225 Difference]: With dead ends: 915 [2024-11-28 05:19:07,336 INFO L226 Difference]: Without dead ends: 485 [2024-11-28 05:19:07,337 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 05:19:07,338 INFO L435 NwaCegarLoop]: 514 mSDtfsCounter, 13 mSDsluCounter, 3168 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 3682 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-28 05:19:07,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 3682 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-28 05:19:07,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2024-11-28 05:19:07,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 477. [2024-11-28 05:19:07,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 456 states have (on average 1.337719298245614) internal successors, (610), 461 states have internal predecessors, (610), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-28 05:19:07,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 635 transitions. [2024-11-28 05:19:07,359 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 635 transitions. Word has length 73 [2024-11-28 05:19:07,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:19:07,359 INFO L471 AbstractCegarLoop]: Abstraction has 477 states and 635 transitions. [2024-11-28 05:19:07,359 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 05:19:07,360 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 635 transitions. [2024-11-28 05:19:07,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-28 05:19:07,361 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:19:07,361 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 05:19:07,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-28 05:19:07,361 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 05:19:07,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:19:07,362 INFO L85 PathProgramCache]: Analyzing trace with hash 771099327, now seen corresponding path program 1 times [2024-11-28 05:19:07,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:19:07,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605695451] [2024-11-28 05:19:07,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:19:07,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:19:07,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:19:07,755 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 05:19:07,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:19:07,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605695451] [2024-11-28 05:19:07,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605695451] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:19:07,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:19:07,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-28 05:19:07,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698828565] [2024-11-28 05:19:07,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:19:07,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-28 05:19:07,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:19:07,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-28 05:19:07,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-28 05:19:07,757 INFO L87 Difference]: Start difference. First operand 477 states and 635 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 05:19:08,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:19:08,405 INFO L93 Difference]: Finished difference Result 924 states and 1241 transitions. [2024-11-28 05:19:08,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 05:19:08,406 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 05:19:08,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:19:08,408 INFO L225 Difference]: With dead ends: 924 [2024-11-28 05:19:08,408 INFO L226 Difference]: Without dead ends: 490 [2024-11-28 05:19:08,409 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 05:19:08,410 INFO L435 NwaCegarLoop]: 511 mSDtfsCounter, 40 mSDsluCounter, 3642 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 4153 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-28 05:19:08,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 4153 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-28 05:19:08,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2024-11-28 05:19:08,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 480. [2024-11-28 05:19:08,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 459 states have (on average 1.3355119825708062) internal successors, (613), 464 states have internal predecessors, (613), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-28 05:19:08,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 638 transitions. [2024-11-28 05:19:08,428 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 638 transitions. Word has length 73 [2024-11-28 05:19:08,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:19:08,429 INFO L471 AbstractCegarLoop]: Abstraction has 480 states and 638 transitions. [2024-11-28 05:19:08,429 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 05:19:08,429 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 638 transitions. [2024-11-28 05:19:08,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-28 05:19:08,430 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:19:08,430 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 05:19:08,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-28 05:19:08,430 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 05:19:08,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:19:08,431 INFO L85 PathProgramCache]: Analyzing trace with hash -263429194, now seen corresponding path program 1 times [2024-11-28 05:19:08,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:19:08,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950729611] [2024-11-28 05:19:08,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:19:08,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:19:08,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:19:09,104 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 05:19:09,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:19:09,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950729611] [2024-11-28 05:19:09,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950729611] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:19:09,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:19:09,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-28 05:19:09,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774950889] [2024-11-28 05:19:09,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:19:09,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 05:19:09,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:19:09,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 05:19:09,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-28 05:19:09,106 INFO L87 Difference]: Start difference. First operand 480 states and 638 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 05:19:13,537 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 05:19:14,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:19:14,265 INFO L93 Difference]: Finished difference Result 933 states and 1247 transitions. [2024-11-28 05:19:14,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 05:19:14,266 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 05:19:14,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:19:14,269 INFO L225 Difference]: With dead ends: 933 [2024-11-28 05:19:14,269 INFO L226 Difference]: Without dead ends: 496 [2024-11-28 05:19:14,270 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-11-28 05:19:14,270 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 43 mSDsluCounter, 3582 mSDsCounter, 0 mSdLazyCounter, 700 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 4097 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 700 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-11-28 05:19:14,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 4097 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 700 Invalid, 1 Unknown, 0 Unchecked, 4.9s Time] [2024-11-28 05:19:14,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2024-11-28 05:19:14,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 481. [2024-11-28 05:19:14,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 460 states have (on average 1.3347826086956522) internal successors, (614), 465 states have internal predecessors, (614), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-28 05:19:14,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 639 transitions. [2024-11-28 05:19:14,293 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 639 transitions. Word has length 73 [2024-11-28 05:19:14,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:19:14,293 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 639 transitions. [2024-11-28 05:19:14,293 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 05:19:14,293 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 639 transitions. [2024-11-28 05:19:14,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-28 05:19:14,294 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:19:14,294 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 05:19:14,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-28 05:19:14,295 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 05:19:14,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:19:14,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1592083978, now seen corresponding path program 1 times [2024-11-28 05:19:14,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:19:14,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635266666] [2024-11-28 05:19:14,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:19:14,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:19:14,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:19:35,410 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* (div |c_ULTIMATE.start_main_~_hj_j~0#1| 4294967296) 524288)) (.cse0 (div |c_ULTIMATE.start_main_~_hj_j~0#1| 8192))) (and (= .cse0 (+ .cse1 |c_ULTIMATE.start_main_~_ha_hashv~0#1|)) (<= 4408680405129836981 (+ (* 1030789530 |c_ULTIMATE.start_main_~_ha_hashv~0#1|) (* |c_ULTIMATE.start_main_~_hj_j~0#1| 2061579059) (* (div (+ (* (- 4123158118) |c_ULTIMATE.start_main_~_hj_j~0#1|) 8817360810260198248 .cse1 (* (- 2061579059) |c_ULTIMATE.start_main_~_ha_hashv~0#1|) (* (- 1) .cse0)) 4294967296) 2147483648))))) is different from false [2024-11-28 05:19:36,253 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 05:19:36,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:19:36,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635266666] [2024-11-28 05:19:36,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635266666] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:19:36,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:19:36,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-28 05:19:36,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999580469] [2024-11-28 05:19:36,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:19:36,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-28 05:19:36,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:19:36,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-28 05:19:36,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=72, Unknown=1, NotChecked=16, Total=110 [2024-11-28 05:19:36,254 INFO L87 Difference]: Start difference. First operand 481 states and 639 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 05:19:38,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:19:40,153 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 05:19:44,414 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (div |c_ULTIMATE.start_main_~_hj_j~0#1| 8192)) (.cse3 (* (div |c_ULTIMATE.start_main_~_hj_j~0#1| 4294967296) 524288))) (let ((.cse0 (+ .cse3 |c_ULTIMATE.start_main_~_ha_hashv~0#1|)) (.cse6 (* 1030789530 |c_ULTIMATE.start_main_~_ha_hashv~0#1|)) (.cse7 (* |c_ULTIMATE.start_main_~_hj_j~0#1| 2061579059)) (.cse2 (* (- 4123158118) |c_ULTIMATE.start_main_~_hj_j~0#1|)) (.cse4 (* (- 2061579059) |c_ULTIMATE.start_main_~_ha_hashv~0#1|)) (.cse5 (* (- 1) .cse1))) (and (or (< .cse0 (+ .cse1 (mod |c_ULTIMATE.start_main_~_hj_i~0#1| 4294967296))) (< 4408680405129836980 (+ (* 1030789529 |c_ULTIMATE.start_main_~_hj_i~0#1|) (* 2147483648 (div (+ .cse2 8817360810260198248 (* (- 2061579059) |c_ULTIMATE.start_main_~_hj_i~0#1|) .cse3 .cse4 .cse5) 4294967296)) .cse6 .cse7 (* (div |c_ULTIMATE.start_main_~_hj_i~0#1| 4294967296) 2147483648)))) (= .cse1 .cse0) (<= 4408680405129836981 (+ .cse6 .cse7 (* (div (+ .cse2 8817360810260198248 .cse3 .cse4 .cse5) 4294967296) 2147483648)))))) is different from false [2024-11-28 05:19:46,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:19:50,694 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 05:19:54,712 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 05:19:58,721 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 05:20:03,153 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 05:20:06,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.55s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:20:10,707 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 05:20:14,710 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 05:20:18,714 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 05:20:22,774 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 05:20:45,347 WARN L286 SmtUtils]: Spent 15.26s 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 05:20:49,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 05:20:53,410 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 05:20:57,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.94s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:21:01,444 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 05:21:04,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:21:05,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:21:05,259 INFO L93 Difference]: Finished difference Result 946 states and 1273 transitions. [2024-11-28 05:21:05,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 05:21:05,260 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 05:21:05,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:21:05,263 INFO L225 Difference]: With dead ends: 946 [2024-11-28 05:21:05,263 INFO L226 Difference]: Without dead ends: 508 [2024-11-28 05:21:05,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 34.1s TimeCoverageRelationStatistics Valid=27, Invalid=88, Unknown=3, NotChecked=38, Total=156 [2024-11-28 05:21:05,264 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 52 mSDsluCounter, 3590 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 3 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 62.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 4105 SdHoareTripleChecker+Invalid, 920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 155 IncrementalHoareTripleChecker+Unchecked, 62.4s IncrementalHoareTripleChecker+Time [2024-11-28 05:21:05,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 4105 Invalid, 920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 751 Invalid, 11 Unknown, 155 Unchecked, 62.4s Time] [2024-11-28 05:21:05,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2024-11-28 05:21:05,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 487. [2024-11-28 05:21:05,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 466 states have (on average 1.3347639484978542) internal successors, (622), 471 states have internal predecessors, (622), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-28 05:21:05,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 647 transitions. [2024-11-28 05:21:05,283 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 647 transitions. Word has length 73 [2024-11-28 05:21:05,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:21:05,284 INFO L471 AbstractCegarLoop]: Abstraction has 487 states and 647 transitions. [2024-11-28 05:21:05,284 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 05:21:05,284 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 647 transitions. [2024-11-28 05:21:05,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-28 05:21:05,285 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:21:05,285 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 05:21:05,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-28 05:21:05,285 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 05:21:05,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:21:05,286 INFO L85 PathProgramCache]: Analyzing trace with hash -2099892114, now seen corresponding path program 1 times [2024-11-28 05:21:05,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:21:05,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517051659] [2024-11-28 05:21:05,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:21:05,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:21:05,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:21:05,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:21:05,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:21:05,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517051659] [2024-11-28 05:21:05,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517051659] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:21:05,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:21:05,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-28 05:21:05,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814052469] [2024-11-28 05:21:05,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:21:05,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 05:21:05,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:21:05,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 05:21:05,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-28 05:21:05,560 INFO L87 Difference]: Start difference. First operand 487 states and 647 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 05:21:06,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:21:06,220 INFO L93 Difference]: Finished difference Result 952 states and 1272 transitions. [2024-11-28 05:21:06,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 05:21:06,221 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 05:21:06,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:21:06,223 INFO L225 Difference]: With dead ends: 952 [2024-11-28 05:21:06,223 INFO L226 Difference]: Without dead ends: 508 [2024-11-28 05:21:06,224 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 05:21:06,226 INFO L435 NwaCegarLoop]: 522 mSDtfsCounter, 34 mSDsluCounter, 3156 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 3678 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.6s IncrementalHoareTripleChecker+Time [2024-11-28 05:21:06,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 3678 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-28 05:21:06,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2024-11-28 05:21:06,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 484. [2024-11-28 05:21:06,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 463 states have (on average 1.3369330453563715) internal successors, (619), 468 states have internal predecessors, (619), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-28 05:21:06,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 644 transitions. [2024-11-28 05:21:06,244 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 644 transitions. Word has length 73 [2024-11-28 05:21:06,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:21:06,244 INFO L471 AbstractCegarLoop]: Abstraction has 484 states and 644 transitions. [2024-11-28 05:21:06,245 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 05:21:06,245 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 644 transitions. [2024-11-28 05:21:06,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-28 05:21:06,245 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:21:06,246 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 05:21:06,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-28 05:21:06,246 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 05:21:06,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:21:06,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1327027261, now seen corresponding path program 1 times [2024-11-28 05:21:06,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:21:06,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6748889] [2024-11-28 05:21:06,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:21:06,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:21:06,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:21:06,713 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 05:21:06,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:21:06,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6748889] [2024-11-28 05:21:06,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6748889] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:21:06,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:21:06,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-28 05:21:06,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424647475] [2024-11-28 05:21:06,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:21:06,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-28 05:21:06,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:21:06,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-28 05:21:06,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-11-28 05:21:06,715 INFO L87 Difference]: Start difference. First operand 484 states and 644 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 05:21:07,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:21:07,593 INFO L93 Difference]: Finished difference Result 937 states and 1259 transitions. [2024-11-28 05:21:07,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 05:21:07,593 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 05:21:07,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:21:07,596 INFO L225 Difference]: With dead ends: 937 [2024-11-28 05:21:07,596 INFO L226 Difference]: Without dead ends: 496 [2024-11-28 05:21:07,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-11-28 05:21:07,598 INFO L435 NwaCegarLoop]: 514 mSDtfsCounter, 16 mSDsluCounter, 4510 mSDsCounter, 0 mSdLazyCounter, 953 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 5024 SdHoareTripleChecker+Invalid, 955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-28 05:21:07,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 5024 Invalid, 955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 953 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-28 05:21:07,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2024-11-28 05:21:07,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 491. [2024-11-28 05:21:07,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 470 states have (on average 1.3361702127659574) internal successors, (628), 475 states have internal predecessors, (628), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-28 05:21:07,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 653 transitions. [2024-11-28 05:21:07,616 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 653 transitions. Word has length 74 [2024-11-28 05:21:07,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:21:07,617 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 653 transitions. [2024-11-28 05:21:07,617 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 05:21:07,617 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 653 transitions. [2024-11-28 05:21:07,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-28 05:21:07,618 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:21:07,618 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 05:21:07,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-28 05:21:07,618 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 05:21:07,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:21:07,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1382843083, now seen corresponding path program 1 times [2024-11-28 05:21:07,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:21:07,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399934595] [2024-11-28 05:21:07,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:21:07,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:21:07,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:21:07,981 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 05:21:07,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:21:07,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399934595] [2024-11-28 05:21:07,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399934595] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:21:07,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:21:07,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-28 05:21:07,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156451304] [2024-11-28 05:21:07,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:21:07,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 05:21:07,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:21:07,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 05:21:07,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-28 05:21:07,983 INFO L87 Difference]: Start difference. First operand 491 states and 653 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 05:21:08,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:21:08,582 INFO L93 Difference]: Finished difference Result 944 states and 1267 transitions. [2024-11-28 05:21:08,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 05:21:08,583 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 05:21:08,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:21:08,586 INFO L225 Difference]: With dead ends: 944 [2024-11-28 05:21:08,586 INFO L226 Difference]: Without dead ends: 496 [2024-11-28 05:21:08,587 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 05:21:08,588 INFO L435 NwaCegarLoop]: 518 mSDtfsCounter, 24 mSDsluCounter, 3214 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 3732 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.5s IncrementalHoareTripleChecker+Time [2024-11-28 05:21:08,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 3732 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-28 05:21:08,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2024-11-28 05:21:08,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 488. [2024-11-28 05:21:08,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 467 states have (on average 1.3361884368308352) internal successors, (624), 472 states have internal predecessors, (624), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-28 05:21:08,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 649 transitions. [2024-11-28 05:21:08,607 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 649 transitions. Word has length 74 [2024-11-28 05:21:08,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:21:08,607 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 649 transitions. [2024-11-28 05:21:08,608 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 05:21:08,608 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 649 transitions. [2024-11-28 05:21:08,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-28 05:21:08,608 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:21:08,609 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 05:21:08,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-28 05:21:08,609 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 05:21:08,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:21:08,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1084753645, now seen corresponding path program 1 times [2024-11-28 05:21:08,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:21:08,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711610004] [2024-11-28 05:21:08,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:21:08,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:21:08,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:21:08,891 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 05:21:08,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:21:08,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711610004] [2024-11-28 05:21:08,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711610004] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:21:08,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:21:08,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-28 05:21:08,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096112311] [2024-11-28 05:21:08,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:21:08,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 05:21:08,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:21:08,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 05:21:08,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-28 05:21:08,893 INFO L87 Difference]: Start difference. First operand 488 states and 649 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 05:21:09,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:21:09,254 INFO L93 Difference]: Finished difference Result 934 states and 1252 transitions. [2024-11-28 05:21:09,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 05:21:09,255 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 05:21:09,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:21:09,257 INFO L225 Difference]: With dead ends: 934 [2024-11-28 05:21:09,257 INFO L226 Difference]: Without dead ends: 489 [2024-11-28 05:21:09,258 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 05:21:09,259 INFO L435 NwaCegarLoop]: 521 mSDtfsCounter, 53 mSDsluCounter, 2300 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 2821 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.3s IncrementalHoareTripleChecker+Time [2024-11-28 05:21:09,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 2821 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 05:21:09,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2024-11-28 05:21:09,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 485. [2024-11-28 05:21:09,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 464 states have (on average 1.3362068965517242) internal successors, (620), 469 states have internal predecessors, (620), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-28 05:21:09,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 645 transitions. [2024-11-28 05:21:09,277 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 645 transitions. Word has length 74 [2024-11-28 05:21:09,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:21:09,277 INFO L471 AbstractCegarLoop]: Abstraction has 485 states and 645 transitions. [2024-11-28 05:21:09,277 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 05:21:09,278 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 645 transitions. [2024-11-28 05:21:09,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-28 05:21:09,278 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:21:09,279 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 05:21:09,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-28 05:21:09,279 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 05:21:09,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:21:09,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1416685997, now seen corresponding path program 1 times [2024-11-28 05:21:09,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:21:09,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270307616] [2024-11-28 05:21:09,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:21:09,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:21:09,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:21:09,707 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 05:21:09,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:21:09,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270307616] [2024-11-28 05:21:09,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270307616] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:21:09,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:21:09,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-28 05:21:09,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059291276] [2024-11-28 05:21:09,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:21:09,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-28 05:21:09,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:21:09,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-28 05:21:09,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-28 05:21:09,710 INFO L87 Difference]: Start difference. First operand 485 states and 645 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 05:21:10,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:21:10,646 INFO L93 Difference]: Finished difference Result 943 states and 1268 transitions. [2024-11-28 05:21:10,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 05:21:10,647 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 05:21:10,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:21:10,649 INFO L225 Difference]: With dead ends: 943 [2024-11-28 05:21:10,649 INFO L226 Difference]: Without dead ends: 501 [2024-11-28 05:21:10,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-11-28 05:21:10,651 INFO L435 NwaCegarLoop]: 497 mSDtfsCounter, 18 mSDsluCounter, 4489 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 4986 SdHoareTripleChecker+Invalid, 885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-28 05:21:10,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 4986 Invalid, 885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-28 05:21:10,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2024-11-28 05:21:10,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 486. [2024-11-28 05:21:10,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 465 states have (on average 1.335483870967742) internal successors, (621), 470 states have internal predecessors, (621), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-28 05:21:10,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 646 transitions. [2024-11-28 05:21:10,668 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 646 transitions. Word has length 74 [2024-11-28 05:21:10,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:21:10,668 INFO L471 AbstractCegarLoop]: Abstraction has 486 states and 646 transitions. [2024-11-28 05:21:10,669 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 05:21:10,669 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 646 transitions. [2024-11-28 05:21:10,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-28 05:21:10,669 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:21:10,670 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 05:21:10,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-28 05:21:10,670 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 05:21:10,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:21:10,670 INFO L85 PathProgramCache]: Analyzing trace with hash -182846351, now seen corresponding path program 1 times [2024-11-28 05:21:10,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:21:10,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56275720] [2024-11-28 05:21:10,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:21:10,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:21:10,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:21:11,212 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 05:21:11,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:21:11,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56275720] [2024-11-28 05:21:11,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56275720] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:21:11,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:21:11,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-28 05:21:11,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616920793] [2024-11-28 05:21:11,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:21:11,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-28 05:21:11,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:21:11,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-28 05:21:11,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2024-11-28 05:21:11,214 INFO L87 Difference]: Start difference. First operand 486 states and 646 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 05:21:12,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:21:12,247 INFO L93 Difference]: Finished difference Result 961 states and 1288 transitions. [2024-11-28 05:21:12,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 05:21:12,248 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 05:21:12,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:21:12,250 INFO L225 Difference]: With dead ends: 961 [2024-11-28 05:21:12,250 INFO L226 Difference]: Without dead ends: 518 [2024-11-28 05:21:12,252 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 05:21:12,253 INFO L435 NwaCegarLoop]: 506 mSDtfsCounter, 47 mSDsluCounter, 4987 mSDsCounter, 0 mSdLazyCounter, 1052 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 5493 SdHoareTripleChecker+Invalid, 1053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-28 05:21:12,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 5493 Invalid, 1053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1052 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-28 05:21:12,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2024-11-28 05:21:12,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 495. [2024-11-28 05:21:12,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 474 states have (on average 1.3354430379746836) internal successors, (633), 479 states have internal predecessors, (633), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-28 05:21:12,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 658 transitions. [2024-11-28 05:21:12,273 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 658 transitions. Word has length 74 [2024-11-28 05:21:12,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:21:12,273 INFO L471 AbstractCegarLoop]: Abstraction has 495 states and 658 transitions. [2024-11-28 05:21:12,273 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 05:21:12,274 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 658 transitions. [2024-11-28 05:21:12,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-28 05:21:12,274 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:21:12,274 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 05:21:12,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-28 05:21:12,275 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 05:21:12,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:21:12,275 INFO L85 PathProgramCache]: Analyzing trace with hash 663989509, now seen corresponding path program 1 times [2024-11-28 05:21:12,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:21:12,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37641820] [2024-11-28 05:21:12,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:21:12,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:21:12,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:21:13,177 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 05:21:13,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:21:13,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37641820] [2024-11-28 05:21:13,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37641820] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:21:13,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:21:13,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-28 05:21:13,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105625199] [2024-11-28 05:21:13,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:21:13,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-28 05:21:13,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:21:13,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-28 05:21:13,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-28 05:21:13,179 INFO L87 Difference]: Start difference. First operand 495 states and 658 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 05:21:15,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:21:16,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:21:16,438 INFO L93 Difference]: Finished difference Result 1019 states and 1370 transitions. [2024-11-28 05:21:16,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 05:21:16,439 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 05:21:16,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:21:16,441 INFO L225 Difference]: With dead ends: 1019 [2024-11-28 05:21:16,442 INFO L226 Difference]: Without dead ends: 567 [2024-11-28 05:21:16,442 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-28 05:21:16,443 INFO L435 NwaCegarLoop]: 528 mSDtfsCounter, 112 mSDsluCounter, 4169 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 4697 SdHoareTripleChecker+Invalid, 976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-28 05:21:16,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 4697 Invalid, 976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 969 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-28 05:21:16,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2024-11-28 05:21:16,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 496. [2024-11-28 05:21:16,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 475 states have (on average 1.3368421052631578) internal successors, (635), 480 states have internal predecessors, (635), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-28 05:21:16,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 660 transitions. [2024-11-28 05:21:16,468 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 660 transitions. Word has length 74 [2024-11-28 05:21:16,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:21:16,469 INFO L471 AbstractCegarLoop]: Abstraction has 496 states and 660 transitions. [2024-11-28 05:21:16,469 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 05:21:16,469 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 660 transitions. [2024-11-28 05:21:16,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-28 05:21:16,470 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:21:16,470 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 05:21:16,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-28 05:21:16,471 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 05:21:16,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:21:16,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1570535271, now seen corresponding path program 1 times [2024-11-28 05:21:16,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:21:16,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22487814] [2024-11-28 05:21:16,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:21:16,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:21:16,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:21:17,030 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 05:21:17,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:21:17,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22487814] [2024-11-28 05:21:17,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22487814] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:21:17,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:21:17,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-28 05:21:17,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650152306] [2024-11-28 05:21:17,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:21:17,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 05:21:17,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:21:17,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 05:21:17,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-28 05:21:17,032 INFO L87 Difference]: Start difference. First operand 496 states and 660 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 05:21:19,145 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 05:21:24,050 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 05:21:28,053 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 05:21:29,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:21:29,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:21:29,749 INFO L93 Difference]: Finished difference Result 970 states and 1303 transitions. [2024-11-28 05:21:29,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 05:21:29,749 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 05:21:29,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:21:29,752 INFO L225 Difference]: With dead ends: 970 [2024-11-28 05:21:29,752 INFO L226 Difference]: Without dead ends: 517 [2024-11-28 05:21:29,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-28 05:21:29,758 INFO L435 NwaCegarLoop]: 504 mSDtfsCounter, 82 mSDsluCounter, 3137 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 9 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 3641 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.6s IncrementalHoareTripleChecker+Time [2024-11-28 05:21:29,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 3641 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 642 Invalid, 2 Unknown, 0 Unchecked, 12.6s Time] [2024-11-28 05:21:29,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2024-11-28 05:21:29,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 496. [2024-11-28 05:21:29,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 475 states have (on average 1.3368421052631578) internal successors, (635), 480 states have internal predecessors, (635), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-28 05:21:29,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 660 transitions. [2024-11-28 05:21:29,779 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 660 transitions. Word has length 74 [2024-11-28 05:21:29,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:21:29,779 INFO L471 AbstractCegarLoop]: Abstraction has 496 states and 660 transitions. [2024-11-28 05:21:29,779 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 05:21:29,779 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 660 transitions. [2024-11-28 05:21:29,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-28 05:21:29,780 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:21:29,780 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 05:21:29,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-28 05:21:29,781 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 05:21:29,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:21:29,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1465200851, now seen corresponding path program 1 times [2024-11-28 05:21:29,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:21:29,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514245284] [2024-11-28 05:21:29,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:21:29,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:21:29,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:21:30,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 05:21:30,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:21:30,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514245284] [2024-11-28 05:21:30,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514245284] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:21:30,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:21:30,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-28 05:21:30,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905430019] [2024-11-28 05:21:30,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:21:30,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 05:21:30,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:21:30,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 05:21:30,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-28 05:21:30,004 INFO L87 Difference]: Start difference. First operand 496 states and 660 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 05:21:30,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:21:30,532 INFO L93 Difference]: Finished difference Result 983 states and 1315 transitions. [2024-11-28 05:21:30,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 05:21:30,533 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 05:21:30,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:21:30,536 INFO L225 Difference]: With dead ends: 983 [2024-11-28 05:21:30,536 INFO L226 Difference]: Without dead ends: 530 [2024-11-28 05:21:30,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-11-28 05:21:30,537 INFO L435 NwaCegarLoop]: 518 mSDtfsCounter, 99 mSDsluCounter, 1812 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 2330 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-28 05:21:30,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 2330 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-28 05:21:30,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2024-11-28 05:21:30,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 492. [2024-11-28 05:21:30,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 471 states have (on average 1.3397027600849256) internal successors, (631), 476 states have internal predecessors, (631), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-28 05:21:30,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 656 transitions. [2024-11-28 05:21:30,559 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 656 transitions. Word has length 74 [2024-11-28 05:21:30,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:21:30,560 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 656 transitions. [2024-11-28 05:21:30,560 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 05:21:30,560 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 656 transitions. [2024-11-28 05:21:30,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-28 05:21:30,561 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:21:30,561 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 05:21:30,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-28 05:21:30,561 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 05:21:30,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:21:30,562 INFO L85 PathProgramCache]: Analyzing trace with hash -57677131, now seen corresponding path program 1 times [2024-11-28 05:21:30,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:21:30,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277657855] [2024-11-28 05:21:30,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:21:30,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:21:30,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:21:30,910 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 05:21:30,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:21:30,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277657855] [2024-11-28 05:21:30,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277657855] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:21:30,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:21:30,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-28 05:21:30,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065446436] [2024-11-28 05:21:30,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:21:30,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 05:21:30,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:21:30,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 05:21:30,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-28 05:21:30,913 INFO L87 Difference]: Start difference. First operand 492 states and 656 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 05:21:34,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.19s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:21:34,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:21:34,633 INFO L93 Difference]: Finished difference Result 960 states and 1288 transitions. [2024-11-28 05:21:34,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 05:21:34,634 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 05:21:34,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:21:34,637 INFO L225 Difference]: With dead ends: 960 [2024-11-28 05:21:34,637 INFO L226 Difference]: Without dead ends: 502 [2024-11-28 05:21:34,640 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 05:21:34,641 INFO L435 NwaCegarLoop]: 516 mSDtfsCounter, 12 mSDsluCounter, 3635 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 4151 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-28 05:21:34,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 4151 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-28 05:21:34,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2024-11-28 05:21:34,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 492. [2024-11-28 05:21:34,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 471 states have (on average 1.3397027600849256) internal successors, (631), 476 states have internal predecessors, (631), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-28 05:21:34,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 656 transitions. [2024-11-28 05:21:34,663 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 656 transitions. Word has length 74 [2024-11-28 05:21:34,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:21:34,663 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 656 transitions. [2024-11-28 05:21:34,664 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 05:21:34,664 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 656 transitions. [2024-11-28 05:21:34,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-28 05:21:34,665 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:21:34,665 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 05:21:34,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-28 05:21:34,666 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 05:21:34,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:21:34,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1328946313, now seen corresponding path program 1 times [2024-11-28 05:21:34,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:21:34,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960666467] [2024-11-28 05:21:34,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:21:34,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:21:34,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:21:35,465 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 05:21:35,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:21:35,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960666467] [2024-11-28 05:21:35,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960666467] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:21:35,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:21:35,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-28 05:21:35,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659677304] [2024-11-28 05:21:35,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:21:35,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-28 05:21:35,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:21:35,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-28 05:21:35,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-28 05:21:35,469 INFO L87 Difference]: Start difference. First operand 492 states and 656 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 05:21:36,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:21:36,275 INFO L93 Difference]: Finished difference Result 946 states and 1270 transitions. [2024-11-28 05:21:36,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 05:21:36,275 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 05:21:36,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:21:36,278 INFO L225 Difference]: With dead ends: 946 [2024-11-28 05:21:36,278 INFO L226 Difference]: Without dead ends: 488 [2024-11-28 05:21:36,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-28 05:21:36,282 INFO L435 NwaCegarLoop]: 510 mSDtfsCounter, 12 mSDsluCounter, 3583 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 4093 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-28 05:21:36,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 4093 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-28 05:21:36,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2024-11-28 05:21:36,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 478. [2024-11-28 05:21:36,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 457 states have (on average 1.3435448577680524) internal successors, (614), 462 states have internal predecessors, (614), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-28 05:21:36,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 639 transitions. [2024-11-28 05:21:36,306 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 639 transitions. Word has length 75 [2024-11-28 05:21:36,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:21:36,307 INFO L471 AbstractCegarLoop]: Abstraction has 478 states and 639 transitions. [2024-11-28 05:21:36,307 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 05:21:36,307 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 639 transitions. [2024-11-28 05:21:36,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-28 05:21:36,308 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:21:36,309 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 05:21:36,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-28 05:21:36,309 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 05:21:36,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:21:36,310 INFO L85 PathProgramCache]: Analyzing trace with hash 486374430, now seen corresponding path program 1 times [2024-11-28 05:21:36,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:21:36,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595111936] [2024-11-28 05:21:36,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:21:36,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:21:36,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:21:36,758 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 05:21:36,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:21:36,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595111936] [2024-11-28 05:21:36,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595111936] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:21:36,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:21:36,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-28 05:21:36,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450752443] [2024-11-28 05:21:36,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:21:36,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 05:21:36,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:21:36,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 05:21:36,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-28 05:21:36,766 INFO L87 Difference]: Start difference. First operand 478 states and 639 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 05:21:37,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:21:37,383 INFO L93 Difference]: Finished difference Result 938 states and 1259 transitions. [2024-11-28 05:21:37,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 05:21:37,384 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 05:21:37,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:21:37,386 INFO L225 Difference]: With dead ends: 938 [2024-11-28 05:21:37,387 INFO L226 Difference]: Without dead ends: 494 [2024-11-28 05:21:37,388 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 05:21:37,388 INFO L435 NwaCegarLoop]: 511 mSDtfsCounter, 13 mSDsluCounter, 3617 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 4128 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-28 05:21:37,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 4128 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 662 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-28 05:21:37,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2024-11-28 05:21:37,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 489. [2024-11-28 05:21:37,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 468 states have (on average 1.3376068376068375) internal successors, (626), 473 states have internal predecessors, (626), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-28 05:21:37,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 651 transitions. [2024-11-28 05:21:37,407 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 651 transitions. Word has length 75 [2024-11-28 05:21:37,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:21:37,407 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 651 transitions. [2024-11-28 05:21:37,407 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 05:21:37,407 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 651 transitions. [2024-11-28 05:21:37,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-28 05:21:37,408 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:21:37,408 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 05:21:37,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-28 05:21:37,409 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 05:21:37,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:21:37,409 INFO L85 PathProgramCache]: Analyzing trace with hash 670310146, now seen corresponding path program 1 times [2024-11-28 05:21:37,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:21:37,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341249835] [2024-11-28 05:21:37,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:21:37,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:21:37,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:21:37,883 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 05:21:37,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:21:37,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341249835] [2024-11-28 05:21:37,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341249835] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:21:37,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:21:37,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-28 05:21:37,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734105945] [2024-11-28 05:21:37,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:21:37,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-28 05:21:37,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:21:37,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-28 05:21:37,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-28 05:21:37,886 INFO L87 Difference]: Start difference. First operand 489 states and 651 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 05:21:38,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:21:38,661 INFO L93 Difference]: Finished difference Result 959 states and 1285 transitions. [2024-11-28 05:21:38,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 05:21:38,662 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 05:21:38,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:21:38,664 INFO L225 Difference]: With dead ends: 959 [2024-11-28 05:21:38,665 INFO L226 Difference]: Without dead ends: 504 [2024-11-28 05:21:38,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-11-28 05:21:38,666 INFO L435 NwaCegarLoop]: 517 mSDtfsCounter, 17 mSDsluCounter, 4514 mSDsCounter, 0 mSdLazyCounter, 1012 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 5031 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.7s IncrementalHoareTripleChecker+Time [2024-11-28 05:21:38,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 5031 Invalid, 1013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1012 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-28 05:21:38,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2024-11-28 05:21:38,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 494. [2024-11-28 05:21:38,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 473 states have (on average 1.3361522198731501) internal successors, (632), 478 states have internal predecessors, (632), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-28 05:21:38,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 657 transitions. [2024-11-28 05:21:38,684 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 657 transitions. Word has length 75 [2024-11-28 05:21:38,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:21:38,684 INFO L471 AbstractCegarLoop]: Abstraction has 494 states and 657 transitions. [2024-11-28 05:21:38,684 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 05:21:38,684 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 657 transitions. [2024-11-28 05:21:38,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-28 05:21:38,685 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:21:38,685 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 05:21:38,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-28 05:21:38,686 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 05:21:38,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:21:38,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1034564936, now seen corresponding path program 1 times [2024-11-28 05:21:38,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:21:38,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846777546] [2024-11-28 05:21:38,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:21:38,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:21:38,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:21:39,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 05:21:39,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:21:39,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846777546] [2024-11-28 05:21:39,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846777546] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:21:39,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:21:39,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-28 05:21:39,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29119832] [2024-11-28 05:21:39,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:21:39,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-28 05:21:39,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:21:39,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-28 05:21:39,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2024-11-28 05:21:39,198 INFO L87 Difference]: Start difference. First operand 494 states and 657 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 05:21:40,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:21:40,731 INFO L93 Difference]: Finished difference Result 977 states and 1308 transitions. [2024-11-28 05:21:40,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 05:21:40,731 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 05:21:40,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:21:40,734 INFO L225 Difference]: With dead ends: 977 [2024-11-28 05:21:40,734 INFO L226 Difference]: Without dead ends: 517 [2024-11-28 05:21:40,735 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2024-11-28 05:21:40,736 INFO L435 NwaCegarLoop]: 516 mSDtfsCounter, 49 mSDsluCounter, 5466 mSDsCounter, 0 mSdLazyCounter, 1300 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 5982 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.5s IncrementalHoareTripleChecker+Time [2024-11-28 05:21:40,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 5982 Invalid, 1303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1300 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-28 05:21:40,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2024-11-28 05:21:40,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 494. [2024-11-28 05:21:40,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 473 states have (on average 1.3361522198731501) internal successors, (632), 478 states have internal predecessors, (632), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-28 05:21:40,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 657 transitions. [2024-11-28 05:21:40,761 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 657 transitions. Word has length 75 [2024-11-28 05:21:40,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:21:40,762 INFO L471 AbstractCegarLoop]: Abstraction has 494 states and 657 transitions. [2024-11-28 05:21:40,762 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 05:21:40,762 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 657 transitions. [2024-11-28 05:21:40,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-28 05:21:40,762 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:21:40,763 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 05:21:40,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-28 05:21:40,763 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 05:21:40,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:21:40,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1881400796, now seen corresponding path program 1 times [2024-11-28 05:21:40,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:21:40,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771976283] [2024-11-28 05:21:40,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:21:40,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:21:40,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:21:41,157 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 05:21:41,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:21:41,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771976283] [2024-11-28 05:21:41,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771976283] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:21:41,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:21:41,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-28 05:21:41,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125629953] [2024-11-28 05:21:41,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:21:41,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-28 05:21:41,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:21:41,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-28 05:21:41,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-28 05:21:41,161 INFO L87 Difference]: Start difference. First operand 494 states and 657 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 05:21:41,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:21:41,936 INFO L93 Difference]: Finished difference Result 966 states and 1295 transitions. [2024-11-28 05:21:41,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 05:21:41,936 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 05:21:41,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:21:41,939 INFO L225 Difference]: With dead ends: 966 [2024-11-28 05:21:41,939 INFO L226 Difference]: Without dead ends: 506 [2024-11-28 05:21:41,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-11-28 05:21:41,940 INFO L435 NwaCegarLoop]: 506 mSDtfsCounter, 17 mSDsluCounter, 4500 mSDsCounter, 0 mSdLazyCounter, 958 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 5006 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.7s IncrementalHoareTripleChecker+Time [2024-11-28 05:21:41,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 5006 Invalid, 959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 958 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-28 05:21:41,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2024-11-28 05:21:41,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 492. [2024-11-28 05:21:41,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 471 states have (on average 1.335456475583864) internal successors, (629), 476 states have internal predecessors, (629), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-28 05:21:41,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 654 transitions. [2024-11-28 05:21:41,957 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 654 transitions. Word has length 75 [2024-11-28 05:21:41,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:21:41,958 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 654 transitions. [2024-11-28 05:21:41,958 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 05:21:41,958 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 654 transitions. [2024-11-28 05:21:41,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-28 05:21:41,959 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:21:41,959 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 05:21:41,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-28 05:21:41,959 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 05:21:41,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:21:41,960 INFO L85 PathProgramCache]: Analyzing trace with hash -353123984, now seen corresponding path program 1 times [2024-11-28 05:21:41,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:21:41,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889120116] [2024-11-28 05:21:41,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:21:41,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:21:42,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:21:42,342 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 05:21:42,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:21:42,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889120116] [2024-11-28 05:21:42,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889120116] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:21:42,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:21:42,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-28 05:21:42,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078498812] [2024-11-28 05:21:42,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:21:42,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 05:21:42,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:21:42,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 05:21:42,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-28 05:21:42,345 INFO L87 Difference]: Start difference. First operand 492 states and 654 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 05:21:43,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:21:43,024 INFO L93 Difference]: Finished difference Result 959 states and 1284 transitions. [2024-11-28 05:21:43,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 05:21:43,024 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 05:21:43,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:21:43,026 INFO L225 Difference]: With dead ends: 959 [2024-11-28 05:21:43,026 INFO L226 Difference]: Without dead ends: 501 [2024-11-28 05:21:43,026 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 05:21:43,027 INFO L435 NwaCegarLoop]: 506 mSDtfsCounter, 48 mSDsluCounter, 3591 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 4097 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.6s IncrementalHoareTripleChecker+Time [2024-11-28 05:21:43,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 4097 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 673 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-28 05:21:43,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2024-11-28 05:21:43,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 490. [2024-11-28 05:21:43,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 469 states have (on average 1.3347547974413647) internal successors, (626), 474 states have internal predecessors, (626), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-28 05:21:43,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 651 transitions. [2024-11-28 05:21:43,055 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 651 transitions. Word has length 75 [2024-11-28 05:21:43,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:21:43,056 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 651 transitions. [2024-11-28 05:21:43,056 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 05:21:43,056 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 651 transitions. [2024-11-28 05:21:43,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-28 05:21:43,057 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:21:43,057 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 05:21:43,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-28 05:21:43,057 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 05:21:43,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:21:43,058 INFO L85 PathProgramCache]: Analyzing trace with hash 552029526, now seen corresponding path program 1 times [2024-11-28 05:21:43,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:21:43,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598572494] [2024-11-28 05:21:43,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:21:43,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:21:43,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:21:43,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 05:21:43,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:21:43,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598572494] [2024-11-28 05:21:43,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598572494] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:21:43,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:21:43,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-28 05:21:43,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084127910] [2024-11-28 05:21:43,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:21:43,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-28 05:21:43,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:21:43,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-28 05:21:43,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-11-28 05:21:43,658 INFO L87 Difference]: Start difference. First operand 490 states and 651 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 05:21:44,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:21:44,510 INFO L93 Difference]: Finished difference Result 972 states and 1303 transitions. [2024-11-28 05:21:44,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 05:21:44,511 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 05:21:44,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:21:44,513 INFO L225 Difference]: With dead ends: 972 [2024-11-28 05:21:44,513 INFO L226 Difference]: Without dead ends: 516 [2024-11-28 05:21:44,514 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 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 05:21:44,514 INFO L435 NwaCegarLoop]: 493 mSDtfsCounter, 36 mSDsluCounter, 4057 mSDsCounter, 0 mSdLazyCounter, 911 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 4550 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-28 05:21:44,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 4550 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 911 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-28 05:21:44,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2024-11-28 05:21:44,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 500. [2024-11-28 05:21:44,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 479 states have (on average 1.3340292275574113) internal successors, (639), 484 states have internal predecessors, (639), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-28 05:21:44,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 664 transitions. [2024-11-28 05:21:44,531 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 664 transitions. Word has length 75 [2024-11-28 05:21:44,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:21:44,532 INFO L471 AbstractCegarLoop]: Abstraction has 500 states and 664 transitions. [2024-11-28 05:21:44,532 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 05:21:44,532 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 664 transitions. [2024-11-28 05:21:44,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-28 05:21:44,533 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:21:44,533 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 05:21:44,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-28 05:21:44,533 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 05:21:44,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:21:44,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1685642863, now seen corresponding path program 1 times [2024-11-28 05:21:44,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:21:44,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769916093] [2024-11-28 05:21:44,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:21:44,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:21:44,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:21:51,302 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 05:21:51,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:21:51,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769916093] [2024-11-28 05:21:51,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769916093] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:21:51,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:21:51,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-28 05:21:51,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047923126] [2024-11-28 05:21:51,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:21:51,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-28 05:21:51,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:21:51,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-28 05:21:51,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2024-11-28 05:21:51,303 INFO L87 Difference]: Start difference. First operand 500 states and 664 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 05:21:56,062 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 05:22:00,066 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 05:22:04,083 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 05:22:08,086 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 05:22:12,088 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 05:22:16,097 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 05:22:20,104 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 05:22:24,120 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 05:22:28,127 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 05:22:32,144 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 05:22:36,156 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 05:22:40,171 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 05:22:44,187 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 05:22:45,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:22:45,570 INFO L93 Difference]: Finished difference Result 977 states and 1308 transitions. [2024-11-28 05:22:45,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 05:22:45,571 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 05:22:45,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:22:45,574 INFO L225 Difference]: With dead ends: 977 [2024-11-28 05:22:45,574 INFO L226 Difference]: Without dead ends: 511 [2024-11-28 05:22:45,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2024-11-28 05:22:45,575 INFO L435 NwaCegarLoop]: 498 mSDtfsCounter, 22 mSDsluCounter, 4912 mSDsCounter, 0 mSdLazyCounter, 1003 mSolverCounterSat, 1 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 54.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 5410 SdHoareTripleChecker+Invalid, 1017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1003 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 54.2s IncrementalHoareTripleChecker+Time [2024-11-28 05:22:45,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 5410 Invalid, 1017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1003 Invalid, 13 Unknown, 0 Unchecked, 54.2s Time] [2024-11-28 05:22:45,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2024-11-28 05:22:45,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 504. [2024-11-28 05:22:45,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 483 states have (on average 1.3333333333333333) internal successors, (644), 488 states have internal predecessors, (644), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-28 05:22:45,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 669 transitions. [2024-11-28 05:22:45,591 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 669 transitions. Word has length 75 [2024-11-28 05:22:45,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:22:45,591 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 669 transitions. [2024-11-28 05:22:45,591 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 05:22:45,591 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 669 transitions. [2024-11-28 05:22:45,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-28 05:22:45,592 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:22:45,592 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 05:22:45,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-28 05:22:45,593 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 05:22:45,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:22:45,593 INFO L85 PathProgramCache]: Analyzing trace with hash -408280145, now seen corresponding path program 1 times [2024-11-28 05:22:45,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:22:45,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334744975] [2024-11-28 05:22:45,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:22:45,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:22:45,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:23:10,619 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 05:23:10,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:23:10,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334744975] [2024-11-28 05:23:10,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334744975] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:23:10,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:23:10,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-28 05:23:10,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244867341] [2024-11-28 05:23:10,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:23:10,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-28 05:23:10,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:23:10,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-28 05:23:10,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=87, Unknown=4, NotChecked=0, Total=110 [2024-11-28 05:23:10,621 INFO L87 Difference]: Start difference. First operand 504 states and 669 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 05:23:14,881 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 05:23:17,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.47s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:23:21,360 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 05:23:25,401 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 05:23:27,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 05:23:31,915 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 05:23:35,918 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 05:23:40,258 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 05:23:40,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:23:40,858 INFO L93 Difference]: Finished difference Result 983 states and 1315 transitions. [2024-11-28 05:23:40,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 05:23:40,859 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 05:23:40,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:23:40,862 INFO L225 Difference]: With dead ends: 983 [2024-11-28 05:23:40,862 INFO L226 Difference]: Without dead ends: 513 [2024-11-28 05:23:40,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.8s TimeCoverageRelationStatistics Valid=19, Invalid=87, Unknown=4, NotChecked=0, Total=110 [2024-11-28 05:23:40,863 INFO L435 NwaCegarLoop]: 504 mSDtfsCounter, 17 mSDsluCounter, 4026 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 1 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4530 SdHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 801 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.2s IncrementalHoareTripleChecker+Time [2024-11-28 05:23:40,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4530 Invalid, 808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 801 Invalid, 6 Unknown, 0 Unchecked, 30.2s Time] [2024-11-28 05:23:40,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2024-11-28 05:23:40,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 509. [2024-11-28 05:23:40,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 488 states have (on average 1.334016393442623) internal successors, (651), 493 states have internal predecessors, (651), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-28 05:23:40,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 676 transitions. [2024-11-28 05:23:40,882 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 676 transitions. Word has length 75 [2024-11-28 05:23:40,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:23:40,883 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 676 transitions. [2024-11-28 05:23:40,883 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 05:23:40,884 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 676 transitions. [2024-11-28 05:23:40,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-28 05:23:40,884 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:23:40,884 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 05:23:40,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-28 05:23:40,885 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 05:23:40,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:23:40,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1110996182, now seen corresponding path program 1 times [2024-11-28 05:23:40,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:23:40,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931369470] [2024-11-28 05:23:40,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:23:40,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:23:40,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:23:41,231 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 05:23:41,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:23:41,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931369470] [2024-11-28 05:23:41,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931369470] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:23:41,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:23:41,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-28 05:23:41,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935275461] [2024-11-28 05:23:41,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:23:41,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 05:23:41,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:23:41,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 05:23:41,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-28 05:23:41,234 INFO L87 Difference]: Start difference. First operand 509 states and 676 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 05:23:42,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:23:42,346 INFO L93 Difference]: Finished difference Result 1051 states and 1407 transitions. [2024-11-28 05:23:42,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-28 05:23:42,347 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 05:23:42,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:23:42,349 INFO L225 Difference]: With dead ends: 1051 [2024-11-28 05:23:42,349 INFO L226 Difference]: Without dead ends: 576 [2024-11-28 05:23:42,350 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2024-11-28 05:23:42,351 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 133 mSDsluCounter, 3182 mSDsCounter, 0 mSdLazyCounter, 1008 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 3697 SdHoareTripleChecker+Invalid, 1030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1008 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-28 05:23:42,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 3697 Invalid, 1030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1008 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-28 05:23:42,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2024-11-28 05:23:42,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 512. [2024-11-28 05:23:42,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 491 states have (on average 1.3340122199592668) internal successors, (655), 496 states have internal predecessors, (655), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-28 05:23:42,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 680 transitions. [2024-11-28 05:23:42,366 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 680 transitions. Word has length 75 [2024-11-28 05:23:42,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:23:42,367 INFO L471 AbstractCegarLoop]: Abstraction has 512 states and 680 transitions. [2024-11-28 05:23:42,367 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 05:23:42,367 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 680 transitions. [2024-11-28 05:23:42,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-28 05:23:42,368 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:23:42,368 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 05:23:42,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-11-28 05:23:42,368 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 05:23:42,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:23:42,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1407040598, now seen corresponding path program 1 times [2024-11-28 05:23:42,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:23:42,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178249649] [2024-11-28 05:23:42,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:23:42,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:23:42,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:23:43,097 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 05:23:43,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 05:23:43,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178249649] [2024-11-28 05:23:43,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178249649] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:23:43,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:23:43,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-28 05:23:43,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736531186] [2024-11-28 05:23:43,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:23:43,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-28 05:23:43,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:23:43,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-28 05:23:43,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2024-11-28 05:23:43,099 INFO L87 Difference]: Start difference. First operand 512 states and 680 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 05:23:44,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:23:44,618 INFO L93 Difference]: Finished difference Result 1018 states and 1366 transitions. [2024-11-28 05:23:44,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-28 05:23:44,622 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 05:23:44,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:23:44,624 INFO L225 Difference]: With dead ends: 1018 [2024-11-28 05:23:44,624 INFO L226 Difference]: Without dead ends: 540 [2024-11-28 05:23:44,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2024-11-28 05:23:44,625 INFO L435 NwaCegarLoop]: 496 mSDtfsCounter, 28 mSDsluCounter, 6252 mSDsCounter, 0 mSdLazyCounter, 1544 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 6748 SdHoareTripleChecker+Invalid, 1544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-28 05:23:44,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 6748 Invalid, 1544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1544 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-28 05:23:44,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2024-11-28 05:23:44,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 524. [2024-11-28 05:23:44,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 503 states have (on average 1.3359840954274353) internal successors, (672), 508 states have internal predecessors, (672), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-28 05:23:44,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 697 transitions. [2024-11-28 05:23:44,634 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 697 transitions. Word has length 75 [2024-11-28 05:23:44,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:23:44,635 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 697 transitions. [2024-11-28 05:23:44,635 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 05:23:44,635 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 697 transitions. [2024-11-28 05:23:44,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-28 05:23:44,636 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:23:44,636 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 05:23:44,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-28 05:23:44,636 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 05:23:44,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:23:44,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1671370991, now seen corresponding path program 1 times [2024-11-28 05:23:44,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 05:23:44,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150288588] [2024-11-28 05:23:44,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:23:44,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 05:23:44,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat