./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_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_b24cd6f1-6014-4437-a6a0-f6514d76f423/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b24cd6f1-6014-4437-a6a0-f6514d76f423/bin/uautomizer-verify-84ZbGMXZE1/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b24cd6f1-6014-4437-a6a0-f6514d76f423/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b24cd6f1-6014-4437-a6a0-f6514d76f423/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerReach.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b24cd6f1-6014-4437-a6a0-f6514d76f423/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b24cd6f1-6014-4437-a6a0-f6514d76f423/bin/uautomizer-verify-84ZbGMXZE1 --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 3012c2825f53c0db53d950c12df6540de859b34b2bef033c36a98846352dedd3 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-02 12:41:16,573 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-02 12:41:16,627 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b24cd6f1-6014-4437-a6a0-f6514d76f423/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-12-02 12:41:16,632 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-02 12:41:16,633 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-02 12:41:16,655 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-02 12:41:16,655 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-02 12:41:16,655 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-02 12:41:16,656 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-12-02 12:41:16,656 INFO L153 SettingsManager]: * Use memory slicer=true [2024-12-02 12:41:16,656 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-02 12:41:16,656 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-02 12:41:16,656 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-02 12:41:16,656 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-02 12:41:16,657 INFO L153 SettingsManager]: * Use SBE=true [2024-12-02 12:41:16,657 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-02 12:41:16,657 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-02 12:41:16,657 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-02 12:41:16,657 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-02 12:41:16,657 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-02 12:41:16,657 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-02 12:41:16,657 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-02 12:41:16,657 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-02 12:41:16,657 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-02 12:41:16,657 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-02 12:41:16,658 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-02 12:41:16,658 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-02 12:41:16,658 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-02 12:41:16,658 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-12-02 12:41:16,658 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 12:41:16,658 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 12:41:16,658 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 12:41:16,658 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 12:41:16,658 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-02 12:41:16,658 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 12:41:16,658 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 12:41:16,658 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 12:41:16,658 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 12:41:16,659 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-02 12:41:16,659 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-02 12:41:16,659 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-12-02 12:41:16,659 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-02 12:41:16,659 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-12-02 12:41:16,659 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-02 12:41:16,659 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-02 12:41:16,659 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-12-02 12:41:16,659 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-12-02 12:41:16,659 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-12-02 12:41:16,659 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_b24cd6f1-6014-4437-a6a0-f6514d76f423/bin/uautomizer-verify-84ZbGMXZE1 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 -> 3012c2825f53c0db53d950c12df6540de859b34b2bef033c36a98846352dedd3 [2024-12-02 12:41:16,874 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-02 12:41:16,881 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-02 12:41:16,883 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-02 12:41:16,885 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-02 12:41:16,885 INFO L274 PluginConnector]: CDTParser initialized [2024-12-02 12:41:16,886 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b24cd6f1-6014-4437-a6a0-f6514d76f423/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i [2024-12-02 12:41:19,475 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b24cd6f1-6014-4437-a6a0-f6514d76f423/bin/uautomizer-verify-84ZbGMXZE1/data/3504a37eb/2c0b932a83464509969f6a57c96b0ddb/FLAGf34f0016b [2024-12-02 12:41:19,797 INFO L384 CDTParser]: Found 1 translation units. [2024-12-02 12:41:19,798 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b24cd6f1-6014-4437-a6a0-f6514d76f423/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i [2024-12-02 12:41:19,813 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b24cd6f1-6014-4437-a6a0-f6514d76f423/bin/uautomizer-verify-84ZbGMXZE1/data/3504a37eb/2c0b932a83464509969f6a57c96b0ddb/FLAGf34f0016b [2024-12-02 12:41:20,060 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b24cd6f1-6014-4437-a6a0-f6514d76f423/bin/uautomizer-verify-84ZbGMXZE1/data/3504a37eb/2c0b932a83464509969f6a57c96b0ddb [2024-12-02 12:41:20,062 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-02 12:41:20,063 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-02 12:41:20,064 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-02 12:41:20,064 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-02 12:41:20,067 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-02 12:41:20,068 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:41:20" (1/1) ... [2024-12-02 12:41:20,068 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48358a4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:41:20, skipping insertion in model container [2024-12-02 12:41:20,068 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:41:20" (1/1) ... [2024-12-02 12:41:20,100 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-02 12:41:20,557 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_b24cd6f1-6014-4437-a6a0-f6514d76f423/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i[44118,44131] [2024-12-02 12:41:20,568 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_b24cd6f1-6014-4437-a6a0-f6514d76f423/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i[44660,44673] [2024-12-02 12:41:20,663 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_b24cd6f1-6014-4437-a6a0-f6514d76f423/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i[56247,56260] [2024-12-02 12:41:20,664 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_b24cd6f1-6014-4437-a6a0-f6514d76f423/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i[56368,56381] [2024-12-02 12:41:20,670 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 12:41:20,682 INFO L200 MainTranslator]: Completed pre-run [2024-12-02 12:41:20,723 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_b24cd6f1-6014-4437-a6a0-f6514d76f423/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i[44118,44131] [2024-12-02 12:41:20,725 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_b24cd6f1-6014-4437-a6a0-f6514d76f423/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i[44660,44673] [2024-12-02 12:41:20,776 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_b24cd6f1-6014-4437-a6a0-f6514d76f423/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i[56247,56260] [2024-12-02 12:41:20,777 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_b24cd6f1-6014-4437-a6a0-f6514d76f423/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i[56368,56381] [2024-12-02 12:41:20,781 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 12:41:20,841 INFO L204 MainTranslator]: Completed translation [2024-12-02 12:41:20,842 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:41:20 WrapperNode [2024-12-02 12:41:20,842 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-02 12:41:20,843 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-02 12:41:20,843 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-02 12:41:20,843 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-02 12:41:20,849 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:41:20" (1/1) ... [2024-12-02 12:41:20,875 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:41:20" (1/1) ... [2024-12-02 12:41:20,933 INFO L138 Inliner]: procedures = 282, calls = 296, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1442 [2024-12-02 12:41:20,933 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-02 12:41:20,934 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-02 12:41:20,934 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-02 12:41:20,934 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-02 12:41:20,943 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:41:20" (1/1) ... [2024-12-02 12:41:20,943 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:41:20" (1/1) ... [2024-12-02 12:41:20,953 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:41:20" (1/1) ... [2024-12-02 12:41:21,019 INFO L175 MemorySlicer]: Split 268 memory accesses to 4 slices as follows [2, 34, 12, 220]. 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, 4, 1, 49]. [2024-12-02 12:41:21,019 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:41:20" (1/1) ... [2024-12-02 12:41:21,019 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:41:20" (1/1) ... [2024-12-02 12:41:21,056 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:41:20" (1/1) ... [2024-12-02 12:41:21,060 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:41:20" (1/1) ... [2024-12-02 12:41:21,072 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:41:20" (1/1) ... [2024-12-02 12:41:21,078 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:41:20" (1/1) ... [2024-12-02 12:41:21,082 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:41:20" (1/1) ... [2024-12-02 12:41:21,091 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-02 12:41:21,092 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-02 12:41:21,092 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-02 12:41:21,092 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-02 12:41:21,093 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:41:20" (1/1) ... [2024-12-02 12:41:21,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 12:41:21,107 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b24cd6f1-6014-4437-a6a0-f6514d76f423/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:41:21,118 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b24cd6f1-6014-4437-a6a0-f6514d76f423/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-12-02 12:41:21,121 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b24cd6f1-6014-4437-a6a0-f6514d76f423/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-12-02 12:41:21,140 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-12-02 12:41:21,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-12-02 12:41:21,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-12-02 12:41:21,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-12-02 12:41:21,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-12-02 12:41:21,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-12-02 12:41:21,140 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2024-12-02 12:41:21,141 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2024-12-02 12:41:21,141 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-12-02 12:41:21,141 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-12-02 12:41:21,141 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-12-02 12:41:21,141 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-12-02 12:41:21,141 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-12-02 12:41:21,141 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-12-02 12:41:21,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-12-02 12:41:21,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-12-02 12:41:21,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-12-02 12:41:21,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-12-02 12:41:21,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-12-02 12:41:21,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-02 12:41:21,142 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2024-12-02 12:41:21,142 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2024-12-02 12:41:21,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-12-02 12:41:21,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-12-02 12:41:21,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-12-02 12:41:21,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-12-02 12:41:21,142 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2024-12-02 12:41:21,142 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2024-12-02 12:41:21,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-12-02 12:41:21,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-12-02 12:41:21,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-12-02 12:41:21,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-12-02 12:41:21,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-02 12:41:21,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-02 12:41:21,343 INFO L234 CfgBuilder]: Building ICFG [2024-12-02 12:41:21,345 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-02 12:41:22,629 INFO L? ?]: Removed 335 outVars from TransFormulas that were not future-live. [2024-12-02 12:41:22,630 INFO L283 CfgBuilder]: Performing block encoding [2024-12-02 12:41:22,647 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-02 12:41:22,647 INFO L312 CfgBuilder]: Removed 36 assume(true) statements. [2024-12-02 12:41:22,648 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:41:22 BoogieIcfgContainer [2024-12-02 12:41:22,648 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-02 12:41:22,650 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-02 12:41:22,650 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-02 12:41:22,654 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-02 12:41:22,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 12:41:20" (1/3) ... [2024-12-02 12:41:22,655 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c4f891d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:41:22, skipping insertion in model container [2024-12-02 12:41:22,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:41:20" (2/3) ... [2024-12-02 12:41:22,655 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c4f891d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:41:22, skipping insertion in model container [2024-12-02 12:41:22,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:41:22" (3/3) ... [2024-12-02 12:41:22,657 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test6-1.i [2024-12-02 12:41:22,667 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-02 12:41:22,668 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_JEN_test6-1.i that has 5 procedures, 440 locations, 1 initial locations, 36 loop locations, and 4 error locations. [2024-12-02 12:41:22,719 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-02 12:41:22,728 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;@53fe4bfa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-02 12:41:22,728 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-12-02 12:41:22,732 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-12-02 12:41:22,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-12-02 12:41:22,736 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:41:22,737 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 12:41:22,737 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-12-02 12:41:22,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:41:22,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1938186709, now seen corresponding path program 1 times [2024-12-02 12:41:22,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:41:22,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803043232] [2024-12-02 12:41:22,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:41:22,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:41:22,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:41:22,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 12:41:22,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:41:22,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803043232] [2024-12-02 12:41:22,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803043232] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:41:22,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:41:22,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 12:41:22,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856173234] [2024-12-02 12:41:22,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:41:22,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-02 12:41:22,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:41:22,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-02 12:41:22,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-02 12:41:22,896 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-12-02 12:41:22,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:41:22,952 INFO L93 Difference]: Finished difference Result 876 states and 1391 transitions. [2024-12-02 12:41:22,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-02 12:41:22,953 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-12-02 12:41:22,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:41:22,961 INFO L225 Difference]: With dead ends: 876 [2024-12-02 12:41:22,962 INFO L226 Difference]: Without dead ends: 434 [2024-12-02 12:41:22,966 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-12-02 12:41:22,968 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-12-02 12:41:22,969 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-12-02 12:41:22,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2024-12-02 12:41:23,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2024-12-02 12:41:23,011 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-12-02 12:41:23,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 615 transitions. [2024-12-02 12:41:23,018 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 615 transitions. Word has length 8 [2024-12-02 12:41:23,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:41:23,018 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 615 transitions. [2024-12-02 12:41:23,019 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-12-02 12:41:23,019 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 615 transitions. [2024-12-02 12:41:23,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-12-02 12:41:23,019 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:41:23,019 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 12:41:23,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-12-02 12:41:23,020 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-12-02 12:41:23,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:41:23,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1937955008, now seen corresponding path program 1 times [2024-12-02 12:41:23,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:41:23,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190251211] [2024-12-02 12:41:23,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:41:23,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:41:23,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:41:23,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-12-02 12:41:23,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:41:23,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190251211] [2024-12-02 12:41:23,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190251211] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:41:23,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:41:23,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 12:41:23,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45273314] [2024-12-02 12:41:23,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:41:23,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 12:41:23,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:41:23,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 12:41:23,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 12:41:23,179 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-12-02 12:41:23,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:41:23,370 INFO L93 Difference]: Finished difference Result 1055 states and 1506 transitions. [2024-12-02 12:41:23,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 12:41:23,371 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-12-02 12:41:23,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:41:23,375 INFO L225 Difference]: With dead ends: 1055 [2024-12-02 12:41:23,376 INFO L226 Difference]: Without dead ends: 841 [2024-12-02 12:41:23,377 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-12-02 12:41:23,377 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.1s IncrementalHoareTripleChecker+Time [2024-12-02 12:41:23,378 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.1s Time] [2024-12-02 12:41:23,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2024-12-02 12:41:23,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 436. [2024-12-02 12:41:23,405 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-12-02 12:41:23,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 617 transitions. [2024-12-02 12:41:23,409 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 617 transitions. Word has length 10 [2024-12-02 12:41:23,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:41:23,409 INFO L471 AbstractCegarLoop]: Abstraction has 436 states and 617 transitions. [2024-12-02 12:41:23,409 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-12-02 12:41:23,409 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 617 transitions. [2024-12-02 12:41:23,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-12-02 12:41:23,411 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:41:23,412 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-12-02 12:41:23,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-12-02 12:41:23,412 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-12-02 12:41:23,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:41:23,412 INFO L85 PathProgramCache]: Analyzing trace with hash -128835798, now seen corresponding path program 1 times [2024-12-02 12:41:23,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:41:23,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804075302] [2024-12-02 12:41:23,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:41:23,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:41:23,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:41:23,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 12:41:23,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:41:23,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804075302] [2024-12-02 12:41:23,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804075302] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:41:23,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:41:23,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 12:41:23,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106013719] [2024-12-02 12:41:23,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:41:23,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 12:41:23,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:41:23,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 12:41:23,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 12:41:23,689 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-12-02 12:41:23,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:41:23,794 INFO L93 Difference]: Finished difference Result 825 states and 1163 transitions. [2024-12-02 12:41:23,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 12:41:23,795 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-12-02 12:41:23,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:41:23,797 INFO L225 Difference]: With dead ends: 825 [2024-12-02 12:41:23,797 INFO L226 Difference]: Without dead ends: 393 [2024-12-02 12:41:23,798 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-12-02 12:41:23,799 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-12-02 12:41:23,799 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-12-02 12:41:23,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-12-02 12:41:23,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2024-12-02 12:41:23,812 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-12-02 12:41:23,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 539 transitions. [2024-12-02 12:41:23,815 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 539 transitions. Word has length 67 [2024-12-02 12:41:23,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:41:23,816 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 539 transitions. [2024-12-02 12:41:23,816 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-12-02 12:41:23,816 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 539 transitions. [2024-12-02 12:41:23,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-12-02 12:41:23,817 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:41:23,817 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-12-02 12:41:23,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-12-02 12:41:23,818 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-12-02 12:41:23,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:41:23,818 INFO L85 PathProgramCache]: Analyzing trace with hash 56749342, now seen corresponding path program 1 times [2024-12-02 12:41:23,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:41:23,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388002259] [2024-12-02 12:41:23,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:41:23,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:41:23,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:41:24,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 12:41:24,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:41:24,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388002259] [2024-12-02 12:41:24,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388002259] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:41:24,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:41:24,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 12:41:24,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953290147] [2024-12-02 12:41:24,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:41:24,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 12:41:24,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:41:24,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 12:41:24,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-12-02 12:41:24,323 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-12-02 12:41:24,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:41:24,716 INFO L93 Difference]: Finished difference Result 787 states and 1082 transitions. [2024-12-02 12:41:24,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 12:41:24,717 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-12-02 12:41:24,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:41:24,719 INFO L225 Difference]: With dead ends: 787 [2024-12-02 12:41:24,719 INFO L226 Difference]: Without dead ends: 398 [2024-12-02 12:41:24,720 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-12-02 12:41:24,721 INFO L435 NwaCegarLoop]: 516 mSDtfsCounter, 14 mSDsluCounter, 1767 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2024-12-02 12:41:24,721 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.3s Time] [2024-12-02 12:41:24,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2024-12-02 12:41:24,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 395. [2024-12-02 12:41:24,732 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-12-02 12:41:24,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 541 transitions. [2024-12-02 12:41:24,735 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 541 transitions. Word has length 67 [2024-12-02 12:41:24,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:41:24,736 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 541 transitions. [2024-12-02 12:41:24,736 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-12-02 12:41:24,736 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 541 transitions. [2024-12-02 12:41:24,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-12-02 12:41:24,737 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:41:24,737 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-12-02 12:41:24,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-12-02 12:41:24,737 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-12-02 12:41:24,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:41:24,738 INFO L85 PathProgramCache]: Analyzing trace with hash 626195501, now seen corresponding path program 1 times [2024-12-02 12:41:24,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:41:24,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269912414] [2024-12-02 12:41:24,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:41:24,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:41:24,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:41:25,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 12:41:25,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:41:25,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269912414] [2024-12-02 12:41:25,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269912414] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:41:25,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:41:25,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-12-02 12:41:25,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337327599] [2024-12-02 12:41:25,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:41:25,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-12-02 12:41:25,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:41:25,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-12-02 12:41:25,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-12-02 12:41:25,039 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-12-02 12:41:25,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:41:25,377 INFO L93 Difference]: Finished difference Result 791 states and 1086 transitions. [2024-12-02 12:41:25,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-02 12:41:25,378 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-12-02 12:41:25,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:41:25,380 INFO L225 Difference]: With dead ends: 791 [2024-12-02 12:41:25,380 INFO L226 Difference]: Without dead ends: 400 [2024-12-02 12:41:25,381 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-12-02 12:41:25,382 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.3s IncrementalHoareTripleChecker+Time [2024-12-02 12:41:25,382 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.3s Time] [2024-12-02 12:41:25,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2024-12-02 12:41:25,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 399. [2024-12-02 12:41:25,395 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-12-02 12:41:25,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 546 transitions. [2024-12-02 12:41:25,398 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 546 transitions. Word has length 68 [2024-12-02 12:41:25,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:41:25,399 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 546 transitions. [2024-12-02 12:41:25,399 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-12-02 12:41:25,399 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 546 transitions. [2024-12-02 12:41:25,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-12-02 12:41:25,400 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:41:25,400 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-12-02 12:41:25,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-12-02 12:41:25,401 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-12-02 12:41:25,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:41:25,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1834166079, now seen corresponding path program 1 times [2024-12-02 12:41:25,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:41:25,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044681712] [2024-12-02 12:41:25,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:41:25,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:41:25,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:41:25,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 12:41:25,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:41:25,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044681712] [2024-12-02 12:41:25,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044681712] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:41:25,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:41:25,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 12:41:25,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088134957] [2024-12-02 12:41:25,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:41:25,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 12:41:25,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:41:25,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 12:41:25,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 12:41:25,702 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-12-02 12:41:25,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:41:25,830 INFO L93 Difference]: Finished difference Result 794 states and 1088 transitions. [2024-12-02 12:41:25,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 12:41:25,830 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-12-02 12:41:25,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:41:25,832 INFO L225 Difference]: With dead ends: 794 [2024-12-02 12:41:25,833 INFO L226 Difference]: Without dead ends: 399 [2024-12-02 12:41:25,833 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-12-02 12:41:25,834 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-12-02 12:41:25,834 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-12-02 12:41:25,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2024-12-02 12:41:25,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 399. [2024-12-02 12:41:25,845 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-12-02 12:41:25,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 545 transitions. [2024-12-02 12:41:25,847 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 545 transitions. Word has length 68 [2024-12-02 12:41:25,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:41:25,848 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 545 transitions. [2024-12-02 12:41:25,848 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-12-02 12:41:25,848 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 545 transitions. [2024-12-02 12:41:25,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-12-02 12:41:25,849 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:41:25,849 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-12-02 12:41:25,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-12-02 12:41:25,849 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-12-02 12:41:25,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:41:25,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1342972566, now seen corresponding path program 1 times [2024-12-02 12:41:25,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:41:25,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973684960] [2024-12-02 12:41:25,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:41:25,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:41:25,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:41:26,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 12:41:26,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:41:26,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973684960] [2024-12-02 12:41:26,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973684960] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:41:26,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:41:26,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-12-02 12:41:26,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736625273] [2024-12-02 12:41:26,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:41:26,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-12-02 12:41:26,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:41:26,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-12-02 12:41:26,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-12-02 12:41:26,306 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-12-02 12:41:26,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:41:26,842 INFO L93 Difference]: Finished difference Result 807 states and 1107 transitions. [2024-12-02 12:41:26,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-12-02 12:41:26,843 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-12-02 12:41:26,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:41:26,845 INFO L225 Difference]: With dead ends: 807 [2024-12-02 12:41:26,845 INFO L226 Difference]: Without dead ends: 412 [2024-12-02 12:41:26,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-12-02 12:41:26,846 INFO L435 NwaCegarLoop]: 511 mSDtfsCounter, 34 mSDsluCounter, 3190 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2024-12-02 12:41:26,846 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.4s Time] [2024-12-02 12:41:26,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2024-12-02 12:41:26,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 409. [2024-12-02 12:41:26,857 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-12-02 12:41:26,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 559 transitions. [2024-12-02 12:41:26,859 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 559 transitions. Word has length 69 [2024-12-02 12:41:26,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:41:26,860 INFO L471 AbstractCegarLoop]: Abstraction has 409 states and 559 transitions. [2024-12-02 12:41:26,860 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-12-02 12:41:26,860 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 559 transitions. [2024-12-02 12:41:26,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-12-02 12:41:26,861 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:41:26,861 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-12-02 12:41:26,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-12-02 12:41:26,861 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-12-02 12:41:26,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:41:26,861 INFO L85 PathProgramCache]: Analyzing trace with hash 269698435, now seen corresponding path program 1 times [2024-12-02 12:41:26,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:41:26,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125169954] [2024-12-02 12:41:26,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:41:26,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:41:26,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:41:27,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 12:41:27,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:41:27,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125169954] [2024-12-02 12:41:27,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125169954] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:41:27,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:41:27,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-12-02 12:41:27,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812998644] [2024-12-02 12:41:27,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:41:27,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-12-02 12:41:27,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:41:27,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-12-02 12:41:27,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-12-02 12:41:27,295 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-12-02 12:41:27,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:41:27,686 INFO L93 Difference]: Finished difference Result 817 states and 1119 transitions. [2024-12-02 12:41:27,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-02 12:41:27,688 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-12-02 12:41:27,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:41:27,691 INFO L225 Difference]: With dead ends: 817 [2024-12-02 12:41:27,691 INFO L226 Difference]: Without dead ends: 412 [2024-12-02 12:41:27,691 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-12-02 12:41:27,692 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 27 mSDsluCounter, 2726 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2024-12-02 12:41:27,692 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.3s Time] [2024-12-02 12:41:27,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2024-12-02 12:41:27,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 412. [2024-12-02 12:41:27,703 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-12-02 12:41:27,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 562 transitions. [2024-12-02 12:41:27,706 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 562 transitions. Word has length 69 [2024-12-02 12:41:27,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:41:27,706 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 562 transitions. [2024-12-02 12:41:27,706 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-12-02 12:41:27,706 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 562 transitions. [2024-12-02 12:41:27,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-12-02 12:41:27,707 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:41:27,707 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-12-02 12:41:27,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-12-02 12:41:27,707 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-12-02 12:41:27,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:41:27,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1430997699, now seen corresponding path program 1 times [2024-12-02 12:41:27,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:41:27,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727759667] [2024-12-02 12:41:27,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:41:27,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:41:27,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:41:27,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 12:41:27,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:41:27,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727759667] [2024-12-02 12:41:27,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727759667] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:41:27,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:41:27,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 12:41:27,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917215338] [2024-12-02 12:41:27,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:41:27,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 12:41:27,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:41:27,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 12:41:27,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-12-02 12:41:27,936 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-12-02 12:41:28,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:41:28,185 INFO L93 Difference]: Finished difference Result 823 states and 1125 transitions. [2024-12-02 12:41:28,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 12:41:28,187 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-12-02 12:41:28,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:41:28,189 INFO L225 Difference]: With dead ends: 823 [2024-12-02 12:41:28,189 INFO L226 Difference]: Without dead ends: 415 [2024-12-02 12:41:28,189 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-12-02 12:41:28,190 INFO L435 NwaCegarLoop]: 521 mSDtfsCounter, 8 mSDsluCounter, 1784 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2024-12-02 12:41:28,190 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.2s Time] [2024-12-02 12:41:28,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2024-12-02 12:41:28,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 415. [2024-12-02 12:41:28,201 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-12-02 12:41:28,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 565 transitions. [2024-12-02 12:41:28,203 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 565 transitions. Word has length 69 [2024-12-02 12:41:28,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:41:28,204 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 565 transitions. [2024-12-02 12:41:28,204 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-12-02 12:41:28,204 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 565 transitions. [2024-12-02 12:41:28,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-12-02 12:41:28,204 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:41:28,204 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-12-02 12:41:28,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-12-02 12:41:28,205 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-12-02 12:41:28,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:41:28,205 INFO L85 PathProgramCache]: Analyzing trace with hash -112470928, now seen corresponding path program 1 times [2024-12-02 12:41:28,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:41:28,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578238442] [2024-12-02 12:41:28,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:41:28,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:41:28,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:41:28,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 12:41:28,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:41:28,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578238442] [2024-12-02 12:41:28,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578238442] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:41:28,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:41:28,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-12-02 12:41:28,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207158215] [2024-12-02 12:41:28,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:41:28,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-12-02 12:41:28,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:41:28,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-12-02 12:41:28,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-12-02 12:41:28,750 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-12-02 12:41:29,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:41:29,671 INFO L93 Difference]: Finished difference Result 1209 states and 1655 transitions. [2024-12-02 12:41:29,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-12-02 12:41:29,672 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-12-02 12:41:29,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:41:29,676 INFO L225 Difference]: With dead ends: 1209 [2024-12-02 12:41:29,676 INFO L226 Difference]: Without dead ends: 798 [2024-12-02 12:41:29,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-12-02 12:41:29,677 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-12-02 12:41:29,678 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-12-02 12:41:29,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2024-12-02 12:41:29,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 454. [2024-12-02 12:41:29,697 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-12-02 12:41:29,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 608 transitions. [2024-12-02 12:41:29,700 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 608 transitions. Word has length 70 [2024-12-02 12:41:29,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:41:29,700 INFO L471 AbstractCegarLoop]: Abstraction has 454 states and 608 transitions. [2024-12-02 12:41:29,700 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-12-02 12:41:29,700 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 608 transitions. [2024-12-02 12:41:29,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-12-02 12:41:29,701 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:41:29,701 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-12-02 12:41:29,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-12-02 12:41:29,701 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-12-02 12:41:29,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:41:29,702 INFO L85 PathProgramCache]: Analyzing trace with hash 624259524, now seen corresponding path program 1 times [2024-12-02 12:41:29,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:41:29,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171332423] [2024-12-02 12:41:29,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:41:29,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:41:29,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:41:29,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 12:41:29,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:41:29,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171332423] [2024-12-02 12:41:29,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171332423] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:41:29,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:41:29,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-12-02 12:41:29,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113035798] [2024-12-02 12:41:29,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:41:29,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-12-02 12:41:29,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:41:29,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-12-02 12:41:29,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-12-02 12:41:29,964 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-12-02 12:41:30,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:41:30,320 INFO L93 Difference]: Finished difference Result 870 states and 1177 transitions. [2024-12-02 12:41:30,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-02 12:41:30,321 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-12-02 12:41:30,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:41:30,323 INFO L225 Difference]: With dead ends: 870 [2024-12-02 12:41:30,324 INFO L226 Difference]: Without dead ends: 459 [2024-12-02 12:41:30,324 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-12-02 12:41:30,325 INFO L435 NwaCegarLoop]: 516 mSDtfsCounter, 13 mSDsluCounter, 2230 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2024-12-02 12:41:30,325 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.3s Time] [2024-12-02 12:41:30,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2024-12-02 12:41:30,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 454. [2024-12-02 12:41:30,341 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-12-02 12:41:30,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 608 transitions. [2024-12-02 12:41:30,343 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 608 transitions. Word has length 70 [2024-12-02 12:41:30,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:41:30,344 INFO L471 AbstractCegarLoop]: Abstraction has 454 states and 608 transitions. [2024-12-02 12:41:30,344 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-12-02 12:41:30,344 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 608 transitions. [2024-12-02 12:41:30,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-12-02 12:41:30,344 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:41:30,344 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-12-02 12:41:30,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-12-02 12:41:30,345 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-12-02 12:41:30,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:41:30,345 INFO L85 PathProgramCache]: Analyzing trace with hash 754738639, now seen corresponding path program 1 times [2024-12-02 12:41:30,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:41:30,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783595590] [2024-12-02 12:41:30,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:41:30,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:41:30,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:41:30,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 12:41:30,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:41:30,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783595590] [2024-12-02 12:41:30,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783595590] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:41:30,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:41:30,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-12-02 12:41:30,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196532278] [2024-12-02 12:41:30,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:41:30,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-12-02 12:41:30,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:41:30,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-12-02 12:41:30,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-12-02 12:41:30,626 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-12-02 12:41:30,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:41:30,926 INFO L93 Difference]: Finished difference Result 875 states and 1183 transitions. [2024-12-02 12:41:30,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-12-02 12:41:30,926 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-12-02 12:41:30,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:41:30,929 INFO L225 Difference]: With dead ends: 875 [2024-12-02 12:41:30,929 INFO L226 Difference]: Without dead ends: 464 [2024-12-02 12:41:30,930 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-12-02 12:41:30,931 INFO L435 NwaCegarLoop]: 510 mSDtfsCounter, 20 mSDsluCounter, 2333 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-12-02 12:41:30,931 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-12-02 12:41:30,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2024-12-02 12:41:30,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 457. [2024-12-02 12:41:30,946 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-12-02 12:41:30,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 612 transitions. [2024-12-02 12:41:30,948 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 612 transitions. Word has length 71 [2024-12-02 12:41:30,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:41:30,949 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 612 transitions. [2024-12-02 12:41:30,949 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-12-02 12:41:30,949 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 612 transitions. [2024-12-02 12:41:30,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-12-02 12:41:30,950 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:41:30,950 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-12-02 12:41:30,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-12-02 12:41:30,950 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-12-02 12:41:30,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:41:30,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1402987853, now seen corresponding path program 1 times [2024-12-02 12:41:30,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:41:30,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199911171] [2024-12-02 12:41:30,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:41:30,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:41:30,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:41:31,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 12:41:31,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:41:31,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199911171] [2024-12-02 12:41:31,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199911171] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:41:31,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:41:31,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-12-02 12:41:31,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693405637] [2024-12-02 12:41:31,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:41:31,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-12-02 12:41:31,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:41:31,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-12-02 12:41:31,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-12-02 12:41:31,243 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-12-02 12:41:31,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:41:31,742 INFO L93 Difference]: Finished difference Result 893 states and 1203 transitions. [2024-12-02 12:41:31,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-12-02 12:41:31,743 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-12-02 12:41:31,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:41:31,745 INFO L225 Difference]: With dead ends: 893 [2024-12-02 12:41:31,745 INFO L226 Difference]: Without dead ends: 479 [2024-12-02 12:41:31,746 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-12-02 12:41:31,746 INFO L435 NwaCegarLoop]: 522 mSDtfsCounter, 38 mSDsluCounter, 3156 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2024-12-02 12:41:31,746 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.4s Time] [2024-12-02 12:41:31,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2024-12-02 12:41:31,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 457. [2024-12-02 12:41:31,769 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-12-02 12:41:31,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 612 transitions. [2024-12-02 12:41:31,770 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 612 transitions. Word has length 71 [2024-12-02 12:41:31,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:41:31,770 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 612 transitions. [2024-12-02 12:41:31,771 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-12-02 12:41:31,771 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 612 transitions. [2024-12-02 12:41:31,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-12-02 12:41:31,771 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:41:31,771 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-12-02 12:41:31,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-12-02 12:41:31,771 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-12-02 12:41:31,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:41:31,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1758437004, now seen corresponding path program 1 times [2024-12-02 12:41:31,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:41:31,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713747309] [2024-12-02 12:41:31,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:41:31,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:41:31,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:41:32,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 12:41:32,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:41:32,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713747309] [2024-12-02 12:41:32,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713747309] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:41:32,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:41:32,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-12-02 12:41:32,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812413511] [2024-12-02 12:41:32,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:41:32,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-12-02 12:41:32,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:41:32,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-12-02 12:41:32,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-12-02 12:41:32,068 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-12-02 12:41:32,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:41:32,505 INFO L93 Difference]: Finished difference Result 887 states and 1200 transitions. [2024-12-02 12:41:32,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-12-02 12:41:32,506 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-12-02 12:41:32,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:41:32,508 INFO L225 Difference]: With dead ends: 887 [2024-12-02 12:41:32,509 INFO L226 Difference]: Without dead ends: 473 [2024-12-02 12:41:32,509 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-12-02 12:41:32,510 INFO L435 NwaCegarLoop]: 517 mSDtfsCounter, 26 mSDsluCounter, 3175 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2024-12-02 12:41:32,510 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.4s Time] [2024-12-02 12:41:32,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2024-12-02 12:41:32,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 467. [2024-12-02 12:41:32,520 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-12-02 12:41:32,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 624 transitions. [2024-12-02 12:41:32,522 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 624 transitions. Word has length 72 [2024-12-02 12:41:32,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:41:32,522 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 624 transitions. [2024-12-02 12:41:32,522 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-12-02 12:41:32,522 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 624 transitions. [2024-12-02 12:41:32,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-12-02 12:41:32,523 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:41:32,523 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-12-02 12:41:32,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-12-02 12:41:32,524 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-12-02 12:41:32,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:41:32,524 INFO L85 PathProgramCache]: Analyzing trace with hash 71518480, now seen corresponding path program 1 times [2024-12-02 12:41:32,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:41:32,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763189804] [2024-12-02 12:41:32,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:41:32,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:41:32,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:41:32,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 12:41:32,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:41:32,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763189804] [2024-12-02 12:41:32,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763189804] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:41:32,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:41:32,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-12-02 12:41:32,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802032666] [2024-12-02 12:41:32,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:41:32,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-12-02 12:41:32,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:41:32,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-12-02 12:41:32,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-12-02 12:41:32,765 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-12-02 12:41:33,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:41:33,216 INFO L93 Difference]: Finished difference Result 907 states and 1224 transitions. [2024-12-02 12:41:33,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-12-02 12:41:33,217 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-12-02 12:41:33,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:41:33,219 INFO L225 Difference]: With dead ends: 907 [2024-12-02 12:41:33,219 INFO L226 Difference]: Without dead ends: 483 [2024-12-02 12:41:33,220 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-12-02 12:41:33,220 INFO L435 NwaCegarLoop]: 503 mSDtfsCounter, 17 mSDsluCounter, 3620 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2024-12-02 12:41:33,220 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.4s Time] [2024-12-02 12:41:33,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2024-12-02 12:41:33,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 470. [2024-12-02 12:41:33,232 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-12-02 12:41:33,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 628 transitions. [2024-12-02 12:41:33,234 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 628 transitions. Word has length 72 [2024-12-02 12:41:33,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:41:33,234 INFO L471 AbstractCegarLoop]: Abstraction has 470 states and 628 transitions. [2024-12-02 12:41:33,234 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-12-02 12:41:33,234 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 628 transitions. [2024-12-02 12:41:33,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-12-02 12:41:33,234 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:41:33,234 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-12-02 12:41:33,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-12-02 12:41:33,235 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-12-02 12:41:33,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:41:33,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1426534256, now seen corresponding path program 1 times [2024-12-02 12:41:33,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:41:33,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653843797] [2024-12-02 12:41:33,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:41:33,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:41:33,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:41:33,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 12:41:33,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:41:33,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653843797] [2024-12-02 12:41:33,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653843797] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:41:33,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:41:33,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-12-02 12:41:33,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728815027] [2024-12-02 12:41:33,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:41:33,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-12-02 12:41:33,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:41:33,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-12-02 12:41:33,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-12-02 12:41:33,436 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-12-02 12:41:33,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:41:33,728 INFO L93 Difference]: Finished difference Result 902 states and 1214 transitions. [2024-12-02 12:41:33,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-02 12:41:33,729 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-12-02 12:41:33,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:41:33,731 INFO L225 Difference]: With dead ends: 902 [2024-12-02 12:41:33,731 INFO L226 Difference]: Without dead ends: 475 [2024-12-02 12:41:33,731 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-12-02 12:41:33,732 INFO L435 NwaCegarLoop]: 511 mSDtfsCounter, 11 mSDsluCounter, 2259 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.3s IncrementalHoareTripleChecker+Time [2024-12-02 12:41:33,732 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.3s Time] [2024-12-02 12:41:33,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2024-12-02 12:41:33,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 470. [2024-12-02 12:41:33,741 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-12-02 12:41:33,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 627 transitions. [2024-12-02 12:41:33,742 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 627 transitions. Word has length 72 [2024-12-02 12:41:33,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:41:33,743 INFO L471 AbstractCegarLoop]: Abstraction has 470 states and 627 transitions. [2024-12-02 12:41:33,743 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-12-02 12:41:33,743 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 627 transitions. [2024-12-02 12:41:33,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-12-02 12:41:33,743 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:41:33,743 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-12-02 12:41:33,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-12-02 12:41:33,744 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-12-02 12:41:33,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:41:33,744 INFO L85 PathProgramCache]: Analyzing trace with hash 186136745, now seen corresponding path program 1 times [2024-12-02 12:41:33,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:41:33,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28772951] [2024-12-02 12:41:33,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:41:33,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:41:33,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:41:33,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 12:41:33,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:41:33,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28772951] [2024-12-02 12:41:33,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28772951] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:41:33,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:41:33,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-12-02 12:41:33,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894183995] [2024-12-02 12:41:33,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:41:33,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-12-02 12:41:33,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:41:33,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-12-02 12:41:33,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-12-02 12:41:33,913 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-12-02 12:41:34,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:41:34,229 INFO L93 Difference]: Finished difference Result 900 states and 1212 transitions. [2024-12-02 12:41:34,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-02 12:41:34,229 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-12-02 12:41:34,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:41:34,232 INFO L225 Difference]: With dead ends: 900 [2024-12-02 12:41:34,232 INFO L226 Difference]: Without dead ends: 473 [2024-12-02 12:41:34,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-12-02 12:41:34,233 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 8 mSDsluCounter, 2214 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2024-12-02 12:41:34,233 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.3s Time] [2024-12-02 12:41:34,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2024-12-02 12:41:34,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 473. [2024-12-02 12:41:34,242 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-12-02 12:41:34,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 630 transitions. [2024-12-02 12:41:34,243 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 630 transitions. Word has length 72 [2024-12-02 12:41:34,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:41:34,244 INFO L471 AbstractCegarLoop]: Abstraction has 473 states and 630 transitions. [2024-12-02 12:41:34,244 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-12-02 12:41:34,244 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 630 transitions. [2024-12-02 12:41:34,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-12-02 12:41:34,244 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:41:34,245 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-12-02 12:41:34,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-12-02 12:41:34,245 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-12-02 12:41:34,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:41:34,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1157474350, now seen corresponding path program 1 times [2024-12-02 12:41:34,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:41:34,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315526732] [2024-12-02 12:41:34,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:41:34,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:41:34,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:41:34,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 12:41:34,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:41:34,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315526732] [2024-12-02 12:41:34,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315526732] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:41:34,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:41:34,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-12-02 12:41:34,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096184126] [2024-12-02 12:41:34,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:41:34,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-12-02 12:41:34,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:41:34,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-12-02 12:41:34,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-12-02 12:41:34,555 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-12-02 12:41:35,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:41:35,174 INFO L93 Difference]: Finished difference Result 915 states and 1231 transitions. [2024-12-02 12:41:35,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-12-02 12:41:35,175 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-12-02 12:41:35,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:41:35,177 INFO L225 Difference]: With dead ends: 915 [2024-12-02 12:41:35,177 INFO L226 Difference]: Without dead ends: 485 [2024-12-02 12:41:35,178 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-12-02 12:41:35,179 INFO L435 NwaCegarLoop]: 514 mSDtfsCounter, 13 mSDsluCounter, 3168 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2024-12-02 12:41:35,179 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.6s Time] [2024-12-02 12:41:35,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2024-12-02 12:41:35,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 477. [2024-12-02 12:41:35,189 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-12-02 12:41:35,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 635 transitions. [2024-12-02 12:41:35,190 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 635 transitions. Word has length 73 [2024-12-02 12:41:35,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:41:35,191 INFO L471 AbstractCegarLoop]: Abstraction has 477 states and 635 transitions. [2024-12-02 12:41:35,191 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-12-02 12:41:35,191 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 635 transitions. [2024-12-02 12:41:35,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-12-02 12:41:35,191 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:41:35,192 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-12-02 12:41:35,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-12-02 12:41:35,192 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-12-02 12:41:35,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:41:35,192 INFO L85 PathProgramCache]: Analyzing trace with hash 771099327, now seen corresponding path program 1 times [2024-12-02 12:41:35,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:41:35,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622684601] [2024-12-02 12:41:35,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:41:35,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:41:35,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:41:35,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 12:41:35,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:41:35,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622684601] [2024-12-02 12:41:35,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622684601] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:41:35,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:41:35,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-12-02 12:41:35,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684071327] [2024-12-02 12:41:35,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:41:35,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-12-02 12:41:35,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:41:35,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-12-02 12:41:35,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-12-02 12:41:35,440 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-12-02 12:41:35,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:41:35,912 INFO L93 Difference]: Finished difference Result 924 states and 1241 transitions. [2024-12-02 12:41:35,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-12-02 12:41:35,913 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-12-02 12:41:35,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:41:35,915 INFO L225 Difference]: With dead ends: 924 [2024-12-02 12:41:35,916 INFO L226 Difference]: Without dead ends: 490 [2024-12-02 12:41:35,916 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-12-02 12:41:35,917 INFO L435 NwaCegarLoop]: 511 mSDtfsCounter, 40 mSDsluCounter, 3642 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2024-12-02 12:41:35,917 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.4s Time] [2024-12-02 12:41:35,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2024-12-02 12:41:35,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 480. [2024-12-02 12:41:35,933 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-12-02 12:41:35,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 638 transitions. [2024-12-02 12:41:35,936 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 638 transitions. Word has length 73 [2024-12-02 12:41:35,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:41:35,936 INFO L471 AbstractCegarLoop]: Abstraction has 480 states and 638 transitions. [2024-12-02 12:41:35,936 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-12-02 12:41:35,936 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 638 transitions. [2024-12-02 12:41:35,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-12-02 12:41:35,937 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:41:35,937 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-12-02 12:41:35,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-12-02 12:41:35,937 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-12-02 12:41:35,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:41:35,938 INFO L85 PathProgramCache]: Analyzing trace with hash -263429194, now seen corresponding path program 1 times [2024-12-02 12:41:35,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:41:35,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658041358] [2024-12-02 12:41:35,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:41:35,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:41:35,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:41:36,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 12:41:36,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:41:36,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658041358] [2024-12-02 12:41:36,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658041358] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:41:36,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:41:36,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-12-02 12:41:36,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830707381] [2024-12-02 12:41:36,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:41:36,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-12-02 12:41:36,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:41:36,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-12-02 12:41:36,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-12-02 12:41:36,450 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-12-02 12:41:38,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-02 12:41:39,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:41:39,223 INFO L93 Difference]: Finished difference Result 935 states and 1249 transitions. [2024-12-02 12:41:39,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-12-02 12:41:39,224 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-12-02 12:41:39,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:41:39,226 INFO L225 Difference]: With dead ends: 935 [2024-12-02 12:41:39,226 INFO L226 Difference]: Without dead ends: 498 [2024-12-02 12:41:39,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-12-02 12:41:39,227 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 45 mSDsluCounter, 3582 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 4097 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-12-02 12:41:39,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 4097 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-12-02 12:41:39,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2024-12-02 12:41:39,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 481. [2024-12-02 12:41:39,240 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-12-02 12:41:39,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 639 transitions. [2024-12-02 12:41:39,241 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 639 transitions. Word has length 73 [2024-12-02 12:41:39,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:41:39,241 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 639 transitions. [2024-12-02 12:41:39,241 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-12-02 12:41:39,242 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 639 transitions. [2024-12-02 12:41:39,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-12-02 12:41:39,242 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:41:39,242 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-12-02 12:41:39,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-12-02 12:41:39,243 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-12-02 12:41:39,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:41:39,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1592083978, now seen corresponding path program 1 times [2024-12-02 12:41:39,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:41:39,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978926813] [2024-12-02 12:41:39,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:41:39,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:41:39,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:41:57,156 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-12-02 12:41:57,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 12:41:57,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:41:57,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978926813] [2024-12-02 12:41:57,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978926813] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:41:57,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:41:57,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-12-02 12:41:57,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245331770] [2024-12-02 12:41:57,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:41:57,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-12-02 12:41:57,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:41:57,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-12-02 12:41:57,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=72, Unknown=1, NotChecked=16, Total=110 [2024-12-02 12:41:57,235 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-12-02 12:42:01,483 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-12-02 12:42:05,487 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-12-02 12:42:09,494 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-12-02 12:42:13,713 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-12-02 12:42:17,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-02 12:42:21,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-02 12:42:25,722 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-12-02 12:42:29,724 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-12-02 12:42:33,731 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-12-02 12:42:37,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-02 12:42:40,635 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.79s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-02 12:42:44,638 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-12-02 12:42:48,641 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-12-02 12:42:52,644 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-12-02 12:42:56,647 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-12-02 12:43:00,651 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-12-02 12:43:05,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.65s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-02 12:43:09,101 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-12-02 12:43:11,306 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-02 12:43:15,311 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-12-02 12:43:40,043 WARN L286 SmtUtils]: Spent 16.70s 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-12-02 12:43:44,076 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-12-02 12:43:48,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-02 12:43:52,082 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-12-02 12:43:56,742 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-12-02 12:44:00,745 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-12-02 12:44:04,748 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-12-02 12:44:08,750 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-12-02 12:44:12,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.95s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-02 12:44:16,698 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-12-02 12:44:20,701 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-12-02 12:44:21,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:44:21,030 INFO L93 Difference]: Finished difference Result 946 states and 1273 transitions. [2024-12-02 12:44:21,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-12-02 12:44:21,030 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-12-02 12:44:21,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:44:21,033 INFO L225 Difference]: With dead ends: 946 [2024-12-02 12:44:21,033 INFO L226 Difference]: Without dead ends: 508 [2024-12-02 12:44:21,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 36.9s TimeCoverageRelationStatistics Valid=27, Invalid=87, Unknown=4, NotChecked=38, Total=156 [2024-12-02 12:44:21,035 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 52 mSDsluCounter, 3154 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 3 mSolverCounterUnsat, 25 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 114.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 3669 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 25 IncrementalHoareTripleChecker+Unknown, 155 IncrementalHoareTripleChecker+Unchecked, 115.0s IncrementalHoareTripleChecker+Time [2024-12-02 12:44:21,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 3669 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 688 Invalid, 25 Unknown, 155 Unchecked, 115.0s Time] [2024-12-02 12:44:21,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2024-12-02 12:44:21,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 487. [2024-12-02 12:44:21,049 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-12-02 12:44:21,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 647 transitions. [2024-12-02 12:44:21,052 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 647 transitions. Word has length 73 [2024-12-02 12:44:21,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:44:21,052 INFO L471 AbstractCegarLoop]: Abstraction has 487 states and 647 transitions. [2024-12-02 12:44:21,052 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-12-02 12:44:21,052 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 647 transitions. [2024-12-02 12:44:21,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-12-02 12:44:21,053 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:44:21,053 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-12-02 12:44:21,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-12-02 12:44:21,053 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-12-02 12:44:21,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:44:21,053 INFO L85 PathProgramCache]: Analyzing trace with hash -2099892114, now seen corresponding path program 1 times [2024-12-02 12:44:21,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:44:21,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833945924] [2024-12-02 12:44:21,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:44:21,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:44:21,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:44:21,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 12:44:21,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:44:21,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833945924] [2024-12-02 12:44:21,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833945924] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:44:21,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:44:21,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-12-02 12:44:21,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374667364] [2024-12-02 12:44:21,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:44:21,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-12-02 12:44:21,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:44:21,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-12-02 12:44:21,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-12-02 12:44:21,321 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-12-02 12:44:21,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:44:21,828 INFO L93 Difference]: Finished difference Result 952 states and 1272 transitions. [2024-12-02 12:44:21,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-12-02 12:44:21,831 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-12-02 12:44:21,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:44:21,833 INFO L225 Difference]: With dead ends: 952 [2024-12-02 12:44:21,833 INFO L226 Difference]: Without dead ends: 508 [2024-12-02 12:44:21,834 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-12-02 12:44:21,836 INFO L435 NwaCegarLoop]: 522 mSDtfsCounter, 34 mSDsluCounter, 3156 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2024-12-02 12:44:21,836 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.4s Time] [2024-12-02 12:44:21,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2024-12-02 12:44:21,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 484. [2024-12-02 12:44:21,850 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-12-02 12:44:21,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 644 transitions. [2024-12-02 12:44:21,852 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 644 transitions. Word has length 73 [2024-12-02 12:44:21,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:44:21,853 INFO L471 AbstractCegarLoop]: Abstraction has 484 states and 644 transitions. [2024-12-02 12:44:21,853 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-12-02 12:44:21,853 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 644 transitions. [2024-12-02 12:44:21,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-12-02 12:44:21,853 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:44:21,853 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-12-02 12:44:21,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-12-02 12:44:21,854 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-12-02 12:44:21,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:44:21,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1327027261, now seen corresponding path program 1 times [2024-12-02 12:44:21,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:44:21,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233914463] [2024-12-02 12:44:21,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:44:21,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:44:21,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:44:22,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 12:44:22,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:44:22,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233914463] [2024-12-02 12:44:22,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233914463] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:44:22,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:44:22,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-12-02 12:44:22,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373012518] [2024-12-02 12:44:22,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:44:22,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-12-02 12:44:22,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:44:22,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-12-02 12:44:22,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-12-02 12:44:22,223 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-12-02 12:44:22,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:44:22,727 INFO L93 Difference]: Finished difference Result 937 states and 1259 transitions. [2024-12-02 12:44:22,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-12-02 12:44:22,727 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-12-02 12:44:22,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:44:22,729 INFO L225 Difference]: With dead ends: 937 [2024-12-02 12:44:22,729 INFO L226 Difference]: Without dead ends: 496 [2024-12-02 12:44:22,729 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-12-02 12:44:22,729 INFO L435 NwaCegarLoop]: 514 mSDtfsCounter, 16 mSDsluCounter, 4085 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 4599 SdHoareTripleChecker+Invalid, 866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-12-02 12:44:22,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 4599 Invalid, 866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-12-02 12:44:22,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2024-12-02 12:44:22,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 491. [2024-12-02 12:44:22,738 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-12-02 12:44:22,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 653 transitions. [2024-12-02 12:44:22,739 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 653 transitions. Word has length 74 [2024-12-02 12:44:22,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:44:22,739 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 653 transitions. [2024-12-02 12:44:22,739 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-12-02 12:44:22,739 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 653 transitions. [2024-12-02 12:44:22,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-12-02 12:44:22,740 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:44:22,740 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-12-02 12:44:22,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-12-02 12:44:22,740 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-12-02 12:44:22,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:44:22,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1382843083, now seen corresponding path program 1 times [2024-12-02 12:44:22,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:44:22,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42440115] [2024-12-02 12:44:22,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:44:22,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:44:22,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:44:23,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 12:44:23,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:44:23,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42440115] [2024-12-02 12:44:23,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42440115] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:44:23,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:44:23,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-12-02 12:44:23,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53419386] [2024-12-02 12:44:23,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:44:23,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-12-02 12:44:23,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:44:23,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-12-02 12:44:23,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-12-02 12:44:23,027 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-12-02 12:44:23,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:44:23,396 INFO L93 Difference]: Finished difference Result 944 states and 1267 transitions. [2024-12-02 12:44:23,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-02 12:44:23,396 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-12-02 12:44:23,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:44:23,399 INFO L225 Difference]: With dead ends: 944 [2024-12-02 12:44:23,399 INFO L226 Difference]: Without dead ends: 496 [2024-12-02 12:44:23,399 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-12-02 12:44:23,400 INFO L435 NwaCegarLoop]: 518 mSDtfsCounter, 37 mSDsluCounter, 2748 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 3266 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-12-02 12:44:23,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 3266 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-12-02 12:44:23,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2024-12-02 12:44:23,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 488. [2024-12-02 12:44:23,414 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-12-02 12:44:23,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 649 transitions. [2024-12-02 12:44:23,416 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 649 transitions. Word has length 74 [2024-12-02 12:44:23,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:44:23,416 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 649 transitions. [2024-12-02 12:44:23,417 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-12-02 12:44:23,417 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 649 transitions. [2024-12-02 12:44:23,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-12-02 12:44:23,417 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:44:23,417 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-12-02 12:44:23,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-12-02 12:44:23,418 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-12-02 12:44:23,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:44:23,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1084753645, now seen corresponding path program 1 times [2024-12-02 12:44:23,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:44:23,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533370285] [2024-12-02 12:44:23,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:44:23,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:44:23,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:44:23,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 12:44:23,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:44:23,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533370285] [2024-12-02 12:44:23,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533370285] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:44:23,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:44:23,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-12-02 12:44:23,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242667884] [2024-12-02 12:44:23,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:44:23,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-12-02 12:44:23,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:44:23,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-12-02 12:44:23,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-12-02 12:44:23,664 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-12-02 12:44:23,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:44:23,947 INFO L93 Difference]: Finished difference Result 934 states and 1252 transitions. [2024-12-02 12:44:23,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-02 12:44:23,948 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-12-02 12:44:23,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:44:23,950 INFO L225 Difference]: With dead ends: 934 [2024-12-02 12:44:23,950 INFO L226 Difference]: Without dead ends: 489 [2024-12-02 12:44:23,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-12-02 12:44:23,951 INFO L435 NwaCegarLoop]: 521 mSDtfsCounter, 53 mSDsluCounter, 2300 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2024-12-02 12:44:23,951 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.2s Time] [2024-12-02 12:44:23,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2024-12-02 12:44:23,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 485. [2024-12-02 12:44:23,965 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-12-02 12:44:23,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 645 transitions. [2024-12-02 12:44:23,967 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 645 transitions. Word has length 74 [2024-12-02 12:44:23,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:44:23,967 INFO L471 AbstractCegarLoop]: Abstraction has 485 states and 645 transitions. [2024-12-02 12:44:23,967 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-12-02 12:44:23,967 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 645 transitions. [2024-12-02 12:44:23,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-12-02 12:44:23,968 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:44:23,968 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-12-02 12:44:23,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-12-02 12:44:23,969 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-12-02 12:44:23,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:44:23,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1416685997, now seen corresponding path program 1 times [2024-12-02 12:44:23,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:44:23,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606758581] [2024-12-02 12:44:23,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:44:23,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:44:24,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:44:24,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 12:44:24,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:44:24,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606758581] [2024-12-02 12:44:24,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606758581] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:44:24,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:44:24,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-12-02 12:44:24,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766198308] [2024-12-02 12:44:24,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:44:24,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-12-02 12:44:24,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:44:24,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-12-02 12:44:24,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-12-02 12:44:24,421 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-12-02 12:44:25,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:44:25,519 INFO L93 Difference]: Finished difference Result 943 states and 1268 transitions. [2024-12-02 12:44:25,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-12-02 12:44:25,520 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-12-02 12:44:25,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:44:25,522 INFO L225 Difference]: With dead ends: 943 [2024-12-02 12:44:25,522 INFO L226 Difference]: Without dead ends: 501 [2024-12-02 12:44:25,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-12-02 12:44:25,523 INFO L435 NwaCegarLoop]: 497 mSDtfsCounter, 18 mSDsluCounter, 4489 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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, 1.1s IncrementalHoareTripleChecker+Time [2024-12-02 12:44:25,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 4986 Invalid, 885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-12-02 12:44:25,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2024-12-02 12:44:25,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 486. [2024-12-02 12:44:25,537 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-12-02 12:44:25,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 646 transitions. [2024-12-02 12:44:25,539 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 646 transitions. Word has length 74 [2024-12-02 12:44:25,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:44:25,539 INFO L471 AbstractCegarLoop]: Abstraction has 486 states and 646 transitions. [2024-12-02 12:44:25,539 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-12-02 12:44:25,539 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 646 transitions. [2024-12-02 12:44:25,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-12-02 12:44:25,540 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:44:25,540 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-12-02 12:44:25,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-12-02 12:44:25,540 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-12-02 12:44:25,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:44:25,540 INFO L85 PathProgramCache]: Analyzing trace with hash -182846351, now seen corresponding path program 1 times [2024-12-02 12:44:25,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:44:25,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565531629] [2024-12-02 12:44:25,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:44:25,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:44:25,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:44:26,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 12:44:26,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:44:26,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565531629] [2024-12-02 12:44:26,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565531629] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:44:26,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:44:26,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-12-02 12:44:26,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415072973] [2024-12-02 12:44:26,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:44:26,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-12-02 12:44:26,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:44:26,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-12-02 12:44:26,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2024-12-02 12:44:26,028 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-12-02 12:44:27,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:44:27,136 INFO L93 Difference]: Finished difference Result 961 states and 1288 transitions. [2024-12-02 12:44:27,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-12-02 12:44:27,137 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-12-02 12:44:27,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:44:27,138 INFO L225 Difference]: With dead ends: 961 [2024-12-02 12:44:27,139 INFO L226 Difference]: Without dead ends: 518 [2024-12-02 12:44:27,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2024-12-02 12:44:27,139 INFO L435 NwaCegarLoop]: 506 mSDtfsCounter, 47 mSDsluCounter, 4987 mSDsCounter, 0 mSdLazyCounter, 1052 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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, 1.1s IncrementalHoareTripleChecker+Time [2024-12-02 12:44:27,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 5493 Invalid, 1053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1052 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-12-02 12:44:27,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2024-12-02 12:44:27,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 495. [2024-12-02 12:44:27,147 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-12-02 12:44:27,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 658 transitions. [2024-12-02 12:44:27,148 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 658 transitions. Word has length 74 [2024-12-02 12:44:27,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:44:27,149 INFO L471 AbstractCegarLoop]: Abstraction has 495 states and 658 transitions. [2024-12-02 12:44:27,149 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-12-02 12:44:27,149 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 658 transitions. [2024-12-02 12:44:27,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-12-02 12:44:27,149 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:44:27,149 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-12-02 12:44:27,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-12-02 12:44:27,150 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-12-02 12:44:27,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:44:27,150 INFO L85 PathProgramCache]: Analyzing trace with hash 663989509, now seen corresponding path program 1 times [2024-12-02 12:44:27,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:44:27,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084460865] [2024-12-02 12:44:27,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:44:27,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:44:27,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:44:29,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 12:44:29,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:44:29,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084460865] [2024-12-02 12:44:29,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084460865] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:44:29,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:44:29,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-12-02 12:44:29,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060842079] [2024-12-02 12:44:29,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:44:29,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-12-02 12:44:29,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:44:29,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-12-02 12:44:29,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-12-02 12:44:29,796 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-12-02 12:44:31,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:44:31,646 INFO L93 Difference]: Finished difference Result 1019 states and 1370 transitions. [2024-12-02 12:44:31,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-12-02 12:44:31,646 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-12-02 12:44:31,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:44:31,648 INFO L225 Difference]: With dead ends: 1019 [2024-12-02 12:44:31,648 INFO L226 Difference]: Without dead ends: 567 [2024-12-02 12:44:31,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-12-02 12:44:31,649 INFO L435 NwaCegarLoop]: 571 mSDtfsCounter, 112 mSDsluCounter, 4515 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 5086 SdHoareTripleChecker+Invalid, 976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-12-02 12:44:31,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 5086 Invalid, 976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 969 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-12-02 12:44:31,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2024-12-02 12:44:31,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 496. [2024-12-02 12:44:31,662 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-12-02 12:44:31,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 660 transitions. [2024-12-02 12:44:31,664 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 660 transitions. Word has length 74 [2024-12-02 12:44:31,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:44:31,664 INFO L471 AbstractCegarLoop]: Abstraction has 496 states and 660 transitions. [2024-12-02 12:44:31,664 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-12-02 12:44:31,664 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 660 transitions. [2024-12-02 12:44:31,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-12-02 12:44:31,664 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:44:31,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] [2024-12-02 12:44:31,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-12-02 12:44:31,665 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-12-02 12:44:31,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:44:31,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1570535271, now seen corresponding path program 1 times [2024-12-02 12:44:31,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:44:31,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727806786] [2024-12-02 12:44:31,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:44:31,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:44:31,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:44:32,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 12:44:32,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:44:32,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727806786] [2024-12-02 12:44:32,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727806786] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:44:32,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:44:32,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-12-02 12:44:32,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052872840] [2024-12-02 12:44:32,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:44:32,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-12-02 12:44:32,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:44:32,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-12-02 12:44:32,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-12-02 12:44:32,498 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-12-02 12:44:36,732 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-12-02 12:44:40,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.30s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-02 12:44:44,164 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-12-02 12:44:48,167 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-12-02 12:44:51,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.94s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-02 12:44:55,110 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-12-02 12:44:59,113 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-12-02 12:45:01,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.57s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-02 12:45:05,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.22s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-02 12:45:05,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:45:05,552 INFO L93 Difference]: Finished difference Result 970 states and 1303 transitions. [2024-12-02 12:45:05,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-12-02 12:45:05,553 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-12-02 12:45:05,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:45:05,554 INFO L225 Difference]: With dead ends: 970 [2024-12-02 12:45:05,554 INFO L226 Difference]: Without dead ends: 517 [2024-12-02 12:45:05,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-12-02 12:45:05,554 INFO L435 NwaCegarLoop]: 504 mSDtfsCounter, 82 mSDsluCounter, 3137 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 9 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 3641 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.0s IncrementalHoareTripleChecker+Time [2024-12-02 12:45:05,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 3641 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 639 Invalid, 5 Unknown, 0 Unchecked, 33.0s Time] [2024-12-02 12:45:05,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2024-12-02 12:45:05,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 496. [2024-12-02 12:45:05,562 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-12-02 12:45:05,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 660 transitions. [2024-12-02 12:45:05,563 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 660 transitions. Word has length 74 [2024-12-02 12:45:05,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:45:05,563 INFO L471 AbstractCegarLoop]: Abstraction has 496 states and 660 transitions. [2024-12-02 12:45:05,563 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-12-02 12:45:05,563 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 660 transitions. [2024-12-02 12:45:05,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-12-02 12:45:05,563 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:45:05,564 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-12-02 12:45:05,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-12-02 12:45:05,564 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-12-02 12:45:05,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:45:05,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1465200851, now seen corresponding path program 1 times [2024-12-02 12:45:05,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:45:05,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458026629] [2024-12-02 12:45:05,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:45:05,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:45:05,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:45:05,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 12:45:05,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:45:05,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458026629] [2024-12-02 12:45:05,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458026629] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:45:05,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:45:05,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-12-02 12:45:05,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235558146] [2024-12-02 12:45:05,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:45:05,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-12-02 12:45:05,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:45:05,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-12-02 12:45:05,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-12-02 12:45:05,734 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-12-02 12:45:06,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:45:06,146 INFO L93 Difference]: Finished difference Result 983 states and 1315 transitions. [2024-12-02 12:45:06,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-12-02 12:45:06,147 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-12-02 12:45:06,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:45:06,148 INFO L225 Difference]: With dead ends: 983 [2024-12-02 12:45:06,148 INFO L226 Difference]: Without dead ends: 530 [2024-12-02 12:45:06,149 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-12-02 12:45:06,149 INFO L435 NwaCegarLoop]: 518 mSDtfsCounter, 99 mSDsluCounter, 2248 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 2766 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-12-02 12:45:06,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 2766 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-12-02 12:45:06,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2024-12-02 12:45:06,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 492. [2024-12-02 12:45:06,158 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-12-02 12:45:06,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 656 transitions. [2024-12-02 12:45:06,160 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 656 transitions. Word has length 74 [2024-12-02 12:45:06,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:45:06,160 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 656 transitions. [2024-12-02 12:45:06,160 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-12-02 12:45:06,161 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 656 transitions. [2024-12-02 12:45:06,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-12-02 12:45:06,161 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:45:06,161 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-12-02 12:45:06,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-12-02 12:45:06,162 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-12-02 12:45:06,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:45:06,162 INFO L85 PathProgramCache]: Analyzing trace with hash -57677131, now seen corresponding path program 1 times [2024-12-02 12:45:06,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:45:06,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713125156] [2024-12-02 12:45:06,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:45:06,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:45:06,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:45:06,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 12:45:06,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:45:06,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713125156] [2024-12-02 12:45:06,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713125156] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:45:06,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:45:06,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-12-02 12:45:06,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588653635] [2024-12-02 12:45:06,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:45:06,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-12-02 12:45:06,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:45:06,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-12-02 12:45:06,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-12-02 12:45:06,369 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-12-02 12:45:10,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.66s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-02 12:45:10,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:45:10,439 INFO L93 Difference]: Finished difference Result 960 states and 1288 transitions. [2024-12-02 12:45:10,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-12-02 12:45:10,439 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-12-02 12:45:10,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:45:10,441 INFO L225 Difference]: With dead ends: 960 [2024-12-02 12:45:10,441 INFO L226 Difference]: Without dead ends: 502 [2024-12-02 12:45:10,441 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-12-02 12:45:10,442 INFO L435 NwaCegarLoop]: 516 mSDtfsCounter, 12 mSDsluCounter, 3635 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s 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, 4.0s IncrementalHoareTripleChecker+Time [2024-12-02 12:45:10,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 4151 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-12-02 12:45:10,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2024-12-02 12:45:10,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 492. [2024-12-02 12:45:10,449 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-12-02 12:45:10,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 656 transitions. [2024-12-02 12:45:10,450 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 656 transitions. Word has length 74 [2024-12-02 12:45:10,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:45:10,451 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 656 transitions. [2024-12-02 12:45:10,451 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-12-02 12:45:10,451 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 656 transitions. [2024-12-02 12:45:10,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-12-02 12:45:10,451 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:45:10,451 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-12-02 12:45:10,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-12-02 12:45:10,452 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-12-02 12:45:10,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:45:10,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1328946313, now seen corresponding path program 1 times [2024-12-02 12:45:10,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:45:10,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502232148] [2024-12-02 12:45:10,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:45:10,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:45:10,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:45:10,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 12:45:10,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:45:10,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502232148] [2024-12-02 12:45:10,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502232148] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:45:10,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:45:10,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-12-02 12:45:10,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33800935] [2024-12-02 12:45:10,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:45:10,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-12-02 12:45:10,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:45:10,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-12-02 12:45:10,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-12-02 12:45:10,927 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-12-02 12:45:11,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:45:11,356 INFO L93 Difference]: Finished difference Result 946 states and 1270 transitions. [2024-12-02 12:45:11,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-12-02 12:45:11,356 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-12-02 12:45:11,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:45:11,358 INFO L225 Difference]: With dead ends: 946 [2024-12-02 12:45:11,358 INFO L226 Difference]: Without dead ends: 488 [2024-12-02 12:45:11,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-12-02 12:45:11,359 INFO L435 NwaCegarLoop]: 510 mSDtfsCounter, 12 mSDsluCounter, 3141 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 3651 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-12-02 12:45:11,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 3651 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-12-02 12:45:11,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2024-12-02 12:45:11,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 478. [2024-12-02 12:45:11,372 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-12-02 12:45:11,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 639 transitions. [2024-12-02 12:45:11,374 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 639 transitions. Word has length 75 [2024-12-02 12:45:11,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:45:11,374 INFO L471 AbstractCegarLoop]: Abstraction has 478 states and 639 transitions. [2024-12-02 12:45:11,374 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-12-02 12:45:11,374 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 639 transitions. [2024-12-02 12:45:11,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-12-02 12:45:11,375 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:45:11,375 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-12-02 12:45:11,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-12-02 12:45:11,375 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-12-02 12:45:11,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:45:11,376 INFO L85 PathProgramCache]: Analyzing trace with hash 486374430, now seen corresponding path program 1 times [2024-12-02 12:45:11,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:45:11,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206532899] [2024-12-02 12:45:11,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:45:11,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:45:11,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:45:11,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 12:45:11,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:45:11,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206532899] [2024-12-02 12:45:11,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206532899] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:45:11,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:45:11,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-12-02 12:45:11,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597393726] [2024-12-02 12:45:11,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:45:11,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-12-02 12:45:11,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:45:11,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-12-02 12:45:11,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-12-02 12:45:11,675 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-12-02 12:45:12,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:45:12,042 INFO L93 Difference]: Finished difference Result 938 states and 1259 transitions. [2024-12-02 12:45:12,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-12-02 12:45:12,042 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-12-02 12:45:12,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:45:12,045 INFO L225 Difference]: With dead ends: 938 [2024-12-02 12:45:12,045 INFO L226 Difference]: Without dead ends: 494 [2024-12-02 12:45:12,045 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-12-02 12:45:12,045 INFO L435 NwaCegarLoop]: 511 mSDtfsCounter, 13 mSDsluCounter, 3617 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2024-12-02 12:45:12,045 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.3s Time] [2024-12-02 12:45:12,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2024-12-02 12:45:12,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 489. [2024-12-02 12:45:12,057 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-12-02 12:45:12,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 651 transitions. [2024-12-02 12:45:12,059 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 651 transitions. Word has length 75 [2024-12-02 12:45:12,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:45:12,059 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 651 transitions. [2024-12-02 12:45:12,059 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-12-02 12:45:12,060 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 651 transitions. [2024-12-02 12:45:12,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-12-02 12:45:12,060 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:45:12,060 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-12-02 12:45:12,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-12-02 12:45:12,060 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-12-02 12:45:12,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:45:12,061 INFO L85 PathProgramCache]: Analyzing trace with hash 670310146, now seen corresponding path program 1 times [2024-12-02 12:45:12,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:45:12,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842916661] [2024-12-02 12:45:12,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:45:12,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:45:12,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:45:12,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 12:45:12,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:45:12,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842916661] [2024-12-02 12:45:12,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842916661] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:45:12,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:45:12,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-12-02 12:45:12,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314822149] [2024-12-02 12:45:12,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:45:12,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-12-02 12:45:12,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:45:12,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-12-02 12:45:12,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-12-02 12:45:12,308 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-12-02 12:45:12,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:45:12,862 INFO L93 Difference]: Finished difference Result 959 states and 1285 transitions. [2024-12-02 12:45:12,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-12-02 12:45:12,862 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-12-02 12:45:12,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:45:12,863 INFO L225 Difference]: With dead ends: 959 [2024-12-02 12:45:12,864 INFO L226 Difference]: Without dead ends: 504 [2024-12-02 12:45:12,864 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-12-02 12:45:12,864 INFO L435 NwaCegarLoop]: 517 mSDtfsCounter, 17 mSDsluCounter, 4514 mSDsCounter, 0 mSdLazyCounter, 1012 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2024-12-02 12:45:12,864 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.5s Time] [2024-12-02 12:45:12,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2024-12-02 12:45:12,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 494. [2024-12-02 12:45:12,872 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-12-02 12:45:12,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 657 transitions. [2024-12-02 12:45:12,873 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 657 transitions. Word has length 75 [2024-12-02 12:45:12,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:45:12,873 INFO L471 AbstractCegarLoop]: Abstraction has 494 states and 657 transitions. [2024-12-02 12:45:12,873 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-12-02 12:45:12,873 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 657 transitions. [2024-12-02 12:45:12,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-12-02 12:45:12,873 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:45:12,873 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-12-02 12:45:12,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-12-02 12:45:12,874 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-12-02 12:45:12,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:45:12,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1034564936, now seen corresponding path program 1 times [2024-12-02 12:45:12,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:45:12,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105449572] [2024-12-02 12:45:12,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:45:12,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:45:12,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:45:13,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 12:45:13,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:45:13,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105449572] [2024-12-02 12:45:13,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105449572] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:45:13,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:45:13,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-12-02 12:45:13,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266401440] [2024-12-02 12:45:13,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:45:13,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-12-02 12:45:13,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:45:13,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-12-02 12:45:13,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2024-12-02 12:45:13,293 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-12-02 12:45:14,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:45:14,852 INFO L93 Difference]: Finished difference Result 977 states and 1308 transitions. [2024-12-02 12:45:14,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-12-02 12:45:14,852 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-12-02 12:45:14,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:45:14,854 INFO L225 Difference]: With dead ends: 977 [2024-12-02 12:45:14,854 INFO L226 Difference]: Without dead ends: 517 [2024-12-02 12:45:14,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2024-12-02 12:45:14,855 INFO L435 NwaCegarLoop]: 516 mSDtfsCounter, 49 mSDsluCounter, 5466 mSDsCounter, 0 mSdLazyCounter, 1300 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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-12-02 12:45:14,855 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-12-02 12:45:14,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2024-12-02 12:45:14,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 494. [2024-12-02 12:45:14,865 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-12-02 12:45:14,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 657 transitions. [2024-12-02 12:45:14,866 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 657 transitions. Word has length 75 [2024-12-02 12:45:14,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:45:14,866 INFO L471 AbstractCegarLoop]: Abstraction has 494 states and 657 transitions. [2024-12-02 12:45:14,866 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-12-02 12:45:14,866 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 657 transitions. [2024-12-02 12:45:14,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-12-02 12:45:14,867 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:45:14,867 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-12-02 12:45:14,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-12-02 12:45:14,867 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-12-02 12:45:14,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:45:14,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1881400796, now seen corresponding path program 1 times [2024-12-02 12:45:14,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:45:14,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420084080] [2024-12-02 12:45:14,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:45:14,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:45:14,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:45:15,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 12:45:15,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:45:15,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420084080] [2024-12-02 12:45:15,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420084080] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:45:15,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:45:15,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-12-02 12:45:15,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836258429] [2024-12-02 12:45:15,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:45:15,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-12-02 12:45:15,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:45:15,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-12-02 12:45:15,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-12-02 12:45:15,138 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-12-02 12:45:15,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:45:15,705 INFO L93 Difference]: Finished difference Result 966 states and 1295 transitions. [2024-12-02 12:45:15,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-12-02 12:45:15,705 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-12-02 12:45:15,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:45:15,707 INFO L225 Difference]: With dead ends: 966 [2024-12-02 12:45:15,707 INFO L226 Difference]: Without dead ends: 506 [2024-12-02 12:45:15,707 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-12-02 12:45:15,708 INFO L435 NwaCegarLoop]: 506 mSDtfsCounter, 17 mSDsluCounter, 4500 mSDsCounter, 0 mSdLazyCounter, 958 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.5s IncrementalHoareTripleChecker+Time [2024-12-02 12:45:15,708 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.5s Time] [2024-12-02 12:45:15,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2024-12-02 12:45:15,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 492. [2024-12-02 12:45:15,717 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-12-02 12:45:15,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 654 transitions. [2024-12-02 12:45:15,718 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 654 transitions. Word has length 75 [2024-12-02 12:45:15,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:45:15,718 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 654 transitions. [2024-12-02 12:45:15,719 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-12-02 12:45:15,719 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 654 transitions. [2024-12-02 12:45:15,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-12-02 12:45:15,719 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:45:15,719 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-12-02 12:45:15,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-12-02 12:45:15,719 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-12-02 12:45:15,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:45:15,719 INFO L85 PathProgramCache]: Analyzing trace with hash -353123984, now seen corresponding path program 1 times [2024-12-02 12:45:15,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:45:15,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795810395] [2024-12-02 12:45:15,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:45:15,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:45:15,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:45:15,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 12:45:15,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:45:15,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795810395] [2024-12-02 12:45:15,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795810395] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:45:15,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:45:15,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-12-02 12:45:15,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986662231] [2024-12-02 12:45:15,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:45:15,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-12-02 12:45:15,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:45:15,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-12-02 12:45:15,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-12-02 12:45:15,917 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-12-02 12:45:16,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:45:16,377 INFO L93 Difference]: Finished difference Result 959 states and 1284 transitions. [2024-12-02 12:45:16,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-12-02 12:45:16,378 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-12-02 12:45:16,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:45:16,380 INFO L225 Difference]: With dead ends: 959 [2024-12-02 12:45:16,380 INFO L226 Difference]: Without dead ends: 501 [2024-12-02 12:45:16,380 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-12-02 12:45:16,381 INFO L435 NwaCegarLoop]: 506 mSDtfsCounter, 48 mSDsluCounter, 3591 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2024-12-02 12:45:16,381 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.4s Time] [2024-12-02 12:45:16,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2024-12-02 12:45:16,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 490. [2024-12-02 12:45:16,390 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-12-02 12:45:16,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 651 transitions. [2024-12-02 12:45:16,391 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 651 transitions. Word has length 75 [2024-12-02 12:45:16,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:45:16,391 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 651 transitions. [2024-12-02 12:45:16,391 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-12-02 12:45:16,392 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 651 transitions. [2024-12-02 12:45:16,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-12-02 12:45:16,392 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:45:16,392 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-12-02 12:45:16,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-12-02 12:45:16,392 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-12-02 12:45:16,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:45:16,392 INFO L85 PathProgramCache]: Analyzing trace with hash 552029526, now seen corresponding path program 1 times [2024-12-02 12:45:16,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:45:16,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956067313] [2024-12-02 12:45:16,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:45:16,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:45:16,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:45:16,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 12:45:16,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:45:16,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956067313] [2024-12-02 12:45:16,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956067313] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:45:16,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:45:16,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-12-02 12:45:16,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757907208] [2024-12-02 12:45:16,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:45:16,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-12-02 12:45:16,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:45:16,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-12-02 12:45:16,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-12-02 12:45:16,826 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-12-02 12:45:18,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:45:18,162 INFO L93 Difference]: Finished difference Result 972 states and 1303 transitions. [2024-12-02 12:45:18,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-12-02 12:45:18,162 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-12-02 12:45:18,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:45:18,164 INFO L225 Difference]: With dead ends: 972 [2024-12-02 12:45:18,164 INFO L226 Difference]: Without dead ends: 516 [2024-12-02 12:45:18,164 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-12-02 12:45:18,165 INFO L435 NwaCegarLoop]: 493 mSDtfsCounter, 36 mSDsluCounter, 4486 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 4979 SdHoareTripleChecker+Invalid, 974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-12-02 12:45:18,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 4979 Invalid, 974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 969 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-12-02 12:45:18,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2024-12-02 12:45:18,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 500. [2024-12-02 12:45:18,173 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-12-02 12:45:18,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 664 transitions. [2024-12-02 12:45:18,174 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 664 transitions. Word has length 75 [2024-12-02 12:45:18,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:45:18,174 INFO L471 AbstractCegarLoop]: Abstraction has 500 states and 664 transitions. [2024-12-02 12:45:18,174 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-12-02 12:45:18,174 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 664 transitions. [2024-12-02 12:45:18,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-12-02 12:45:18,175 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:45:18,175 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-12-02 12:45:18,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-12-02 12:45:18,175 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-12-02 12:45:18,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:45:18,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1685642863, now seen corresponding path program 1 times [2024-12-02 12:45:18,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:45:18,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685133078] [2024-12-02 12:45:18,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:45:18,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:45:18,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:45:21,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 12:45:21,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:45:21,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685133078] [2024-12-02 12:45:21,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685133078] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:45:21,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:45:21,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-12-02 12:45:21,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438950686] [2024-12-02 12:45:21,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:45:21,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-12-02 12:45:21,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:45:21,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-12-02 12:45:21,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2024-12-02 12:45:21,377 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-12-02 12:45:26,026 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-12-02 12:45:30,030 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-12-02 12:45:34,037 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-12-02 12:45:38,040 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-12-02 12:45:42,043 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-12-02 12:45:46,053 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-12-02 12:45:50,059 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-12-02 12:45:54,063 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-12-02 12:45:58,079 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-12-02 12:46:02,097 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-12-02 12:46:06,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-12-02 12:46:10,117 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-12-02 12:46:11,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:46:11,230 INFO L93 Difference]: Finished difference Result 977 states and 1308 transitions. [2024-12-02 12:46:11,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-12-02 12:46:11,231 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-12-02 12:46:11,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:46:11,232 INFO L225 Difference]: With dead ends: 977 [2024-12-02 12:46:11,232 INFO L226 Difference]: Without dead ends: 511 [2024-12-02 12:46:11,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2024-12-02 12:46:11,233 INFO L435 NwaCegarLoop]: 498 mSDtfsCounter, 21 mSDsluCounter, 5354 mSDsCounter, 0 mSdLazyCounter, 1100 mSolverCounterSat, 1 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 49.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 5852 SdHoareTripleChecker+Invalid, 1113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1100 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 49.8s IncrementalHoareTripleChecker+Time [2024-12-02 12:46:11,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 5852 Invalid, 1113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1100 Invalid, 12 Unknown, 0 Unchecked, 49.8s Time] [2024-12-02 12:46:11,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2024-12-02 12:46:11,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 504. [2024-12-02 12:46:11,241 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-12-02 12:46:11,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 669 transitions. [2024-12-02 12:46:11,243 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 669 transitions. Word has length 75 [2024-12-02 12:46:11,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:46:11,243 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 669 transitions. [2024-12-02 12:46:11,243 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-12-02 12:46:11,243 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 669 transitions. [2024-12-02 12:46:11,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-12-02 12:46:11,243 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:46:11,244 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-12-02 12:46:11,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-12-02 12:46:11,244 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-12-02 12:46:11,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:46:11,244 INFO L85 PathProgramCache]: Analyzing trace with hash -408280145, now seen corresponding path program 1 times [2024-12-02 12:46:11,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:46:11,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432213785] [2024-12-02 12:46:11,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:46:11,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:46:11,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:46:20,784 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (div |c_ULTIMATE.start_main_~_hj_j~0#1| 8192)) (.cse0 (div |c_ULTIMATE.start_main_~_hj_j~0#1| 4294967296))) (and (<= (mod (+ (* |c_ULTIMATE.start_main_~_hj_j~0#1| 3607783014) (* .cse0 4294443008) .cse1 2488896663 (* |c_ULTIMATE.start_main_~_ha_hashv~0#1| 3951375155)) 4294967296) 524287) (= .cse1 (+ (* .cse0 524288) |c_ULTIMATE.start_main_~_ha_hashv~0#1|)))) is different from false [2024-12-02 12:46:20,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 12:46:20,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:46:20,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432213785] [2024-12-02 12:46:20,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432213785] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:46:20,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:46:20,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-12-02 12:46:20,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616459057] [2024-12-02 12:46:20,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:46:20,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-12-02 12:46:20,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:46:20,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-12-02 12:46:20,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=74, Unknown=1, NotChecked=16, Total=110 [2024-12-02 12:46:20,846 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-12-02 12:46:25,033 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-12-02 12:46:29,038 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-12-02 12:46:33,044 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-12-02 12:46:37,047 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-12-02 12:46:41,056 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-12-02 12:46:45,066 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-12-02 12:46:49,068 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-12-02 12:46:51,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.91s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-02 12:46:53,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-02 12:46:57,942 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-12-02 12:47:00,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-02 12:47:04,045 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-12-02 12:47:08,054 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-12-02 12:47:12,059 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-12-02 12:47:16,061 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-12-02 12:47:20,065 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-12-02 12:47:24,070 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-02 12:47:28,080 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-12-02 12:47:29,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-02 12:47:30,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:47:30,466 INFO L93 Difference]: Finished difference Result 983 states and 1315 transitions. [2024-12-02 12:47:30,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-12-02 12:47:30,467 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-12-02 12:47:30,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:47:30,469 INFO L225 Difference]: With dead ends: 983 [2024-12-02 12:47:30,469 INFO L226 Difference]: Without dead ends: 513 [2024-12-02 12:47:30,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=19, Invalid=74, Unknown=1, NotChecked=16, Total=110 [2024-12-02 12:47:30,470 INFO L435 NwaCegarLoop]: 505 mSDtfsCounter, 17 mSDsluCounter, 3998 mSDsCounter, 0 mSdLazyCounter, 708 mSolverCounterSat, 1 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 69.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4503 SdHoareTripleChecker+Invalid, 857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 708 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 133 IncrementalHoareTripleChecker+Unchecked, 69.6s IncrementalHoareTripleChecker+Time [2024-12-02 12:47:30,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4503 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 708 Invalid, 15 Unknown, 133 Unchecked, 69.6s Time] [2024-12-02 12:47:30,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2024-12-02 12:47:30,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 509. [2024-12-02 12:47:30,478 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-12-02 12:47:30,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 676 transitions. [2024-12-02 12:47:30,479 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 676 transitions. Word has length 75 [2024-12-02 12:47:30,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:47:30,479 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 676 transitions. [2024-12-02 12:47:30,479 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-12-02 12:47:30,479 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 676 transitions. [2024-12-02 12:47:30,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-12-02 12:47:30,480 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:47:30,480 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-12-02 12:47:30,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-12-02 12:47:30,480 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-12-02 12:47:30,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:47:30,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1110996182, now seen corresponding path program 1 times [2024-12-02 12:47:30,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:47:30,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573133968] [2024-12-02 12:47:30,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:47:30,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:47:30,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:47:30,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 12:47:30,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:47:30,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573133968] [2024-12-02 12:47:30,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573133968] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:47:30,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:47:30,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-12-02 12:47:30,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393936958] [2024-12-02 12:47:30,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:47:30,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-12-02 12:47:30,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:47:30,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-12-02 12:47:30,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-12-02 12:47:30,693 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-12-02 12:47:31,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:47:31,674 INFO L93 Difference]: Finished difference Result 1051 states and 1407 transitions. [2024-12-02 12:47:31,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-12-02 12:47:31,675 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-12-02 12:47:31,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:47:31,677 INFO L225 Difference]: With dead ends: 1051 [2024-12-02 12:47:31,677 INFO L226 Difference]: Without dead ends: 576 [2024-12-02 12:47:31,677 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-12-02 12:47:31,678 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 133 mSDsluCounter, 3182 mSDsCounter, 0 mSdLazyCounter, 1008 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.8s IncrementalHoareTripleChecker+Time [2024-12-02 12:47:31,678 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.8s Time] [2024-12-02 12:47:31,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2024-12-02 12:47:31,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 512. [2024-12-02 12:47:31,686 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-12-02 12:47:31,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 680 transitions. [2024-12-02 12:47:31,688 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 680 transitions. Word has length 75 [2024-12-02 12:47:31,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:47:31,688 INFO L471 AbstractCegarLoop]: Abstraction has 512 states and 680 transitions. [2024-12-02 12:47:31,688 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-12-02 12:47:31,688 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 680 transitions. [2024-12-02 12:47:31,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-12-02 12:47:31,689 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:47:31,689 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-12-02 12:47:31,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-12-02 12:47:31,689 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-12-02 12:47:31,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:47:31,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1407040598, now seen corresponding path program 1 times [2024-12-02 12:47:31,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:47:31,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36946465] [2024-12-02 12:47:31,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:47:31,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:47:31,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:47:32,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 12:47:32,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:47:32,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36946465] [2024-12-02 12:47:32,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36946465] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:47:32,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:47:32,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-12-02 12:47:32,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813664818] [2024-12-02 12:47:32,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:47:32,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-12-02 12:47:32,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:47:32,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-12-02 12:47:32,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2024-12-02 12:47:32,219 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-12-02 12:47:34,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:47:34,039 INFO L93 Difference]: Finished difference Result 1018 states and 1366 transitions. [2024-12-02 12:47:34,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-12-02 12:47:34,040 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-12-02 12:47:34,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:47:34,042 INFO L225 Difference]: With dead ends: 1018 [2024-12-02 12:47:34,042 INFO L226 Difference]: Without dead ends: 540 [2024-12-02 12:47:34,042 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-12-02 12:47:34,042 INFO L435 NwaCegarLoop]: 496 mSDtfsCounter, 28 mSDsluCounter, 6682 mSDsCounter, 0 mSdLazyCounter, 1623 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 7178 SdHoareTripleChecker+Invalid, 1623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-12-02 12:47:34,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 7178 Invalid, 1623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1623 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-12-02 12:47:34,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2024-12-02 12:47:34,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 524. [2024-12-02 12:47:34,050 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-12-02 12:47:34,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 697 transitions. [2024-12-02 12:47:34,052 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 697 transitions. Word has length 75 [2024-12-02 12:47:34,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:47:34,052 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 697 transitions. [2024-12-02 12:47:34,052 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-12-02 12:47:34,052 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 697 transitions. [2024-12-02 12:47:34,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-12-02 12:47:34,052 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:47:34,052 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 12:47:34,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-12-02 12:47:34,053 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-12-02 12:47:34,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:47:34,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1671370991, now seen corresponding path program 1 times [2024-12-02 12:47:34,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:47:34,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063200530] [2024-12-02 12:47:34,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:47:34,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:47:34,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat