./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-8.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bf67463-e4e4-4f7e-95cb-db430f72595d/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bf67463-e4e4-4f7e-95cb-db430f72595d/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bf67463-e4e4-4f7e-95cb-db430f72595d/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bf67463-e4e4-4f7e-95cb-db430f72595d/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-8.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bf67463-e4e4-4f7e-95cb-db430f72595d/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bf67463-e4e4-4f7e-95cb-db430f72595d/bin/uautomizer-verify-BQ2R08f2Ya --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 2adf86622f346d8406b4270c76c12e01b0cd0b4263eaaf0f4abdb5436079ce86 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 07:05:22,215 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 07:05:22,276 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bf67463-e4e4-4f7e-95cb-db430f72595d/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 07:05:22,281 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 07:05:22,282 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 07:05:22,306 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 07:05:22,307 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 07:05:22,307 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 07:05:22,308 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 07:05:22,308 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 07:05:22,309 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 07:05:22,309 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 07:05:22,310 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 07:05:22,311 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 07:05:22,311 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 07:05:22,312 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 07:05:22,312 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 07:05:22,313 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 07:05:22,313 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 07:05:22,314 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 07:05:22,314 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 07:05:22,315 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 07:05:22,315 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 07:05:22,316 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 07:05:22,316 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 07:05:22,317 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 07:05:22,317 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 07:05:22,318 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 07:05:22,318 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 07:05:22,318 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 07:05:22,319 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 07:05:22,319 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 07:05:22,319 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 07:05:22,320 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 07:05:22,320 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 07:05:22,320 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 07:05:22,320 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 07:05:22,320 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 07:05:22,321 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 07:05:22,321 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 07:05:22,321 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 07:05:22,321 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 07:05:22,321 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_3bf67463-e4e4-4f7e-95cb-db430f72595d/bin/uautomizer-verify-BQ2R08f2Ya/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_3bf67463-e4e4-4f7e-95cb-db430f72595d/bin/uautomizer-verify-BQ2R08f2Ya 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 -> 2adf86622f346d8406b4270c76c12e01b0cd0b4263eaaf0f4abdb5436079ce86 [2023-11-29 07:05:22,516 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 07:05:22,534 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 07:05:22,536 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 07:05:22,537 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 07:05:22,538 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 07:05:22,539 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bf67463-e4e4-4f7e-95cb-db430f72595d/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-8.i [2023-11-29 07:05:25,327 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 07:05:25,517 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 07:05:25,518 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bf67463-e4e4-4f7e-95cb-db430f72595d/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-8.i [2023-11-29 07:05:25,527 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bf67463-e4e4-4f7e-95cb-db430f72595d/bin/uautomizer-verify-BQ2R08f2Ya/data/602f6d6a4/c1ee8fc3c8874ed0bb40edf720230b20/FLAG9a73bc263 [2023-11-29 07:05:25,542 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bf67463-e4e4-4f7e-95cb-db430f72595d/bin/uautomizer-verify-BQ2R08f2Ya/data/602f6d6a4/c1ee8fc3c8874ed0bb40edf720230b20 [2023-11-29 07:05:25,545 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 07:05:25,546 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 07:05:25,548 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 07:05:25,548 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 07:05:25,553 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 07:05:25,553 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 07:05:25" (1/1) ... [2023-11-29 07:05:25,554 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cca9317 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:05:25, skipping insertion in model container [2023-11-29 07:05:25,555 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 07:05:25" (1/1) ... [2023-11-29 07:05:25,586 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 07:05:25,727 WARN L240 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_3bf67463-e4e4-4f7e-95cb-db430f72595d/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-8.i[916,929] [2023-11-29 07:05:25,785 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 07:05:25,799 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 07:05:25,812 WARN L240 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_3bf67463-e4e4-4f7e-95cb-db430f72595d/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-8.i[916,929] [2023-11-29 07:05:25,848 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 07:05:25,870 INFO L206 MainTranslator]: Completed translation [2023-11-29 07:05:25,870 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:05:25 WrapperNode [2023-11-29 07:05:25,870 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 07:05:25,871 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 07:05:25,872 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 07:05:25,872 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 07:05:25,878 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:05:25" (1/1) ... [2023-11-29 07:05:25,890 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:05:25" (1/1) ... [2023-11-29 07:05:25,922 INFO L138 Inliner]: procedures = 29, calls = 152, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 408 [2023-11-29 07:05:25,922 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 07:05:25,923 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 07:05:25,923 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 07:05:25,923 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 07:05:25,933 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:05:25" (1/1) ... [2023-11-29 07:05:25,933 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:05:25" (1/1) ... [2023-11-29 07:05:25,940 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:05:25" (1/1) ... [2023-11-29 07:05:25,960 INFO L175 MemorySlicer]: Split 126 memory accesses to 2 slices as follows [2, 124]. 98 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 15]. The 19 writes are split as follows [0, 19]. [2023-11-29 07:05:25,960 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:05:25" (1/1) ... [2023-11-29 07:05:25,961 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:05:25" (1/1) ... [2023-11-29 07:05:25,978 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:05:25" (1/1) ... [2023-11-29 07:05:25,983 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:05:25" (1/1) ... [2023-11-29 07:05:25,986 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:05:25" (1/1) ... [2023-11-29 07:05:25,989 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:05:25" (1/1) ... [2023-11-29 07:05:25,995 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 07:05:25,996 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 07:05:25,996 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 07:05:25,996 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 07:05:25,997 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:05:25" (1/1) ... [2023-11-29 07:05:26,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 07:05:26,013 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bf67463-e4e4-4f7e-95cb-db430f72595d/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 07:05:26,025 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bf67463-e4e4-4f7e-95cb-db430f72595d/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 07:05:26,030 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bf67463-e4e4-4f7e-95cb-db430f72595d/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 07:05:26,058 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 07:05:26,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 07:05:26,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 07:05:26,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-11-29 07:05:26,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-11-29 07:05:26,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-11-29 07:05:26,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-11-29 07:05:26,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 07:05:26,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 07:05:26,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-11-29 07:05:26,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-11-29 07:05:26,059 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 07:05:26,059 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 07:05:26,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 07:05:26,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 07:05:26,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 07:05:26,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 07:05:26,179 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 07:05:26,181 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 07:05:26,557 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 07:05:26,591 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 07:05:26,592 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 07:05:26,592 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:05:26 BoogieIcfgContainer [2023-11-29 07:05:26,592 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 07:05:26,595 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 07:05:26,595 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 07:05:26,598 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 07:05:26,598 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 07:05:25" (1/3) ... [2023-11-29 07:05:26,598 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53780188 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 07:05:26, skipping insertion in model container [2023-11-29 07:05:26,599 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:05:25" (2/3) ... [2023-11-29 07:05:26,599 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53780188 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 07:05:26, skipping insertion in model container [2023-11-29 07:05:26,599 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:05:26" (3/3) ... [2023-11-29 07:05:26,600 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-8.i [2023-11-29 07:05:26,614 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 07:05:26,614 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 07:05:26,656 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 07:05:26,661 INFO L357 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, mHoare=true, 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;@2f4d2758, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 07:05:26,661 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 07:05:26,665 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 76 states have (on average 1.4473684210526316) internal successors, (110), 77 states have internal predecessors, (110), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-29 07:05:26,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-29 07:05:26,677 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:05:26,678 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:05:26,678 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:05:26,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:05:26,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1665721735, now seen corresponding path program 1 times [2023-11-29 07:05:26,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:05:26,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086214481] [2023-11-29 07:05:26,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:05:26,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:05:26,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:26,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:05:26,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:26,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 07:05:26,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:26,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 07:05:26,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:26,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 07:05:26,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:26,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 07:05:26,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:26,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 07:05:26,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:26,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 07:05:26,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:26,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 07:05:26,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:26,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 07:05:26,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:26,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 07:05:27,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:27,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 07:05:27,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:27,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 07:05:27,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:27,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 07:05:27,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:27,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 07:05:27,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:27,024 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-11-29 07:05:27,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:05:27,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086214481] [2023-11-29 07:05:27,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086214481] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:05:27,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:05:27,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 07:05:27,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678788306] [2023-11-29 07:05:27,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:05:27,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 07:05:27,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:05:27,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 07:05:27,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 07:05:27,058 INFO L87 Difference]: Start difference. First operand has 93 states, 76 states have (on average 1.4473684210526316) internal successors, (110), 77 states have internal predecessors, (110), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-29 07:05:27,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:05:27,101 INFO L93 Difference]: Finished difference Result 183 states and 288 transitions. [2023-11-29 07:05:27,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 07:05:27,104 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 118 [2023-11-29 07:05:27,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:05:27,112 INFO L225 Difference]: With dead ends: 183 [2023-11-29 07:05:27,112 INFO L226 Difference]: Without dead ends: 91 [2023-11-29 07:05:27,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 07:05:27,120 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 07:05:27,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 07:05:27,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-11-29 07:05:27,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2023-11-29 07:05:27,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 75 states have (on average 1.4) internal successors, (105), 75 states have internal predecessors, (105), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-29 07:05:27,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 133 transitions. [2023-11-29 07:05:27,174 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 133 transitions. Word has length 118 [2023-11-29 07:05:27,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:05:27,174 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 133 transitions. [2023-11-29 07:05:27,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-29 07:05:27,175 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 133 transitions. [2023-11-29 07:05:27,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-29 07:05:27,178 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:05:27,179 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:05:27,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 07:05:27,179 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:05:27,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:05:27,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1494754021, now seen corresponding path program 1 times [2023-11-29 07:05:27,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:05:27,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300919950] [2023-11-29 07:05:27,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:05:27,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:05:27,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:27,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:05:27,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:27,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 07:05:27,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:27,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 07:05:27,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:27,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 07:05:27,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:27,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 07:05:27,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:27,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 07:05:27,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:27,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 07:05:27,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:27,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 07:05:27,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:27,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 07:05:27,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:27,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 07:05:27,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:27,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 07:05:27,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:27,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 07:05:27,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:27,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 07:05:27,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:27,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 07:05:27,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:27,500 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-11-29 07:05:27,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:05:27,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300919950] [2023-11-29 07:05:27,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300919950] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:05:27,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:05:27,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 07:05:27,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833538284] [2023-11-29 07:05:27,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:05:27,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 07:05:27,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:05:27,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 07:05:27,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 07:05:27,504 INFO L87 Difference]: Start difference. First operand 91 states and 133 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-29 07:05:27,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:05:27,566 INFO L93 Difference]: Finished difference Result 193 states and 282 transitions. [2023-11-29 07:05:27,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 07:05:27,567 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2023-11-29 07:05:27,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:05:27,570 INFO L225 Difference]: With dead ends: 193 [2023-11-29 07:05:27,570 INFO L226 Difference]: Without dead ends: 103 [2023-11-29 07:05:27,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 07:05:27,573 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 21 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 07:05:27,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 378 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 07:05:27,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-11-29 07:05:27,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 93. [2023-11-29 07:05:27,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 77 states have (on average 1.3896103896103895) internal successors, (107), 77 states have internal predecessors, (107), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-29 07:05:27,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 135 transitions. [2023-11-29 07:05:27,588 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 135 transitions. Word has length 118 [2023-11-29 07:05:27,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:05:27,589 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 135 transitions. [2023-11-29 07:05:27,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-29 07:05:27,590 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 135 transitions. [2023-11-29 07:05:27,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-29 07:05:27,593 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:05:27,593 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:05:27,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 07:05:27,593 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:05:27,594 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:05:27,594 INFO L85 PathProgramCache]: Analyzing trace with hash 685407395, now seen corresponding path program 1 times [2023-11-29 07:05:27,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:05:27,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241378641] [2023-11-29 07:05:27,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:05:27,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:05:27,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:27,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:05:27,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:27,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 07:05:27,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:27,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 07:05:27,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:27,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 07:05:27,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:27,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 07:05:27,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:27,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 07:05:27,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:27,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 07:05:27,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:27,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 07:05:27,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:27,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 07:05:27,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:27,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 07:05:27,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:27,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 07:05:27,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:27,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 07:05:27,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:27,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 07:05:27,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:27,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 07:05:27,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:27,843 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-11-29 07:05:27,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:05:27,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241378641] [2023-11-29 07:05:27,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241378641] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:05:27,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:05:27,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 07:05:27,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752443427] [2023-11-29 07:05:27,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:05:27,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 07:05:27,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:05:27,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 07:05:27,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 07:05:27,846 INFO L87 Difference]: Start difference. First operand 93 states and 135 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-29 07:05:27,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:05:27,893 INFO L93 Difference]: Finished difference Result 193 states and 280 transitions. [2023-11-29 07:05:27,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 07:05:27,894 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2023-11-29 07:05:27,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:05:27,896 INFO L225 Difference]: With dead ends: 193 [2023-11-29 07:05:27,896 INFO L226 Difference]: Without dead ends: 101 [2023-11-29 07:05:27,897 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 07:05:27,898 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 12 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 07:05:27,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 376 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 07:05:27,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-11-29 07:05:27,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 95. [2023-11-29 07:05:27,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 79 states have (on average 1.379746835443038) internal successors, (109), 79 states have internal predecessors, (109), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-29 07:05:27,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 137 transitions. [2023-11-29 07:05:27,909 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 137 transitions. Word has length 118 [2023-11-29 07:05:27,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:05:27,910 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 137 transitions. [2023-11-29 07:05:27,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-29 07:05:27,910 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 137 transitions. [2023-11-29 07:05:27,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-29 07:05:27,913 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:05:27,913 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:05:27,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 07:05:27,913 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:05:27,914 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:05:27,914 INFO L85 PathProgramCache]: Analyzing trace with hash 742665697, now seen corresponding path program 1 times [2023-11-29 07:05:27,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:05:27,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457431822] [2023-11-29 07:05:27,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:05:27,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:05:27,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:28,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:05:28,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:28,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 07:05:28,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:28,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 07:05:28,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:28,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 07:05:28,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:28,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 07:05:28,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:28,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 07:05:28,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:28,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 07:05:28,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:28,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 07:05:28,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:28,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 07:05:28,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:28,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 07:05:28,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:28,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 07:05:28,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:28,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 07:05:28,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:28,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 07:05:28,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:28,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 07:05:28,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:28,094 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-11-29 07:05:28,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:05:28,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457431822] [2023-11-29 07:05:28,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457431822] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:05:28,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:05:28,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 07:05:28,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285887961] [2023-11-29 07:05:28,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:05:28,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 07:05:28,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:05:28,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 07:05:28,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 07:05:28,097 INFO L87 Difference]: Start difference. First operand 95 states and 137 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-29 07:05:28,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:05:28,136 INFO L93 Difference]: Finished difference Result 193 states and 278 transitions. [2023-11-29 07:05:28,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 07:05:28,137 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2023-11-29 07:05:28,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:05:28,138 INFO L225 Difference]: With dead ends: 193 [2023-11-29 07:05:28,138 INFO L226 Difference]: Without dead ends: 99 [2023-11-29 07:05:28,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 07:05:28,140 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 3 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 07:05:28,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 376 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 07:05:28,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-11-29 07:05:28,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2023-11-29 07:05:28,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 81 states have (on average 1.3703703703703705) internal successors, (111), 81 states have internal predecessors, (111), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-29 07:05:28,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 139 transitions. [2023-11-29 07:05:28,149 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 139 transitions. Word has length 118 [2023-11-29 07:05:28,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:05:28,150 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 139 transitions. [2023-11-29 07:05:28,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-29 07:05:28,150 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 139 transitions. [2023-11-29 07:05:28,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-29 07:05:28,152 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:05:28,152 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:05:28,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 07:05:28,152 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:05:28,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:05:28,153 INFO L85 PathProgramCache]: Analyzing trace with hash 742725279, now seen corresponding path program 1 times [2023-11-29 07:05:28,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:05:28,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371395838] [2023-11-29 07:05:28,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:05:28,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:05:28,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:29,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:05:29,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:29,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 07:05:29,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:29,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 07:05:29,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:29,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 07:05:29,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:29,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 07:05:29,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:29,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 07:05:29,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:29,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 07:05:29,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:29,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 07:05:29,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:29,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 07:05:29,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:29,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 07:05:29,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:29,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 07:05:29,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:29,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 07:05:29,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:29,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 07:05:29,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:29,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 07:05:29,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:29,948 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-11-29 07:05:29,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:05:29,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371395838] [2023-11-29 07:05:29,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371395838] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:05:29,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:05:29,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 07:05:29,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417462639] [2023-11-29 07:05:29,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:05:29,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 07:05:29,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:05:29,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 07:05:29,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-11-29 07:05:29,951 INFO L87 Difference]: Start difference. First operand 97 states and 139 transitions. Second operand has 9 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-11-29 07:05:30,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:05:30,479 INFO L93 Difference]: Finished difference Result 194 states and 278 transitions. [2023-11-29 07:05:30,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 07:05:30,480 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 118 [2023-11-29 07:05:30,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:05:30,481 INFO L225 Difference]: With dead ends: 194 [2023-11-29 07:05:30,481 INFO L226 Difference]: Without dead ends: 98 [2023-11-29 07:05:30,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-11-29 07:05:30,483 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 171 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 07:05:30,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 268 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 07:05:30,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-11-29 07:05:30,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2023-11-29 07:05:30,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 81 states have (on average 1.3580246913580247) internal successors, (110), 81 states have internal predecessors, (110), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-29 07:05:30,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 138 transitions. [2023-11-29 07:05:30,501 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 138 transitions. Word has length 118 [2023-11-29 07:05:30,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:05:30,502 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 138 transitions. [2023-11-29 07:05:30,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-11-29 07:05:30,502 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 138 transitions. [2023-11-29 07:05:30,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-29 07:05:30,504 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:05:30,504 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:05:30,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 07:05:30,504 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:05:30,505 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:05:30,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1251419427, now seen corresponding path program 1 times [2023-11-29 07:05:30,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:05:30,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341783447] [2023-11-29 07:05:30,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:05:30,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:05:30,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:31,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:05:31,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:31,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 07:05:31,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:31,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 07:05:31,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:31,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 07:05:31,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:31,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 07:05:31,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:31,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 07:05:31,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:31,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 07:05:31,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:31,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 07:05:31,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:31,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 07:05:31,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:31,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 07:05:31,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:31,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 07:05:31,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:31,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 07:05:31,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:31,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 07:05:31,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:31,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 07:05:31,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:31,231 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-11-29 07:05:31,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:05:31,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341783447] [2023-11-29 07:05:31,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341783447] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:05:31,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:05:31,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 07:05:31,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688977800] [2023-11-29 07:05:31,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:05:31,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 07:05:31,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:05:31,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 07:05:31,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 07:05:31,234 INFO L87 Difference]: Start difference. First operand 97 states and 138 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-29 07:05:35,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-11-29 07:05:35,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:05:35,525 INFO L93 Difference]: Finished difference Result 250 states and 351 transitions. [2023-11-29 07:05:35,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 07:05:35,525 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2023-11-29 07:05:35,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:05:35,527 INFO L225 Difference]: With dead ends: 250 [2023-11-29 07:05:35,527 INFO L226 Difference]: Without dead ends: 154 [2023-11-29 07:05:35,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-11-29 07:05:35,529 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 182 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2023-11-29 07:05:35,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 481 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 143 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2023-11-29 07:05:35,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2023-11-29 07:05:35,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 101. [2023-11-29 07:05:35,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 85 states have (on average 1.3529411764705883) internal successors, (115), 85 states have internal predecessors, (115), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-29 07:05:35,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 143 transitions. [2023-11-29 07:05:35,550 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 143 transitions. Word has length 118 [2023-11-29 07:05:35,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:05:35,550 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 143 transitions. [2023-11-29 07:05:35,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-29 07:05:35,551 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 143 transitions. [2023-11-29 07:05:35,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-29 07:05:35,552 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:05:35,552 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:05:35,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 07:05:35,553 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:05:35,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:05:35,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1680188958, now seen corresponding path program 1 times [2023-11-29 07:05:35,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:05:35,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229915530] [2023-11-29 07:05:35,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:05:35,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:05:35,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:37,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:05:37,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:37,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 07:05:37,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:37,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 07:05:37,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:37,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 07:05:37,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:37,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 07:05:37,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:37,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 07:05:37,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:37,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 07:05:37,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:37,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 07:05:37,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:37,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 07:05:37,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:37,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 07:05:37,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:37,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 07:05:37,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:37,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 07:05:37,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:37,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 07:05:37,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:37,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 07:05:37,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:37,689 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-11-29 07:05:37,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:05:37,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229915530] [2023-11-29 07:05:37,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229915530] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:05:37,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:05:37,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-29 07:05:37,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456549505] [2023-11-29 07:05:37,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:05:37,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 07:05:37,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:05:37,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 07:05:37,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-11-29 07:05:37,691 INFO L87 Difference]: Start difference. First operand 101 states and 143 transitions. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-29 07:05:42,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-11-29 07:05:43,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-11-29 07:05:44,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:05:44,163 INFO L93 Difference]: Finished difference Result 233 states and 327 transitions. [2023-11-29 07:05:44,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 07:05:44,164 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 120 [2023-11-29 07:05:44,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:05:44,165 INFO L225 Difference]: With dead ends: 233 [2023-11-29 07:05:44,165 INFO L226 Difference]: Without dead ends: 133 [2023-11-29 07:05:44,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2023-11-29 07:05:44,167 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 252 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2023-11-29 07:05:44,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 362 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 478 Invalid, 1 Unknown, 0 Unchecked, 6.1s Time] [2023-11-29 07:05:44,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-11-29 07:05:44,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 101. [2023-11-29 07:05:44,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 85 states have (on average 1.3411764705882352) internal successors, (114), 85 states have internal predecessors, (114), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-29 07:05:44,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 142 transitions. [2023-11-29 07:05:44,193 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 142 transitions. Word has length 120 [2023-11-29 07:05:44,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:05:44,194 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 142 transitions. [2023-11-29 07:05:44,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-29 07:05:44,194 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 142 transitions. [2023-11-29 07:05:44,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-29 07:05:44,196 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:05:44,196 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:05:44,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 07:05:44,196 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:05:44,196 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:05:44,197 INFO L85 PathProgramCache]: Analyzing trace with hash 559053122, now seen corresponding path program 1 times [2023-11-29 07:05:44,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:05:44,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503405348] [2023-11-29 07:05:44,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:05:44,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:05:44,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:45,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:05:45,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:45,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 07:05:45,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:45,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 07:05:45,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:45,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 07:05:45,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:45,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 07:05:45,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:45,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 07:05:45,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:45,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 07:05:45,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:45,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 07:05:45,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:45,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 07:05:45,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:45,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 07:05:45,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:45,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 07:05:45,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:45,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 07:05:45,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:45,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 07:05:45,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:45,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 07:05:45,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:45,135 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-11-29 07:05:45,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:05:45,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503405348] [2023-11-29 07:05:45,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503405348] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:05:45,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:05:45,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 07:05:45,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577695615] [2023-11-29 07:05:45,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:05:45,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 07:05:45,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:05:45,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 07:05:45,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-29 07:05:45,138 INFO L87 Difference]: Start difference. First operand 101 states and 142 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-29 07:05:45,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:05:45,992 INFO L93 Difference]: Finished difference Result 227 states and 316 transitions. [2023-11-29 07:05:45,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 07:05:45,993 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 120 [2023-11-29 07:05:45,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:05:45,995 INFO L225 Difference]: With dead ends: 227 [2023-11-29 07:05:45,995 INFO L226 Difference]: Without dead ends: 127 [2023-11-29 07:05:45,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2023-11-29 07:05:45,996 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 250 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 07:05:45,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 294 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 07:05:45,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-11-29 07:05:46,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 101. [2023-11-29 07:05:46,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 85 states have (on average 1.3294117647058823) internal successors, (113), 85 states have internal predecessors, (113), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-29 07:05:46,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 141 transitions. [2023-11-29 07:05:46,017 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 141 transitions. Word has length 120 [2023-11-29 07:05:46,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:05:46,018 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 141 transitions. [2023-11-29 07:05:46,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-29 07:05:46,018 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 141 transitions. [2023-11-29 07:05:46,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-29 07:05:46,019 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:05:46,020 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:05:46,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 07:05:46,020 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:05:46,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:05:46,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1784272085, now seen corresponding path program 1 times [2023-11-29 07:05:46,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:05:46,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294176568] [2023-11-29 07:05:46,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:05:46,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:05:46,059 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 07:05:46,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1657605795] [2023-11-29 07:05:46,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:05:46,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:05:46,059 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bf67463-e4e4-4f7e-95cb-db430f72595d/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 07:05:46,062 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bf67463-e4e4-4f7e-95cb-db430f72595d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 07:05:46,064 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bf67463-e4e4-4f7e-95cb-db430f72595d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 07:05:46,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:46,297 INFO L262 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 47 conjunts are in the unsatisfiable core [2023-11-29 07:05:46,314 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:05:49,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 07:05:49,186 INFO L349 Elim1Store]: treesize reduction 51, result has 22.7 percent of original size [2023-11-29 07:05:49,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2023-11-29 07:05:49,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 07:05:49,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2023-11-29 07:05:49,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 07:05:49,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 07:05:49,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 20 [2023-11-29 07:05:49,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 07:05:49,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 07:05:49,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 07:05:49,410 INFO L349 Elim1Store]: treesize reduction 49, result has 12.5 percent of original size [2023-11-29 07:05:49,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2023-11-29 07:05:49,638 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2023-11-29 07:05:49,638 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:05:56,849 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 07:05:56,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 774430 treesize of output 725001 [2023-11-29 07:06:24,153 WARN L293 SmtUtils]: Spent 27.30s on a formula simplification. DAG size of input: 662 DAG size of output: 513 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:06:38,277 WARN L293 SmtUtils]: Spent 8.47s on a formula simplification. DAG size of input: 505 DAG size of output: 507 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:06:46,664 WARN L293 SmtUtils]: Spent 6.07s on a formula simplification. DAG size of input: 501 DAG size of output: 508 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:18:22,461 WARN L293 SmtUtils]: Spent 5.80s on a formula simplification. DAG size of input: 499 DAG size of output: 515 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 07:18:31,254 WARN L293 SmtUtils]: Spent 6.60s on a formula simplification. DAG size of input: 497 DAG size of output: 522 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)