./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-71.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_a65781dd-f610-47a4-99e8-b5e57b38ab48/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a65781dd-f610-47a4-99e8-b5e57b38ab48/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_a65781dd-f610-47a4-99e8-b5e57b38ab48/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a65781dd-f610-47a4-99e8-b5e57b38ab48/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-71.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a65781dd-f610-47a4-99e8-b5e57b38ab48/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_a65781dd-f610-47a4-99e8-b5e57b38ab48/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 043b41ee1fabb1e5ed7ee3566b548a40fae9dd3d7487c6064ec51d57b94981a7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:05:17,978 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:05:18,079 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a65781dd-f610-47a4-99e8-b5e57b38ab48/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-31 22:05:18,087 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:05:18,087 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:05:18,125 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:05:18,126 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:05:18,127 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:05:18,128 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:05:18,129 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:05:18,129 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:05:18,130 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:05:18,130 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:05:18,132 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:05:18,133 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:05:18,133 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:05:18,133 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:05:18,134 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:05:18,134 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:05:18,134 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:05:18,135 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:05:18,135 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:05:18,136 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:05:18,136 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:05:18,137 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:05:18,137 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:05:18,137 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:05:18,138 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:05:18,138 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:05:18,138 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:05:18,139 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:05:18,139 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:05:18,140 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:05:18,140 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:05:18,141 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:05:18,141 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:05:18,141 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:05:18,142 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 22:05:18,142 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:05:18,143 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:05:18,143 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:05:18,143 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:05:18,144 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_a65781dd-f610-47a4-99e8-b5e57b38ab48/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_a65781dd-f610-47a4-99e8-b5e57b38ab48/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 -> 043b41ee1fabb1e5ed7ee3566b548a40fae9dd3d7487c6064ec51d57b94981a7 [2024-10-31 22:05:18,408 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:05:18,441 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:05:18,443 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:05:18,445 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:05:18,445 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:05:18,446 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a65781dd-f610-47a4-99e8-b5e57b38ab48/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-71.i Unable to find full path for "g++" [2024-10-31 22:05:20,765 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:05:21,113 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:05:21,121 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a65781dd-f610-47a4-99e8-b5e57b38ab48/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-71.i [2024-10-31 22:05:21,142 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a65781dd-f610-47a4-99e8-b5e57b38ab48/bin/uautomizer-verify-4GaUIPS5ZU/data/ba9680846/f4ccb3d08a5748718dc64e4a82ee0776/FLAG682e2b1d3 [2024-10-31 22:05:21,381 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a65781dd-f610-47a4-99e8-b5e57b38ab48/bin/uautomizer-verify-4GaUIPS5ZU/data/ba9680846/f4ccb3d08a5748718dc64e4a82ee0776 [2024-10-31 22:05:21,384 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:05:21,386 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:05:21,388 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:05:21,388 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:05:21,395 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:05:21,396 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:05:21" (1/1) ... [2024-10-31 22:05:21,397 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7826e82a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:05:21, skipping insertion in model container [2024-10-31 22:05:21,397 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:05:21" (1/1) ... [2024-10-31 22:05:21,429 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:05:21,634 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_a65781dd-f610-47a4-99e8-b5e57b38ab48/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-71.i[917,930] [2024-10-31 22:05:21,706 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:05:21,720 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:05:21,731 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_a65781dd-f610-47a4-99e8-b5e57b38ab48/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-71.i[917,930] [2024-10-31 22:05:21,776 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:05:21,805 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:05:21,805 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:05:21 WrapperNode [2024-10-31 22:05:21,806 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:05:21,807 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:05:21,807 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:05:21,808 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:05:21,815 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:05:21" (1/1) ... [2024-10-31 22:05:21,831 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:05:21" (1/1) ... [2024-10-31 22:05:21,884 INFO L138 Inliner]: procedures = 27, calls = 169, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 502 [2024-10-31 22:05:21,884 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:05:21,885 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:05:21,885 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:05:21,885 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:05:21,900 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:05:21" (1/1) ... [2024-10-31 22:05:21,900 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:05:21" (1/1) ... [2024-10-31 22:05:21,906 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:05:21" (1/1) ... [2024-10-31 22:05:21,930 INFO L175 MemorySlicer]: Split 139 memory accesses to 2 slices as follows [2, 137]. 99 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 22:05:21,931 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:05:21" (1/1) ... [2024-10-31 22:05:21,931 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:05:21" (1/1) ... [2024-10-31 22:05:21,946 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:05:21" (1/1) ... [2024-10-31 22:05:21,951 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:05:21" (1/1) ... [2024-10-31 22:05:21,953 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:05:21" (1/1) ... [2024-10-31 22:05:21,956 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:05:21" (1/1) ... [2024-10-31 22:05:21,962 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:05:21,963 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:05:21,963 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:05:21,963 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:05:21,964 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:05:21" (1/1) ... [2024-10-31 22:05:21,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:05:21,991 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a65781dd-f610-47a4-99e8-b5e57b38ab48/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:05:22,021 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a65781dd-f610-47a4-99e8-b5e57b38ab48/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:05:22,025 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a65781dd-f610-47a4-99e8-b5e57b38ab48/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:05:22,062 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:05:22,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2024-10-31 22:05:22,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2024-10-31 22:05:22,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-31 22:05:22,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-31 22:05:22,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-31 22:05:22,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-31 22:05:22,064 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-31 22:05:22,064 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-31 22:05:22,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 22:05:22,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-31 22:05:22,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:05:22,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:05:22,237 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:05:22,239 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:05:23,004 INFO L? ?]: Removed 126 outVars from TransFormulas that were not future-live. [2024-10-31 22:05:23,004 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:05:23,025 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:05:23,026 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 22:05:23,027 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:05:23 BoogieIcfgContainer [2024-10-31 22:05:23,027 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:05:23,030 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:05:23,031 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:05:23,035 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:05:23,035 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:05:21" (1/3) ... [2024-10-31 22:05:23,037 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1011f822 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:05:23, skipping insertion in model container [2024-10-31 22:05:23,037 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:05:21" (2/3) ... [2024-10-31 22:05:23,039 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1011f822 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:05:23, skipping insertion in model container [2024-10-31 22:05:23,039 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:05:23" (3/3) ... [2024-10-31 22:05:23,042 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-71.i [2024-10-31 22:05:23,063 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:05:23,064 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-31 22:05:23,147 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:05:23,155 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;@9e788ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:05:23,156 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-31 22:05:23,161 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 83 states have (on average 1.3855421686746987) internal successors, (115), 84 states have internal predecessors, (115), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-31 22:05:23,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-31 22:05:23,185 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:05:23,186 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:05:23,187 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:05:23,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:05:23,193 INFO L85 PathProgramCache]: Analyzing trace with hash -312506901, now seen corresponding path program 1 times [2024-10-31 22:05:23,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:05:23,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799978481] [2024-10-31 22:05:23,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:05:23,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:05:23,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:23,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:05:23,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:23,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:05:23,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:23,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:05:23,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:23,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:05:23,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:23,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:05:23,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:23,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:05:23,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:23,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:05:23,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:23,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:05:23,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:23,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 22:05:23,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:23,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:05:23,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:23,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:05:23,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:23,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:05:23,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:23,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:05:23,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:23,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:05:23,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:23,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 22:05:23,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:23,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-31 22:05:23,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:23,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-31 22:05:23,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:23,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-31 22:05:23,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:23,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-31 22:05:23,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:23,812 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-31 22:05:23,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:05:23,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799978481] [2024-10-31 22:05:23,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799978481] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:05:23,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:05:23,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:05:23,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869738366] [2024-10-31 22:05:23,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:05:23,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-31 22:05:23,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:05:23,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-31 22:05:23,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 22:05:23,857 INFO L87 Difference]: Start difference. First operand has 105 states, 83 states have (on average 1.3855421686746987) internal successors, (115), 84 states have internal predecessors, (115), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-31 22:05:23,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:05:23,906 INFO L93 Difference]: Finished difference Result 203 states and 319 transitions. [2024-10-31 22:05:23,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-31 22:05:23,908 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 144 [2024-10-31 22:05:23,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:05:23,919 INFO L225 Difference]: With dead ends: 203 [2024-10-31 22:05:23,920 INFO L226 Difference]: Without dead ends: 101 [2024-10-31 22:05:23,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 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 22:05:23,929 INFO L432 NwaCegarLoop]: 144 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, 144 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 22:05:23,930 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:05:23,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-31 22:05:23,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-10-31 22:05:23,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 80 states have (on average 1.325) internal successors, (106), 80 states have internal predecessors, (106), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-31 22:05:23,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 144 transitions. [2024-10-31 22:05:23,989 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 144 transitions. Word has length 144 [2024-10-31 22:05:23,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:05:23,989 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 144 transitions. [2024-10-31 22:05:23,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-31 22:05:23,990 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 144 transitions. [2024-10-31 22:05:23,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-31 22:05:23,994 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:05:23,994 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:05:23,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 22:05:23,995 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:05:23,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:05:23,996 INFO L85 PathProgramCache]: Analyzing trace with hash 693008529, now seen corresponding path program 1 times [2024-10-31 22:05:23,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:05:23,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734836132] [2024-10-31 22:05:23,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:05:23,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:05:24,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:24,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:05:24,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:24,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:05:24,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:24,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:05:24,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:24,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:05:24,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:24,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:05:24,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:24,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:05:24,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:24,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:05:24,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:24,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:05:24,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:24,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 22:05:24,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:24,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:05:24,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:24,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:05:24,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:24,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:05:24,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:24,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:05:24,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:24,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:05:24,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:24,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 22:05:24,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:24,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-31 22:05:24,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:24,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-31 22:05:24,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:24,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-31 22:05:24,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:24,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-31 22:05:24,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:24,645 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-31 22:05:24,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:05:24,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734836132] [2024-10-31 22:05:24,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734836132] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:05:24,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:05:24,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:05:24,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239726801] [2024-10-31 22:05:24,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:05:24,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:05:24,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:05:24,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:05:24,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:05:24,650 INFO L87 Difference]: Start difference. First operand 101 states and 144 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-31 22:05:24,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:05:24,720 INFO L93 Difference]: Finished difference Result 202 states and 289 transitions. [2024-10-31 22:05:24,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:05:24,721 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 144 [2024-10-31 22:05:24,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:05:24,724 INFO L225 Difference]: With dead ends: 202 [2024-10-31 22:05:24,724 INFO L226 Difference]: Without dead ends: 104 [2024-10-31 22:05:24,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 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 22:05:24,729 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 1 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 412 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 22:05:24,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 412 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:05:24,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-31 22:05:24,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2024-10-31 22:05:24,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 82 states have (on average 1.3170731707317074) internal successors, (108), 82 states have internal predecessors, (108), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-31 22:05:24,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 146 transitions. [2024-10-31 22:05:24,755 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 146 transitions. Word has length 144 [2024-10-31 22:05:24,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:05:24,757 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 146 transitions. [2024-10-31 22:05:24,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-31 22:05:24,759 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 146 transitions. [2024-10-31 22:05:24,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-31 22:05:24,761 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:05:24,762 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:05:24,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 22:05:24,762 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:05:24,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:05:24,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1826951405, now seen corresponding path program 1 times [2024-10-31 22:05:24,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:05:24,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834054158] [2024-10-31 22:05:24,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:05:24,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:05:24,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:25,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:05:25,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:25,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:05:25,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:25,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:05:25,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:25,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:05:25,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:25,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:05:25,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:25,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:05:25,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:25,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:05:25,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:25,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:05:25,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:25,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 22:05:25,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:25,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:05:25,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:25,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:05:25,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:25,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:05:25,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:25,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:05:25,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:25,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:05:25,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:25,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 22:05:25,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:25,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-31 22:05:25,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:25,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-31 22:05:25,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:25,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-31 22:05:25,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:25,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-31 22:05:25,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:25,149 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-31 22:05:25,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:05:25,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834054158] [2024-10-31 22:05:25,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834054158] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:05:25,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:05:25,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:05:25,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21260137] [2024-10-31 22:05:25,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:05:25,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:05:25,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:05:25,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:05:25,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:05:25,159 INFO L87 Difference]: Start difference. First operand 103 states and 146 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-31 22:05:25,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:05:25,207 INFO L93 Difference]: Finished difference Result 206 states and 293 transitions. [2024-10-31 22:05:25,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:05:25,211 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 144 [2024-10-31 22:05:25,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:05:25,213 INFO L225 Difference]: With dead ends: 206 [2024-10-31 22:05:25,213 INFO L226 Difference]: Without dead ends: 106 [2024-10-31 22:05:25,214 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 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 22:05:25,215 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 1 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 415 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 22:05:25,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 415 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:05:25,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-31 22:05:25,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2024-10-31 22:05:25,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 84 states have (on average 1.3095238095238095) internal successors, (110), 84 states have internal predecessors, (110), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-31 22:05:25,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 148 transitions. [2024-10-31 22:05:25,226 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 148 transitions. Word has length 144 [2024-10-31 22:05:25,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:05:25,227 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 148 transitions. [2024-10-31 22:05:25,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-31 22:05:25,228 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 148 transitions. [2024-10-31 22:05:25,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-31 22:05:25,230 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:05:25,230 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:05:25,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 22:05:25,231 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:05:25,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:05:25,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1825104363, now seen corresponding path program 1 times [2024-10-31 22:05:25,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:05:25,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952605727] [2024-10-31 22:05:25,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:05:25,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:05:25,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:27,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:05:27,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:27,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:05:27,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:27,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:05:27,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:27,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:05:27,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:27,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:05:27,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:27,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:05:27,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:27,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:05:27,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:27,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:05:27,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:27,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 22:05:27,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:27,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:05:27,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:27,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:05:27,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:27,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:05:27,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:27,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:05:27,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:27,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:05:27,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:27,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 22:05:27,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:27,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-31 22:05:27,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:27,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-31 22:05:27,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:27,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-31 22:05:27,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:27,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-31 22:05:27,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:27,235 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-31 22:05:27,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:05:27,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952605727] [2024-10-31 22:05:27,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952605727] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:05:27,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:05:27,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-31 22:05:27,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178810598] [2024-10-31 22:05:27,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:05:27,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 22:05:27,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:05:27,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 22:05:27,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:05:27,243 INFO L87 Difference]: Start difference. First operand 105 states and 148 transitions. Second operand has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-10-31 22:05:28,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:05:28,266 INFO L93 Difference]: Finished difference Result 241 states and 338 transitions. [2024-10-31 22:05:28,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-31 22:05:28,268 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 144 [2024-10-31 22:05:28,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:05:28,270 INFO L225 Difference]: With dead ends: 241 [2024-10-31 22:05:28,270 INFO L226 Difference]: Without dead ends: 139 [2024-10-31 22:05:28,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-10-31 22:05:28,272 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 138 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-31 22:05:28,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 271 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-31 22:05:28,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-10-31 22:05:28,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 132. [2024-10-31 22:05:28,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 100 states have (on average 1.26) internal successors, (126), 101 states have internal predecessors, (126), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-31 22:05:28,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 184 transitions. [2024-10-31 22:05:28,313 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 184 transitions. Word has length 144 [2024-10-31 22:05:28,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:05:28,314 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 184 transitions. [2024-10-31 22:05:28,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-10-31 22:05:28,314 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 184 transitions. [2024-10-31 22:05:28,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-31 22:05:28,316 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:05:28,316 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:05:28,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 22:05:28,317 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:05:28,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:05:28,318 INFO L85 PathProgramCache]: Analyzing trace with hash -872708680, now seen corresponding path program 1 times [2024-10-31 22:05:28,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:05:28,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697526059] [2024-10-31 22:05:28,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:05:28,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:05:28,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:31,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:05:31,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:31,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:05:31,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:31,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:05:31,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:31,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:05:31,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:31,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:05:31,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:31,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:05:31,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:31,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:05:31,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:31,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:05:31,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:31,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 22:05:31,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:31,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:05:31,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:31,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:05:31,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:31,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:05:31,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:31,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:05:31,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:31,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:05:31,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:31,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 22:05:31,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:31,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-31 22:05:31,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:31,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-31 22:05:31,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:31,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-31 22:05:31,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:31,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-31 22:05:31,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:31,714 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-31 22:05:31,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:05:31,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697526059] [2024-10-31 22:05:31,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697526059] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:05:31,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:05:31,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-31 22:05:31,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514738663] [2024-10-31 22:05:31,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:05:31,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-31 22:05:31,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:05:31,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-31 22:05:31,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-10-31 22:05:31,718 INFO L87 Difference]: Start difference. First operand 132 states and 184 transitions. Second operand has 11 states, 10 states have (on average 5.3) internal successors, (53), 11 states have internal predecessors, (53), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-10-31 22:05:33,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:05:33,543 INFO L93 Difference]: Finished difference Result 321 states and 451 transitions. [2024-10-31 22:05:33,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-31 22:05:33,544 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.3) internal successors, (53), 11 states have internal predecessors, (53), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 145 [2024-10-31 22:05:33,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:05:33,550 INFO L225 Difference]: With dead ends: 321 [2024-10-31 22:05:33,550 INFO L226 Difference]: Without dead ends: 217 [2024-10-31 22:05:33,551 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-10-31 22:05:33,555 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 340 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:05:33,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 464 Invalid, 804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 718 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-31 22:05:33,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-10-31 22:05:33,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 175. [2024-10-31 22:05:33,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 143 states have (on average 1.3076923076923077) internal successors, (187), 144 states have internal predecessors, (187), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-31 22:05:33,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 245 transitions. [2024-10-31 22:05:33,617 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 245 transitions. Word has length 145 [2024-10-31 22:05:33,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:05:33,619 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 245 transitions. [2024-10-31 22:05:33,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.3) internal successors, (53), 11 states have internal predecessors, (53), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-10-31 22:05:33,620 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 245 transitions. [2024-10-31 22:05:33,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-31 22:05:33,624 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:05:33,625 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:05:33,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 22:05:33,625 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:05:33,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:05:33,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1111641874, now seen corresponding path program 1 times [2024-10-31 22:05:33,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:05:33,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199739540] [2024-10-31 22:05:33,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:05:33,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:05:33,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:37,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:05:37,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:37,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:05:37,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:37,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:05:37,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:37,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:05:37,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:37,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:05:37,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:37,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:05:37,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:37,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:05:37,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:37,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:05:37,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:37,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 22:05:37,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:37,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:05:37,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:37,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:05:37,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:37,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:05:37,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:37,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:05:37,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:37,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:05:37,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:37,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 22:05:37,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:37,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-31 22:05:37,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:37,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-31 22:05:37,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:37,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-31 22:05:37,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:37,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-31 22:05:37,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:37,629 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-31 22:05:37,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:05:37,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199739540] [2024-10-31 22:05:37,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199739540] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:05:37,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:05:37,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-31 22:05:37,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240310411] [2024-10-31 22:05:37,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:05:37,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-31 22:05:37,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:05:37,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-31 22:05:37,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-10-31 22:05:37,632 INFO L87 Difference]: Start difference. First operand 175 states and 245 transitions. Second operand has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 12 states have internal predecessors, (54), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-10-31 22:05:39,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:05:39,376 INFO L93 Difference]: Finished difference Result 399 states and 558 transitions. [2024-10-31 22:05:39,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-31 22:05:39,377 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 12 states have internal predecessors, (54), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 146 [2024-10-31 22:05:39,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:05:39,379 INFO L225 Difference]: With dead ends: 399 [2024-10-31 22:05:39,379 INFO L226 Difference]: Without dead ends: 227 [2024-10-31 22:05:39,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2024-10-31 22:05:39,383 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 239 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 710 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:05:39,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 615 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 710 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-31 22:05:39,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-10-31 22:05:39,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 188. [2024-10-31 22:05:39,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 156 states have (on average 1.3205128205128205) internal successors, (206), 157 states have internal predecessors, (206), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-31 22:05:39,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 264 transitions. [2024-10-31 22:05:39,433 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 264 transitions. Word has length 146 [2024-10-31 22:05:39,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:05:39,434 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 264 transitions. [2024-10-31 22:05:39,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 12 states have internal predecessors, (54), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-10-31 22:05:39,435 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 264 transitions. [2024-10-31 22:05:39,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-31 22:05:39,437 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:05:39,437 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:05:39,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 22:05:39,438 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:05:39,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:05:39,439 INFO L85 PathProgramCache]: Analyzing trace with hash 704073845, now seen corresponding path program 1 times [2024-10-31 22:05:39,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:05:39,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017523976] [2024-10-31 22:05:39,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:05:39,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:05:39,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:42,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:05:42,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:42,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:05:42,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:42,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:05:42,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:42,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:05:42,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:42,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:05:42,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:42,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:05:42,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:42,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:05:42,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:42,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:05:42,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:42,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 22:05:42,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:42,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:05:42,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:42,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:05:42,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:42,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:05:42,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:42,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:05:42,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:42,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:05:42,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:42,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 22:05:42,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:42,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-31 22:05:42,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:42,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-31 22:05:42,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:42,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-31 22:05:42,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:42,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-31 22:05:42,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:05:42,572 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-31 22:05:42,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:05:42,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017523976] [2024-10-31 22:05:42,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017523976] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:05:42,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:05:42,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-31 22:05:42,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663453685] [2024-10-31 22:05:42,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:05:42,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-31 22:05:42,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:05:42,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-31 22:05:42,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-10-31 22:05:42,576 INFO L87 Difference]: Start difference. First operand 188 states and 264 transitions. Second operand has 13 states, 12 states have (on average 4.5) internal successors, (54), 13 states have internal predecessors, (54), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-10-31 22:05:44,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:05:44,743 INFO L93 Difference]: Finished difference Result 480 states and 672 transitions. [2024-10-31 22:05:44,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-31 22:05:44,744 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.5) internal successors, (54), 13 states have internal predecessors, (54), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 146 [2024-10-31 22:05:44,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:05:44,748 INFO L225 Difference]: With dead ends: 480 [2024-10-31 22:05:44,748 INFO L226 Difference]: Without dead ends: 295 [2024-10-31 22:05:44,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2024-10-31 22:05:44,752 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 430 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 927 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 1011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-31 22:05:44,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 472 Invalid, 1011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 927 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-31 22:05:44,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-10-31 22:05:44,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 188. [2024-10-31 22:05:44,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 156 states have (on average 1.3205128205128205) internal successors, (206), 157 states have internal predecessors, (206), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-31 22:05:44,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 264 transitions. [2024-10-31 22:05:44,826 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 264 transitions. Word has length 146 [2024-10-31 22:05:44,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:05:44,827 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 264 transitions. [2024-10-31 22:05:44,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.5) internal successors, (54), 13 states have internal predecessors, (54), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-10-31 22:05:44,828 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 264 transitions. [2024-10-31 22:05:44,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-31 22:05:44,830 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:05:44,830 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:05:44,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 22:05:44,831 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:05:44,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:05:44,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1492049167, now seen corresponding path program 1 times [2024-10-31 22:05:44,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:05:44,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309997727] [2024-10-31 22:05:44,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:05:44,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:05:45,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat