./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-5.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2b4890b-bc0a-4e61-8725-6a38d71783de/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2b4890b-bc0a-4e61-8725-6a38d71783de/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2b4890b-bc0a-4e61-8725-6a38d71783de/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2b4890b-bc0a-4e61-8725-6a38d71783de/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-5.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2b4890b-bc0a-4e61-8725-6a38d71783de/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2b4890b-bc0a-4e61-8725-6a38d71783de/bin/uautomizer-verify-4GaUIPS5ZU --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 ef6497bb448d9a320776973de65f322a5dd7ce0e422c6531ce8baf2751ae72d5 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 21:55:24,204 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 21:55:24,296 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2b4890b-bc0a-4e61-8725-6a38d71783de/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-31 21:55:24,304 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 21:55:24,304 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 21:55:24,343 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 21:55:24,343 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 21:55:24,344 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 21:55:24,345 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 21:55:24,347 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 21:55:24,348 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 21:55:24,348 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 21:55:24,349 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 21:55:24,349 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 21:55:24,349 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 21:55:24,350 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 21:55:24,352 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 21:55:24,352 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 21:55:24,355 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 21:55:24,356 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 21:55:24,356 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 21:55:24,357 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 21:55:24,357 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 21:55:24,358 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 21:55:24,358 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 21:55:24,359 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 21:55:24,359 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 21:55:24,359 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 21:55:24,360 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 21:55:24,360 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 21:55:24,361 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 21:55:24,361 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 21:55:24,361 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 21:55:24,362 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 21:55:24,362 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 21:55:24,362 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 21:55:24,362 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 21:55:24,362 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 21:55:24,363 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 21:55:24,363 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 21:55:24,363 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 21:55:24,366 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 21:55:24,366 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2b4890b-bc0a-4e61-8725-6a38d71783de/bin/uautomizer-verify-4GaUIPS5ZU/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2b4890b-bc0a-4e61-8725-6a38d71783de/bin/uautomizer-verify-4GaUIPS5ZU 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 -> ef6497bb448d9a320776973de65f322a5dd7ce0e422c6531ce8baf2751ae72d5 [2024-10-31 21:55:24,658 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 21:55:24,692 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 21:55:24,695 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 21:55:24,697 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 21:55:24,697 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 21:55:24,699 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2b4890b-bc0a-4e61-8725-6a38d71783de/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-5.i Unable to find full path for "g++" [2024-10-31 21:55:26,663 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 21:55:26,902 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 21:55:26,905 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2b4890b-bc0a-4e61-8725-6a38d71783de/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-5.i [2024-10-31 21:55:26,916 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2b4890b-bc0a-4e61-8725-6a38d71783de/bin/uautomizer-verify-4GaUIPS5ZU/data/466b31c09/71e7b5cab0a44eadb46ba633e7256d7f/FLAG5db8cfa7e [2024-10-31 21:55:26,934 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2b4890b-bc0a-4e61-8725-6a38d71783de/bin/uautomizer-verify-4GaUIPS5ZU/data/466b31c09/71e7b5cab0a44eadb46ba633e7256d7f [2024-10-31 21:55:26,936 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 21:55:26,937 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 21:55:26,938 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 21:55:26,939 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 21:55:26,945 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 21:55:26,946 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 09:55:26" (1/1) ... [2024-10-31 21:55:26,947 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21c7fce1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:55:26, skipping insertion in model container [2024-10-31 21:55:26,947 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 09:55:26" (1/1) ... [2024-10-31 21:55:26,986 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 21:55:27,181 WARN L251 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_c2b4890b-bc0a-4e61-8725-6a38d71783de/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-5.i[915,928] [2024-10-31 21:55:27,262 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 21:55:27,275 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 21:55:27,287 WARN L251 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_c2b4890b-bc0a-4e61-8725-6a38d71783de/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-5.i[915,928] [2024-10-31 21:55:27,328 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 21:55:27,361 INFO L204 MainTranslator]: Completed translation [2024-10-31 21:55:27,362 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:55:27 WrapperNode [2024-10-31 21:55:27,362 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 21:55:27,364 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 21:55:27,365 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 21:55:27,365 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 21:55:27,373 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:55:27" (1/1) ... [2024-10-31 21:55:27,396 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:55:27" (1/1) ... [2024-10-31 21:55:27,459 INFO L138 Inliner]: procedures = 27, calls = 154, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 411 [2024-10-31 21:55:27,459 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 21:55:27,460 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 21:55:27,460 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 21:55:27,461 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 21:55:27,473 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:55:27" (1/1) ... [2024-10-31 21:55:27,473 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:55:27" (1/1) ... [2024-10-31 21:55:27,479 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:55:27" (1/1) ... [2024-10-31 21:55:27,503 INFO L175 MemorySlicer]: Split 123 memory accesses to 2 slices as follows [2, 121]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 33 writes are split as follows [0, 33]. [2024-10-31 21:55:27,504 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:55:27" (1/1) ... [2024-10-31 21:55:27,504 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:55:27" (1/1) ... [2024-10-31 21:55:27,530 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:55:27" (1/1) ... [2024-10-31 21:55:27,539 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:55:27" (1/1) ... [2024-10-31 21:55:27,544 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:55:27" (1/1) ... [2024-10-31 21:55:27,552 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:55:27" (1/1) ... [2024-10-31 21:55:27,560 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 21:55:27,563 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 21:55:27,563 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 21:55:27,563 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 21:55:27,564 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:55:27" (1/1) ... [2024-10-31 21:55:27,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 21:55:27,584 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2b4890b-bc0a-4e61-8725-6a38d71783de/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:55:27,606 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2b4890b-bc0a-4e61-8725-6a38d71783de/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 21:55:27,610 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2b4890b-bc0a-4e61-8725-6a38d71783de/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 21:55:27,645 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 21:55:27,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2024-10-31 21:55:27,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2024-10-31 21:55:27,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-31 21:55:27,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-31 21:55:27,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-31 21:55:27,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-31 21:55:27,647 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-31 21:55:27,647 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-31 21:55:27,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 21:55:27,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-31 21:55:27,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 21:55:27,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 21:55:27,794 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 21:55:27,797 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 21:55:28,418 INFO L? ?]: Removed 94 outVars from TransFormulas that were not future-live. [2024-10-31 21:55:28,418 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 21:55:28,432 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 21:55:28,432 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 21:55:28,433 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:55:28 BoogieIcfgContainer [2024-10-31 21:55:28,433 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 21:55:28,435 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 21:55:28,436 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 21:55:28,440 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 21:55:28,440 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 09:55:26" (1/3) ... [2024-10-31 21:55:28,441 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2767d5b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 09:55:28, skipping insertion in model container [2024-10-31 21:55:28,441 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:55:27" (2/3) ... [2024-10-31 21:55:28,441 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2767d5b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 09:55:28, skipping insertion in model container [2024-10-31 21:55:28,441 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:55:28" (3/3) ... [2024-10-31 21:55:28,443 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-5.i [2024-10-31 21:55:28,463 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 21:55:28,464 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-31 21:55:28,534 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 21:55:28,546 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;@4bc35883, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 21:55:28,547 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-31 21:55:28,552 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 73 states have (on average 1.3287671232876712) internal successors, (97), 74 states have internal predecessors, (97), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-31 21:55:28,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-31 21:55:28,572 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:55:28,574 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:55:28,574 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:55:28,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:55:28,581 INFO L85 PathProgramCache]: Analyzing trace with hash -390685078, now seen corresponding path program 1 times [2024-10-31 21:55:28,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:55:28,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932941770] [2024-10-31 21:55:28,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:55:28,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:55:28,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:29,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:55:29,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:29,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 21:55:29,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:29,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 21:55:29,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:29,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 21:55:29,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:29,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 21:55:29,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:29,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 21:55:29,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:29,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 21:55:29,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:29,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 21:55:29,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:29,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 21:55:29,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:29,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 21:55:29,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:29,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 21:55:29,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:29,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 21:55:29,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:29,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 21:55:29,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:29,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 21:55:29,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:29,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 21:55:29,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:29,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-31 21:55:29,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:29,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-31 21:55:29,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:29,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-31 21:55:29,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:29,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-31 21:55:29,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:29,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-31 21:55:29,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:29,229 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-31 21:55:29,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:55:29,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932941770] [2024-10-31 21:55:29,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932941770] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:55:29,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:55:29,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:55:29,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414825253] [2024-10-31 21:55:29,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:55:29,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-31 21:55:29,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:55:29,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-31 21:55:29,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 21:55:29,271 INFO L87 Difference]: Start difference. First operand has 96 states, 73 states have (on average 1.3287671232876712) internal successors, (97), 74 states have internal predecessors, (97), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-31 21:55:29,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:55:29,306 INFO L93 Difference]: Finished difference Result 185 states and 288 transitions. [2024-10-31 21:55:29,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-31 21:55:29,309 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 148 [2024-10-31 21:55:29,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:55:29,318 INFO L225 Difference]: With dead ends: 185 [2024-10-31 21:55:29,318 INFO L226 Difference]: Without dead ends: 92 [2024-10-31 21:55:29,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 21:55:29,326 INFO L432 NwaCegarLoop]: 130 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, 130 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-10-31 21:55:29,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 21:55:29,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-31 21:55:29,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-10-31 21:55:29,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 70 states have (on average 1.2857142857142858) internal successors, (90), 70 states have internal predecessors, (90), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-31 21:55:29,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 130 transitions. [2024-10-31 21:55:29,394 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 130 transitions. Word has length 148 [2024-10-31 21:55:29,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:55:29,395 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 130 transitions. [2024-10-31 21:55:29,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-31 21:55:29,396 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 130 transitions. [2024-10-31 21:55:29,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-31 21:55:29,402 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:55:29,402 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:55:29,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 21:55:29,403 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:55:29,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:55:29,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1268903826, now seen corresponding path program 1 times [2024-10-31 21:55:29,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:55:29,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334312983] [2024-10-31 21:55:29,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:55:29,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:55:29,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:30,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:55:30,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:30,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 21:55:30,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:30,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 21:55:30,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:30,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 21:55:30,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:30,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 21:55:30,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:30,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 21:55:30,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:30,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 21:55:30,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:30,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 21:55:30,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:30,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 21:55:30,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:30,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 21:55:30,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:30,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 21:55:30,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:30,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 21:55:30,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:30,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 21:55:30,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:30,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 21:55:30,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:30,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 21:55:30,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:30,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-31 21:55:30,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:30,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-31 21:55:30,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:30,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-31 21:55:30,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:30,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-31 21:55:30,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:30,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-31 21:55:30,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:30,162 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-31 21:55:30,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:55:30,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334312983] [2024-10-31 21:55:30,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334312983] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:55:30,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:55:30,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 21:55:30,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971982603] [2024-10-31 21:55:30,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:55:30,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 21:55:30,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:55:30,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 21:55:30,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 21:55:30,171 INFO L87 Difference]: Start difference. First operand 92 states and 130 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-31 21:55:30,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:55:30,248 INFO L93 Difference]: Finished difference Result 183 states and 260 transitions. [2024-10-31 21:55:30,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 21:55:30,249 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 148 [2024-10-31 21:55:30,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:55:30,251 INFO L225 Difference]: With dead ends: 183 [2024-10-31 21:55:30,251 INFO L226 Difference]: Without dead ends: 94 [2024-10-31 21:55:30,252 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 21:55:30,254 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 0 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 21:55:30,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 373 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 21:55:30,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-31 21:55:30,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-10-31 21:55:30,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 72 states have (on average 1.2777777777777777) internal successors, (92), 72 states have internal predecessors, (92), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-31 21:55:30,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 132 transitions. [2024-10-31 21:55:30,272 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 132 transitions. Word has length 148 [2024-10-31 21:55:30,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:55:30,276 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 132 transitions. [2024-10-31 21:55:30,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-31 21:55:30,277 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 132 transitions. [2024-10-31 21:55:30,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-31 21:55:30,280 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:55:30,280 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:55:30,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 21:55:30,281 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:55:30,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:55:30,281 INFO L85 PathProgramCache]: Analyzing trace with hash -2087864835, now seen corresponding path program 1 times [2024-10-31 21:55:30,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:55:30,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911049849] [2024-10-31 21:55:30,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:55:30,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:55:30,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:30,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:55:30,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:30,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 21:55:30,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:30,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 21:55:30,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:30,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 21:55:30,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:30,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 21:55:30,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:30,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 21:55:30,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:30,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 21:55:30,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:30,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 21:55:30,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:30,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 21:55:30,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:30,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 21:55:30,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:30,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 21:55:30,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:30,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 21:55:30,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:30,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 21:55:30,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:30,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 21:55:30,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:30,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 21:55:30,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:30,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-31 21:55:30,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:30,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-31 21:55:30,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:30,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-31 21:55:30,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:30,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-31 21:55:30,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:30,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-31 21:55:30,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:30,543 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-31 21:55:30,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:55:30,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911049849] [2024-10-31 21:55:30,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911049849] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:55:30,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:55:30,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 21:55:30,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609177260] [2024-10-31 21:55:30,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:55:30,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 21:55:30,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:55:30,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 21:55:30,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 21:55:30,548 INFO L87 Difference]: Start difference. First operand 94 states and 132 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-31 21:55:30,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:55:30,604 INFO L93 Difference]: Finished difference Result 188 states and 265 transitions. [2024-10-31 21:55:30,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 21:55:30,604 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 150 [2024-10-31 21:55:30,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:55:30,606 INFO L225 Difference]: With dead ends: 188 [2024-10-31 21:55:30,606 INFO L226 Difference]: Without dead ends: 97 [2024-10-31 21:55:30,607 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 21:55:30,612 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 1 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 21:55:30,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 370 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 21:55:30,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-31 21:55:30,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2024-10-31 21:55:30,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 74 states have internal predecessors, (94), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-31 21:55:30,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 134 transitions. [2024-10-31 21:55:30,623 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 134 transitions. Word has length 150 [2024-10-31 21:55:30,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:55:30,623 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 134 transitions. [2024-10-31 21:55:30,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-31 21:55:30,624 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 134 transitions. [2024-10-31 21:55:30,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-31 21:55:30,626 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:55:30,626 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:55:30,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 21:55:30,627 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:55:30,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:55:30,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1407806465, now seen corresponding path program 1 times [2024-10-31 21:55:30,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:55:30,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454822225] [2024-10-31 21:55:30,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:55:30,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:55:30,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:30,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:55:30,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:30,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 21:55:30,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:30,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 21:55:30,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:30,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 21:55:30,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:30,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 21:55:30,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:30,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 21:55:30,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:30,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 21:55:30,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:30,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 21:55:30,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:30,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 21:55:30,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:30,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 21:55:30,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:30,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 21:55:30,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:30,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 21:55:30,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:30,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 21:55:30,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:30,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 21:55:30,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:30,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 21:55:30,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:30,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-31 21:55:30,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:30,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-31 21:55:30,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:30,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-31 21:55:30,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:30,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-31 21:55:30,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:30,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-31 21:55:30,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:30,875 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-31 21:55:30,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:55:30,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454822225] [2024-10-31 21:55:30,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454822225] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:55:30,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:55:30,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 21:55:30,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798973300] [2024-10-31 21:55:30,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:55:30,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 21:55:30,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:55:30,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 21:55:30,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 21:55:30,880 INFO L87 Difference]: Start difference. First operand 96 states and 134 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-31 21:55:30,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:55:30,927 INFO L93 Difference]: Finished difference Result 192 states and 269 transitions. [2024-10-31 21:55:30,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 21:55:30,931 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 150 [2024-10-31 21:55:30,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:55:30,933 INFO L225 Difference]: With dead ends: 192 [2024-10-31 21:55:30,933 INFO L226 Difference]: Without dead ends: 99 [2024-10-31 21:55:30,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 21:55:30,937 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 1 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 21:55:30,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 371 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 21:55:30,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-31 21:55:30,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2024-10-31 21:55:30,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 76 states have (on average 1.263157894736842) internal successors, (96), 76 states have internal predecessors, (96), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-31 21:55:30,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 136 transitions. [2024-10-31 21:55:30,957 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 136 transitions. Word has length 150 [2024-10-31 21:55:30,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:55:30,958 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 136 transitions. [2024-10-31 21:55:30,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-31 21:55:30,958 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 136 transitions. [2024-10-31 21:55:30,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-31 21:55:30,964 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:55:30,965 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:55:30,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 21:55:30,965 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:55:30,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:55:30,966 INFO L85 PathProgramCache]: Analyzing trace with hash 367200897, now seen corresponding path program 1 times [2024-10-31 21:55:30,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:55:30,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858423898] [2024-10-31 21:55:30,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:55:30,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:55:31,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:31,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:55:31,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:31,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 21:55:31,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:31,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 21:55:31,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:31,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 21:55:31,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:31,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 21:55:31,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:31,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 21:55:31,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:31,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 21:55:31,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:31,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 21:55:31,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:31,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 21:55:31,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:31,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 21:55:31,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:31,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 21:55:31,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:31,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 21:55:31,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:31,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 21:55:31,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:31,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 21:55:31,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:31,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 21:55:31,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:31,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-31 21:55:31,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:31,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-31 21:55:31,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:31,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-31 21:55:31,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:31,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-31 21:55:31,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:31,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-31 21:55:31,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:31,283 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-31 21:55:31,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:55:31,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858423898] [2024-10-31 21:55:31,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858423898] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:55:31,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:55:31,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 21:55:31,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146299182] [2024-10-31 21:55:31,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:55:31,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 21:55:31,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:55:31,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 21:55:31,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 21:55:31,289 INFO L87 Difference]: Start difference. First operand 98 states and 136 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-31 21:55:31,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:55:31,325 INFO L93 Difference]: Finished difference Result 196 states and 273 transitions. [2024-10-31 21:55:31,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 21:55:31,329 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 150 [2024-10-31 21:55:31,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:55:31,330 INFO L225 Difference]: With dead ends: 196 [2024-10-31 21:55:31,330 INFO L226 Difference]: Without dead ends: 101 [2024-10-31 21:55:31,331 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 21:55:31,336 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 1 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 21:55:31,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 373 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 21:55:31,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-31 21:55:31,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2024-10-31 21:55:31,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 78 states have (on average 1.2564102564102564) internal successors, (98), 78 states have internal predecessors, (98), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-31 21:55:31,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 138 transitions. [2024-10-31 21:55:31,347 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 138 transitions. Word has length 150 [2024-10-31 21:55:31,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:55:31,348 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 138 transitions. [2024-10-31 21:55:31,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-31 21:55:31,348 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 138 transitions. [2024-10-31 21:55:31,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-31 21:55:31,350 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:55:31,351 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:55:31,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 21:55:31,351 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:55:31,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:55:31,351 INFO L85 PathProgramCache]: Analyzing trace with hash 369047939, now seen corresponding path program 1 times [2024-10-31 21:55:31,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:55:31,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529221116] [2024-10-31 21:55:31,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:55:31,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:55:31,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:31,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:55:31,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:31,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 21:55:31,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:31,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 21:55:31,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:31,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 21:55:31,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:31,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 21:55:31,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:31,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 21:55:31,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:31,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 21:55:31,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:31,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 21:55:31,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:31,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 21:55:31,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:31,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 21:55:31,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:31,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 21:55:31,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:31,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 21:55:31,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:31,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 21:55:31,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:31,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 21:55:31,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:31,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 21:55:31,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:31,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-31 21:55:31,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:31,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-31 21:55:31,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:31,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-31 21:55:31,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:31,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-31 21:55:31,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:31,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-31 21:55:31,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:31,647 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-31 21:55:31,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:55:31,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529221116] [2024-10-31 21:55:31,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529221116] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:55:31,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:55:31,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 21:55:31,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306095646] [2024-10-31 21:55:31,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:55:31,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 21:55:31,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:55:31,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 21:55:31,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 21:55:31,651 INFO L87 Difference]: Start difference. First operand 100 states and 138 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-31 21:55:31,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:55:31,701 INFO L93 Difference]: Finished difference Result 200 states and 277 transitions. [2024-10-31 21:55:31,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 21:55:31,703 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 150 [2024-10-31 21:55:31,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:55:31,705 INFO L225 Difference]: With dead ends: 200 [2024-10-31 21:55:31,705 INFO L226 Difference]: Without dead ends: 103 [2024-10-31 21:55:31,706 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 21:55:31,706 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 21:55:31,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 491 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 21:55:31,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-31 21:55:31,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-10-31 21:55:31,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 81 states have (on average 1.2469135802469136) internal successors, (101), 81 states have internal predecessors, (101), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-31 21:55:31,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 141 transitions. [2024-10-31 21:55:31,730 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 141 transitions. Word has length 150 [2024-10-31 21:55:31,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:55:31,731 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 141 transitions. [2024-10-31 21:55:31,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-31 21:55:31,732 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 141 transitions. [2024-10-31 21:55:31,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-31 21:55:31,734 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:55:31,734 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:55:31,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 21:55:31,734 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:55:31,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:55:31,738 INFO L85 PathProgramCache]: Analyzing trace with hash 846089747, now seen corresponding path program 1 times [2024-10-31 21:55:31,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:55:31,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214662078] [2024-10-31 21:55:31,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:55:31,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:55:31,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:32,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:55:32,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:32,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 21:55:32,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:32,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 21:55:32,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:32,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 21:55:32,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:32,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 21:55:32,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:32,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 21:55:32,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:32,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 21:55:32,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:32,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 21:55:32,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:32,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 21:55:32,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:32,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 21:55:32,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:32,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 21:55:32,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:32,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 21:55:32,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:32,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 21:55:32,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:32,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 21:55:32,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:32,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 21:55:32,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:32,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-31 21:55:32,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:32,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-31 21:55:32,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:32,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-31 21:55:32,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:32,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-31 21:55:32,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:32,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-31 21:55:32,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:32,189 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-31 21:55:32,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:55:32,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214662078] [2024-10-31 21:55:32,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214662078] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:55:32,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:55:32,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 21:55:32,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309523752] [2024-10-31 21:55:32,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:55:32,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 21:55:32,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:55:32,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 21:55:32,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 21:55:32,194 INFO L87 Difference]: Start difference. First operand 103 states and 141 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-31 21:55:32,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:55:32,358 INFO L93 Difference]: Finished difference Result 203 states and 279 transitions. [2024-10-31 21:55:32,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 21:55:32,360 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 150 [2024-10-31 21:55:32,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:55:32,361 INFO L225 Difference]: With dead ends: 203 [2024-10-31 21:55:32,362 INFO L226 Difference]: Without dead ends: 103 [2024-10-31 21:55:32,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 21:55:32,363 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 21:55:32,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 321 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 21:55:32,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-31 21:55:32,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-10-31 21:55:32,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 81 states have (on average 1.2345679012345678) internal successors, (100), 81 states have internal predecessors, (100), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-31 21:55:32,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 140 transitions. [2024-10-31 21:55:32,377 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 140 transitions. Word has length 150 [2024-10-31 21:55:32,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:55:32,378 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 140 transitions. [2024-10-31 21:55:32,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-31 21:55:32,378 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 140 transitions. [2024-10-31 21:55:32,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-31 21:55:32,384 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:55:32,384 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:55:32,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 21:55:32,385 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:55:32,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:55:32,385 INFO L85 PathProgramCache]: Analyzing trace with hash -174978607, now seen corresponding path program 1 times [2024-10-31 21:55:32,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:55:32,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837890860] [2024-10-31 21:55:32,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:55:32,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:55:32,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:32,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:55:32,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:32,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 21:55:32,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:32,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 21:55:32,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:32,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 21:55:32,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:32,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 21:55:32,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:32,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 21:55:32,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:32,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 21:55:32,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:32,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 21:55:32,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:32,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 21:55:32,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:32,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 21:55:32,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:32,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 21:55:32,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:32,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 21:55:32,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:32,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 21:55:32,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:32,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 21:55:32,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:32,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 21:55:32,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:32,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-31 21:55:32,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:32,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-31 21:55:32,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:32,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-31 21:55:32,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:32,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-31 21:55:32,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:32,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-31 21:55:32,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:32,781 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-31 21:55:32,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:55:32,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837890860] [2024-10-31 21:55:32,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837890860] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:55:32,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:55:32,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 21:55:32,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528419380] [2024-10-31 21:55:32,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:55:32,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:55:32,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:55:32,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:55:32,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:55:32,783 INFO L87 Difference]: Start difference. First operand 103 states and 140 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-31 21:55:32,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:55:32,798 INFO L93 Difference]: Finished difference Result 203 states and 277 transitions. [2024-10-31 21:55:32,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:55:32,798 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 150 [2024-10-31 21:55:32,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:55:32,800 INFO L225 Difference]: With dead ends: 203 [2024-10-31 21:55:32,800 INFO L226 Difference]: Without dead ends: 103 [2024-10-31 21:55:32,801 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:55:32,802 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 21:55:32,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 251 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 21:55:32,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-31 21:55:32,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-10-31 21:55:32,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 81 states have (on average 1.2222222222222223) internal successors, (99), 81 states have internal predecessors, (99), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-31 21:55:32,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 139 transitions. [2024-10-31 21:55:32,819 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 139 transitions. Word has length 150 [2024-10-31 21:55:32,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:55:32,819 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 139 transitions. [2024-10-31 21:55:32,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-31 21:55:32,820 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 139 transitions. [2024-10-31 21:55:32,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-31 21:55:32,821 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:55:32,821 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:55:32,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-31 21:55:32,822 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:55:32,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:55:32,825 INFO L85 PathProgramCache]: Analyzing trace with hash 317740726, now seen corresponding path program 1 times [2024-10-31 21:55:32,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:55:32,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800405] [2024-10-31 21:55:32,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:55:32,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:55:32,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:33,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:55:33,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:33,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 21:55:33,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:33,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 21:55:33,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:33,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 21:55:33,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:33,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 21:55:33,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:33,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 21:55:33,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:33,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 21:55:33,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:33,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 21:55:33,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:33,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 21:55:33,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:33,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 21:55:33,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:33,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 21:55:33,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:33,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 21:55:33,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:33,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 21:55:33,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:33,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 21:55:33,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:33,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 21:55:33,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:33,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-31 21:55:33,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:33,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-31 21:55:33,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:33,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-31 21:55:33,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:33,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-31 21:55:33,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:33,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-31 21:55:33,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:33,459 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-31 21:55:33,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:55:33,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800405] [2024-10-31 21:55:33,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800405] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:55:33,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:55:33,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 21:55:33,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668204913] [2024-10-31 21:55:33,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:55:33,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 21:55:33,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:55:33,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 21:55:33,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 21:55:33,462 INFO L87 Difference]: Start difference. First operand 103 states and 139 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-31 21:55:33,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:55:33,602 INFO L93 Difference]: Finished difference Result 203 states and 275 transitions. [2024-10-31 21:55:33,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 21:55:33,602 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 152 [2024-10-31 21:55:33,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:55:33,604 INFO L225 Difference]: With dead ends: 203 [2024-10-31 21:55:33,604 INFO L226 Difference]: Without dead ends: 103 [2024-10-31 21:55:33,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 21:55:33,605 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 21:55:33,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 317 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 21:55:33,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-31 21:55:33,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-10-31 21:55:33,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 81 states have (on average 1.2098765432098766) internal successors, (98), 81 states have internal predecessors, (98), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-31 21:55:33,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 138 transitions. [2024-10-31 21:55:33,618 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 138 transitions. Word has length 152 [2024-10-31 21:55:33,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:55:33,619 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 138 transitions. [2024-10-31 21:55:33,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-31 21:55:33,619 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 138 transitions. [2024-10-31 21:55:33,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-31 21:55:33,622 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:55:33,622 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:55:33,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-31 21:55:33,622 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:55:33,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:55:33,623 INFO L85 PathProgramCache]: Analyzing trace with hash 740442552, now seen corresponding path program 1 times [2024-10-31 21:55:33,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:55:33,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783355333] [2024-10-31 21:55:33,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:55:33,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:55:33,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:36,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:55:36,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:36,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 21:55:36,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:36,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 21:55:36,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:36,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 21:55:36,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:36,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 21:55:36,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:36,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 21:55:36,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:36,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 21:55:36,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:36,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 21:55:36,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:36,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 21:55:36,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:36,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 21:55:36,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:36,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 21:55:36,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:36,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 21:55:36,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:36,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 21:55:36,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:36,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 21:55:36,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:36,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 21:55:36,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:36,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-31 21:55:36,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:36,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-31 21:55:36,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:37,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-31 21:55:37,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:37,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-31 21:55:37,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:37,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-31 21:55:37,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:37,031 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-31 21:55:37,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:55:37,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783355333] [2024-10-31 21:55:37,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783355333] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:55:37,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:55:37,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-31 21:55:37,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460340367] [2024-10-31 21:55:37,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:55:37,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-31 21:55:37,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:55:37,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-31 21:55:37,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-31 21:55:37,034 INFO L87 Difference]: Start difference. First operand 103 states and 138 transitions. Second operand has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-31 21:55:38,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:55:38,571 INFO L93 Difference]: Finished difference Result 361 states and 490 transitions. [2024-10-31 21:55:38,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-31 21:55:38,572 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 152 [2024-10-31 21:55:38,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:55:38,574 INFO L225 Difference]: With dead ends: 361 [2024-10-31 21:55:38,576 INFO L226 Difference]: Without dead ends: 261 [2024-10-31 21:55:38,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2024-10-31 21:55:38,577 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 136 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 1152 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 1165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-31 21:55:38,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 776 Invalid, 1165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1152 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-31 21:55:38,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2024-10-31 21:55:38,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 197. [2024-10-31 21:55:38,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 154 states have (on average 1.2012987012987013) internal successors, (185), 154 states have internal predecessors, (185), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-31 21:55:38,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 265 transitions. [2024-10-31 21:55:38,597 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 265 transitions. Word has length 152 [2024-10-31 21:55:38,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:55:38,598 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 265 transitions. [2024-10-31 21:55:38,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-31 21:55:38,598 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 265 transitions. [2024-10-31 21:55:38,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-31 21:55:38,600 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:55:38,600 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:55:38,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-31 21:55:38,601 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:55:38,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:55:38,601 INFO L85 PathProgramCache]: Analyzing trace with hash 855956619, now seen corresponding path program 1 times [2024-10-31 21:55:38,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:55:38,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899365308] [2024-10-31 21:55:38,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:55:38,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:55:38,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:40,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:55:40,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:40,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 21:55:40,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:40,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 21:55:40,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:40,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 21:55:40,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:40,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 21:55:40,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:40,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 21:55:40,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:40,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 21:55:40,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:40,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 21:55:40,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:40,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 21:55:40,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:40,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 21:55:40,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:40,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 21:55:40,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:40,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 21:55:40,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:40,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 21:55:40,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:40,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 21:55:40,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:40,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 21:55:40,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:40,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-31 21:55:40,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:40,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-31 21:55:40,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:40,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-31 21:55:40,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:40,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-31 21:55:40,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:40,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-31 21:55:40,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:40,817 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-31 21:55:40,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:55:40,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899365308] [2024-10-31 21:55:40,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899365308] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:55:40,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:55:40,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-31 21:55:40,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727617727] [2024-10-31 21:55:40,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:55:40,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-31 21:55:40,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:55:40,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-31 21:55:40,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-31 21:55:40,823 INFO L87 Difference]: Start difference. First operand 197 states and 265 transitions. Second operand has 11 states, 10 states have (on average 5.6) internal successors, (56), 11 states have internal predecessors, (56), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-31 21:55:41,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:55:41,743 INFO L93 Difference]: Finished difference Result 363 states and 492 transitions. [2024-10-31 21:55:41,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-31 21:55:41,744 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.6) internal successors, (56), 11 states have internal predecessors, (56), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 153 [2024-10-31 21:55:41,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:55:41,746 INFO L225 Difference]: With dead ends: 363 [2024-10-31 21:55:41,748 INFO L226 Difference]: Without dead ends: 263 [2024-10-31 21:55:41,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2024-10-31 21:55:41,749 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 106 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 942 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-31 21:55:41,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 942 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 709 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-31 21:55:41,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-10-31 21:55:41,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 101. [2024-10-31 21:55:41,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 79 states have (on average 1.2025316455696202) internal successors, (95), 79 states have internal predecessors, (95), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-31 21:55:41,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 135 transitions. [2024-10-31 21:55:41,766 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 135 transitions. Word has length 153 [2024-10-31 21:55:41,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:55:41,766 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 135 transitions. [2024-10-31 21:55:41,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.6) internal successors, (56), 11 states have internal predecessors, (56), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-31 21:55:41,767 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 135 transitions. [2024-10-31 21:55:41,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-31 21:55:41,770 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:55:41,770 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:55:41,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-31 21:55:41,770 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:55:41,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:55:41,771 INFO L85 PathProgramCache]: Analyzing trace with hash -265451400, now seen corresponding path program 1 times [2024-10-31 21:55:41,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:55:41,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2481771] [2024-10-31 21:55:41,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:55:41,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:55:41,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:42,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:55:42,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:42,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 21:55:42,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:43,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 21:55:43,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:43,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 21:55:43,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:43,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 21:55:43,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:43,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 21:55:43,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:43,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 21:55:43,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:43,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 21:55:43,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:43,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 21:55:43,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:43,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 21:55:43,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:43,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 21:55:43,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:43,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 21:55:43,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:43,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 21:55:43,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:43,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 21:55:43,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:43,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 21:55:43,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:43,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-31 21:55:43,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:43,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-31 21:55:43,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:43,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-31 21:55:43,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:43,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-31 21:55:43,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:43,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-31 21:55:43,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:43,059 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-31 21:55:43,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:55:43,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2481771] [2024-10-31 21:55:43,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2481771] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:55:43,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:55:43,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-31 21:55:43,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349833329] [2024-10-31 21:55:43,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:55:43,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 21:55:43,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:55:43,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 21:55:43,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-31 21:55:43,062 INFO L87 Difference]: Start difference. First operand 101 states and 135 transitions. Second operand has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-31 21:55:43,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:55:43,407 INFO L93 Difference]: Finished difference Result 252 states and 332 transitions. [2024-10-31 21:55:43,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 21:55:43,408 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 154 [2024-10-31 21:55:43,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:55:43,410 INFO L225 Difference]: With dead ends: 252 [2024-10-31 21:55:43,410 INFO L226 Difference]: Without dead ends: 154 [2024-10-31 21:55:43,411 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-31 21:55:43,411 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 88 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 21:55:43,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 314 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 21:55:43,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-10-31 21:55:43,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 151. [2024-10-31 21:55:43,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 124 states have (on average 1.2016129032258065) internal successors, (149), 125 states have internal predecessors, (149), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-31 21:55:43,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 197 transitions. [2024-10-31 21:55:43,429 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 197 transitions. Word has length 154 [2024-10-31 21:55:43,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:55:43,433 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 197 transitions. [2024-10-31 21:55:43,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-31 21:55:43,433 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 197 transitions. [2024-10-31 21:55:43,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-31 21:55:43,437 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:55:43,437 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:55:43,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-31 21:55:43,438 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:55:43,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:55:43,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1881220598, now seen corresponding path program 1 times [2024-10-31 21:55:43,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:55:43,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598173330] [2024-10-31 21:55:43,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:55:43,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:55:43,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:43,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:55:43,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:43,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 21:55:43,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:43,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 21:55:43,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:43,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 21:55:43,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:43,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 21:55:43,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:43,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 21:55:43,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:43,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 21:55:43,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:43,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 21:55:43,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:43,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 21:55:43,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:43,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 21:55:43,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:43,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 21:55:43,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:43,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 21:55:43,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:43,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 21:55:43,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:43,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 21:55:43,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:43,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 21:55:43,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:43,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-31 21:55:43,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:43,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-31 21:55:43,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:43,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-31 21:55:43,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:43,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-31 21:55:43,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:43,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-31 21:55:43,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:43,832 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-31 21:55:43,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:55:43,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598173330] [2024-10-31 21:55:43,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598173330] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:55:43,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:55:43,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 21:55:43,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330429786] [2024-10-31 21:55:43,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:55:43,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:55:43,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:55:43,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:55:43,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:55:43,836 INFO L87 Difference]: Start difference. First operand 151 states and 197 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-31 21:55:43,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:55:43,857 INFO L93 Difference]: Finished difference Result 299 states and 391 transitions. [2024-10-31 21:55:43,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:55:43,857 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 154 [2024-10-31 21:55:43,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:55:43,861 INFO L225 Difference]: With dead ends: 299 [2024-10-31 21:55:43,861 INFO L226 Difference]: Without dead ends: 151 [2024-10-31 21:55:43,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:55:43,863 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 21:55:43,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 245 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 21:55:43,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-10-31 21:55:43,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2024-10-31 21:55:43,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 124 states have (on average 1.185483870967742) internal successors, (147), 125 states have internal predecessors, (147), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-31 21:55:43,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 195 transitions. [2024-10-31 21:55:43,882 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 195 transitions. Word has length 154 [2024-10-31 21:55:43,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:55:43,882 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 195 transitions. [2024-10-31 21:55:43,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-31 21:55:43,883 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 195 transitions. [2024-10-31 21:55:43,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-31 21:55:43,885 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:55:43,885 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:55:43,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-31 21:55:43,885 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:55:43,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:55:43,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1819948433, now seen corresponding path program 1 times [2024-10-31 21:55:43,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:55:43,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598368326] [2024-10-31 21:55:43,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:55:43,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:55:44,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:45,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:55:45,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:45,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 21:55:45,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:45,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 21:55:45,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:45,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 21:55:45,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:45,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 21:55:45,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:45,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 21:55:45,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:45,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 21:55:45,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:45,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 21:55:45,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:45,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 21:55:45,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:45,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 21:55:45,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:45,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 21:55:45,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:45,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 21:55:45,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:45,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 21:55:45,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:45,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 21:55:45,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:45,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 21:55:45,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:45,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-31 21:55:45,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:45,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-31 21:55:45,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:45,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-31 21:55:45,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:45,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-31 21:55:45,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:45,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-31 21:55:45,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:45,651 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-31 21:55:45,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:55:45,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598368326] [2024-10-31 21:55:45,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598368326] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:55:45,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:55:45,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-31 21:55:45,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194185570] [2024-10-31 21:55:45,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:55:45,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 21:55:45,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:55:45,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 21:55:45,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-31 21:55:45,654 INFO L87 Difference]: Start difference. First operand 151 states and 195 transitions. Second operand has 8 states, 7 states have (on average 8.428571428571429) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-31 21:55:46,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:55:46,239 INFO L93 Difference]: Finished difference Result 185 states and 236 transitions. [2024-10-31 21:55:46,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-31 21:55:46,240 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.428571428571429) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 156 [2024-10-31 21:55:46,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:55:46,242 INFO L225 Difference]: With dead ends: 185 [2024-10-31 21:55:46,242 INFO L226 Difference]: Without dead ends: 183 [2024-10-31 21:55:46,242 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-31 21:55:46,243 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 49 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-31 21:55:46,244 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 673 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-31 21:55:46,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-10-31 21:55:46,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 182. [2024-10-31 21:55:46,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 145 states have (on average 1.1586206896551725) internal successors, (168), 147 states have internal predecessors, (168), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-31 21:55:46,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 232 transitions. [2024-10-31 21:55:46,269 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 232 transitions. Word has length 156 [2024-10-31 21:55:46,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:55:46,271 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 232 transitions. [2024-10-31 21:55:46,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.428571428571429) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-31 21:55:46,272 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 232 transitions. [2024-10-31 21:55:46,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-31 21:55:46,274 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:55:46,274 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:55:46,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-31 21:55:46,275 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:55:46,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:55:46,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1818101391, now seen corresponding path program 1 times [2024-10-31 21:55:46,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:55:46,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367191305] [2024-10-31 21:55:46,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:55:46,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:55:46,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:48,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:55:48,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:48,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 21:55:48,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:48,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 21:55:48,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:48,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 21:55:48,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:48,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 21:55:48,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:48,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 21:55:48,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:48,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 21:55:48,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:48,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 21:55:48,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:48,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 21:55:48,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:48,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 21:55:48,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:48,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 21:55:48,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:48,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 21:55:48,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:48,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 21:55:48,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:48,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 21:55:48,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:48,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 21:55:48,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:48,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-31 21:55:48,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:48,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-31 21:55:48,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:48,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-31 21:55:48,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:48,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-31 21:55:48,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:48,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-31 21:55:48,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:48,425 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-31 21:55:48,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:55:48,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367191305] [2024-10-31 21:55:48,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367191305] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:55:48,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:55:48,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-31 21:55:48,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35774436] [2024-10-31 21:55:48,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:55:48,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 21:55:48,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:55:48,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 21:55:48,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-31 21:55:48,439 INFO L87 Difference]: Start difference. First operand 182 states and 232 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-31 21:55:49,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:55:49,491 INFO L93 Difference]: Finished difference Result 482 states and 618 transitions. [2024-10-31 21:55:49,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-31 21:55:49,492 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 156 [2024-10-31 21:55:49,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:55:49,495 INFO L225 Difference]: With dead ends: 482 [2024-10-31 21:55:49,495 INFO L226 Difference]: Without dead ends: 324 [2024-10-31 21:55:49,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-10-31 21:55:49,497 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 130 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-31 21:55:49,498 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 500 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 731 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-31 21:55:49,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2024-10-31 21:55:49,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 306. [2024-10-31 21:55:49,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 233 states have (on average 1.1330472103004292) internal successors, (264), 235 states have internal predecessors, (264), 64 states have call successors, (64), 8 states have call predecessors, (64), 8 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-31 21:55:49,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 392 transitions. [2024-10-31 21:55:49,539 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 392 transitions. Word has length 156 [2024-10-31 21:55:49,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:55:49,539 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 392 transitions. [2024-10-31 21:55:49,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-31 21:55:49,540 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 392 transitions. [2024-10-31 21:55:49,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-31 21:55:49,542 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:55:49,543 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:55:49,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-31 21:55:49,543 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:55:49,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:55:49,544 INFO L85 PathProgramCache]: Analyzing trace with hash -43094029, now seen corresponding path program 1 times [2024-10-31 21:55:49,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:55:49,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060293007] [2024-10-31 21:55:49,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:55:49,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:55:49,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:49,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:55:49,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:49,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 21:55:49,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:49,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 21:55:49,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:49,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 21:55:49,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:49,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 21:55:49,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:49,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 21:55:49,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:49,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 21:55:49,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:49,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 21:55:49,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:49,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 21:55:49,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:49,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 21:55:49,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:49,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 21:55:49,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:49,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 21:55:49,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:49,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 21:55:49,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:49,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 21:55:49,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:49,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 21:55:49,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:49,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-31 21:55:49,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:49,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-31 21:55:49,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:49,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-31 21:55:49,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:49,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-31 21:55:49,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:49,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-31 21:55:49,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:49,964 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-31 21:55:49,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:55:49,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060293007] [2024-10-31 21:55:49,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060293007] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:55:49,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:55:49,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 21:55:49,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196354170] [2024-10-31 21:55:49,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:55:49,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 21:55:49,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:55:49,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 21:55:49,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 21:55:49,967 INFO L87 Difference]: Start difference. First operand 306 states and 392 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-31 21:55:50,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:55:50,301 INFO L93 Difference]: Finished difference Result 583 states and 744 transitions. [2024-10-31 21:55:50,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 21:55:50,302 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 156 [2024-10-31 21:55:50,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:55:50,304 INFO L225 Difference]: With dead ends: 583 [2024-10-31 21:55:50,305 INFO L226 Difference]: Without dead ends: 329 [2024-10-31 21:55:50,306 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-31 21:55:50,306 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 95 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 21:55:50,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 506 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 21:55:50,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2024-10-31 21:55:50,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 306. [2024-10-31 21:55:50,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 233 states have (on average 1.1201716738197425) internal successors, (261), 235 states have internal predecessors, (261), 64 states have call successors, (64), 8 states have call predecessors, (64), 8 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-31 21:55:50,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 389 transitions. [2024-10-31 21:55:50,350 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 389 transitions. Word has length 156 [2024-10-31 21:55:50,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:55:50,350 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 389 transitions. [2024-10-31 21:55:50,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-31 21:55:50,351 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 389 transitions. [2024-10-31 21:55:50,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-31 21:55:50,353 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:55:50,353 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:55:50,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-31 21:55:50,353 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:55:50,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:55:50,354 INFO L85 PathProgramCache]: Analyzing trace with hash 636964341, now seen corresponding path program 1 times [2024-10-31 21:55:50,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:55:50,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889574518] [2024-10-31 21:55:50,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:55:50,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:55:50,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:50,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:55:50,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:50,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 21:55:50,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:50,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 21:55:50,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:50,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 21:55:50,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:50,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 21:55:50,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:50,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 21:55:50,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:50,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 21:55:50,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:50,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 21:55:50,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:50,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 21:55:50,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:50,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 21:55:50,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:50,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 21:55:50,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:50,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 21:55:50,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:50,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 21:55:50,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:50,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 21:55:50,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:50,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 21:55:50,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:50,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-31 21:55:50,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:50,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-31 21:55:50,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:50,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-31 21:55:50,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:50,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-31 21:55:50,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:50,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-31 21:55:50,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:50,607 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-31 21:55:50,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:55:50,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889574518] [2024-10-31 21:55:50,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889574518] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:55:50,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:55:50,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 21:55:50,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842827366] [2024-10-31 21:55:50,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:55:50,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 21:55:50,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:55:50,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 21:55:50,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 21:55:50,609 INFO L87 Difference]: Start difference. First operand 306 states and 389 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-31 21:55:50,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:55:50,676 INFO L93 Difference]: Finished difference Result 569 states and 720 transitions. [2024-10-31 21:55:50,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 21:55:50,676 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 156 [2024-10-31 21:55:50,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:55:50,679 INFO L225 Difference]: With dead ends: 569 [2024-10-31 21:55:50,679 INFO L226 Difference]: Without dead ends: 315 [2024-10-31 21:55:50,680 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 21:55:50,681 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 21:55:50,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 472 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 21:55:50,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2024-10-31 21:55:50,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2024-10-31 21:55:50,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 242 states have (on average 1.115702479338843) internal successors, (270), 244 states have internal predecessors, (270), 64 states have call successors, (64), 8 states have call predecessors, (64), 8 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-31 21:55:50,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 398 transitions. [2024-10-31 21:55:50,719 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 398 transitions. Word has length 156 [2024-10-31 21:55:50,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:55:50,720 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 398 transitions. [2024-10-31 21:55:50,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-31 21:55:50,720 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 398 transitions. [2024-10-31 21:55:50,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-31 21:55:50,722 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:55:50,722 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:55:50,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-31 21:55:50,723 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:55:50,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:55:50,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1597318724, now seen corresponding path program 1 times [2024-10-31 21:55:50,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:55:50,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778253232] [2024-10-31 21:55:50,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:55:50,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:55:50,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:51,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:55:51,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:51,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 21:55:51,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:51,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 21:55:51,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:51,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 21:55:51,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:51,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 21:55:51,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:51,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 21:55:51,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:51,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 21:55:51,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:51,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 21:55:51,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:51,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 21:55:51,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:51,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 21:55:51,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:51,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 21:55:51,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:51,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 21:55:51,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:51,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 21:55:51,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:51,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 21:55:51,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:51,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 21:55:51,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:51,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-31 21:55:51,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:51,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-31 21:55:51,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:51,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-31 21:55:51,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:51,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-31 21:55:51,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:51,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-31 21:55:51,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:51,883 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-31 21:55:51,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:55:51,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778253232] [2024-10-31 21:55:51,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778253232] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:55:51,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:55:51,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-31 21:55:51,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726522895] [2024-10-31 21:55:51,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:55:51,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-31 21:55:51,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:55:51,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-31 21:55:51,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-31 21:55:51,886 INFO L87 Difference]: Start difference. First operand 315 states and 398 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20)