./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-40.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-40.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/bin/uautomizer-verify-qhAvR1uOyd --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 213b4bc058d12ef32d87a969037b39ae9c0589373b4a3de6d034bf3aa394040f --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 15:49:23,563 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 15:49:23,656 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 15:49:23,669 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 15:49:23,670 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 15:49:23,704 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 15:49:23,705 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 15:49:23,705 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 15:49:23,705 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 15:49:23,706 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 15:49:23,706 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 15:49:23,706 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 15:49:23,706 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 15:49:23,707 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 15:49:23,707 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 15:49:23,707 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 15:49:23,707 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 15:49:23,707 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 15:49:23,708 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 15:49:23,708 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 15:49:23,708 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 15:49:23,708 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 15:49:23,708 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 15:49:23,709 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 15:49:23,709 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 15:49:23,709 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 15:49:23,709 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 15:49:23,709 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 15:49:23,710 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 15:49:23,710 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 15:49:23,710 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 15:49:23,710 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 15:49:23,710 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:49:23,710 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 15:49:23,711 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 15:49:23,711 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 15:49:23,711 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 15:49:23,711 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 15:49:23,711 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 15:49:23,711 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 15:49:23,712 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 15:49:23,712 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 15:49:23,712 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/bin/uautomizer-verify-qhAvR1uOyd 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 -> 213b4bc058d12ef32d87a969037b39ae9c0589373b4a3de6d034bf3aa394040f [2024-11-13 15:49:24,069 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 15:49:24,086 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 15:49:24,090 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 15:49:24,092 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 15:49:24,093 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 15:49:24,096 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-40.i Unable to find full path for "g++" [2024-11-13 15:49:26,407 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 15:49:26,744 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 15:49:26,745 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-40.i [2024-11-13 15:49:26,758 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/bin/uautomizer-verify-qhAvR1uOyd/data/5a351d8e3/82b4ae9fee36449c8fc688914eb788b8/FLAG368714016 [2024-11-13 15:49:26,776 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/bin/uautomizer-verify-qhAvR1uOyd/data/5a351d8e3/82b4ae9fee36449c8fc688914eb788b8 [2024-11-13 15:49:26,778 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 15:49:26,779 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 15:49:26,781 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 15:49:26,781 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 15:49:26,784 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 15:49:26,785 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:49:26" (1/1) ... [2024-11-13 15:49:26,786 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55d888e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:49:26, skipping insertion in model container [2024-11-13 15:49:26,786 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:49:26" (1/1) ... [2024-11-13 15:49:26,812 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 15:49:26,978 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-40.i[916,929] [2024-11-13 15:49:27,038 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:49:27,049 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 15:49:27,059 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-40.i[916,929] [2024-11-13 15:49:27,125 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:49:27,152 INFO L204 MainTranslator]: Completed translation [2024-11-13 15:49:27,153 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:49:27 WrapperNode [2024-11-13 15:49:27,153 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 15:49:27,154 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 15:49:27,154 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 15:49:27,154 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 15:49:27,161 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:49:27" (1/1) ... [2024-11-13 15:49:27,177 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:49:27" (1/1) ... [2024-11-13 15:49:27,214 INFO L138 Inliner]: procedures = 30, calls = 151, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 464 [2024-11-13 15:49:27,214 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 15:49:27,215 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 15:49:27,215 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 15:49:27,215 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 15:49:27,224 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:49:27" (1/1) ... [2024-11-13 15:49:27,224 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:49:27" (1/1) ... [2024-11-13 15:49:27,229 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:49:27" (1/1) ... [2024-11-13 15:49:27,243 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-13 15:49:27,243 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:49:27" (1/1) ... [2024-11-13 15:49:27,243 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:49:27" (1/1) ... [2024-11-13 15:49:27,274 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:49:27" (1/1) ... [2024-11-13 15:49:27,278 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:49:27" (1/1) ... [2024-11-13 15:49:27,281 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:49:27" (1/1) ... [2024-11-13 15:49:27,283 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:49:27" (1/1) ... [2024-11-13 15:49:27,287 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 15:49:27,288 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 15:49:27,288 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 15:49:27,288 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 15:49:27,289 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:49:27" (1/1) ... [2024-11-13 15:49:27,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:49:27,316 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:49:27,331 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 15:49:27,338 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 15:49:27,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 15:49:27,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-13 15:49:27,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-13 15:49:27,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-13 15:49:27,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-13 15:49:27,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-13 15:49:27,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-13 15:49:27,375 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 15:49:27,375 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 15:49:27,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 15:49:27,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 15:49:27,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 15:49:27,525 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 15:49:27,527 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 15:49:28,303 INFO L? ?]: Removed 105 outVars from TransFormulas that were not future-live. [2024-11-13 15:49:28,303 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 15:49:28,314 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 15:49:28,314 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 15:49:28,315 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:49:28 BoogieIcfgContainer [2024-11-13 15:49:28,315 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 15:49:28,318 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 15:49:28,318 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 15:49:28,322 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 15:49:28,323 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 03:49:26" (1/3) ... [2024-11-13 15:49:28,323 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c07e622 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:49:28, skipping insertion in model container [2024-11-13 15:49:28,323 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:49:27" (2/3) ... [2024-11-13 15:49:28,324 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c07e622 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:49:28, skipping insertion in model container [2024-11-13 15:49:28,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:49:28" (3/3) ... [2024-11-13 15:49:28,325 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-40.i [2024-11-13 15:49:28,341 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 15:49:28,342 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-40.i that has 2 procedures, 113 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 15:49:28,405 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 15:49:28,419 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@17830cd0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 15:49:28,419 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 15:49:28,423 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 91 states have (on average 1.4175824175824177) internal successors, (129), 92 states have internal predecessors, (129), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-13 15:49:28,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-13 15:49:28,433 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:49:28,434 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:49:28,434 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:49:28,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:49:28,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1776521956, now seen corresponding path program 1 times [2024-11-13 15:49:28,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:49:28,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668823362] [2024-11-13 15:49:28,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:49:28,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:49:28,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:28,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:49:28,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:28,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 15:49:28,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:28,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:49:28,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:28,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:49:28,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:28,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 15:49:28,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:28,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 15:49:28,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:28,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 15:49:28,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:28,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 15:49:28,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:28,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 15:49:28,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:28,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 15:49:28,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:28,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:49:28,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:28,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 15:49:28,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:28,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 15:49:28,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:28,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 15:49:28,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:28,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 15:49:28,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:28,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 15:49:28,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:28,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 15:49:28,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:28,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 15:49:28,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:29,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 15:49:29,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:29,045 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 15:49:29,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:49:29,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668823362] [2024-11-13 15:49:29,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668823362] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:49:29,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:49:29,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:49:29,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138116512] [2024-11-13 15:49:29,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:49:29,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 15:49:29,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:49:29,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 15:49:29,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 15:49:29,083 INFO L87 Difference]: Start difference. First operand has 113 states, 91 states have (on average 1.4175824175824177) internal successors, (129), 92 states have internal predecessors, (129), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-13 15:49:29,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:49:29,129 INFO L93 Difference]: Finished difference Result 219 states and 347 transitions. [2024-11-13 15:49:29,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 15:49:29,131 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 150 [2024-11-13 15:49:29,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:49:29,140 INFO L225 Difference]: With dead ends: 219 [2024-11-13 15:49:29,140 INFO L226 Difference]: Without dead ends: 109 [2024-11-13 15:49:29,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 15:49:29,146 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:49:29,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:49:29,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-13 15:49:29,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-13 15:49:29,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 88 states have (on average 1.3863636363636365) internal successors, (122), 88 states have internal predecessors, (122), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-13 15:49:29,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 160 transitions. [2024-11-13 15:49:29,202 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 160 transitions. Word has length 150 [2024-11-13 15:49:29,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:49:29,202 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 160 transitions. [2024-11-13 15:49:29,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-13 15:49:29,203 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 160 transitions. [2024-11-13 15:49:29,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-13 15:49:29,206 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:49:29,207 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:49:29,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 15:49:29,207 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:49:29,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:49:29,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1653157834, now seen corresponding path program 1 times [2024-11-13 15:49:29,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:49:29,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694716813] [2024-11-13 15:49:29,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:49:29,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:49:29,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:29,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:49:29,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:29,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 15:49:29,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:29,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:49:29,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:29,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:49:29,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:29,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 15:49:29,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:29,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 15:49:29,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:29,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 15:49:29,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:29,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 15:49:29,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:29,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 15:49:29,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:29,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 15:49:29,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:29,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:49:29,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:29,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 15:49:29,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:29,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 15:49:29,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:29,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 15:49:29,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:29,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 15:49:30,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:30,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 15:49:30,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:30,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 15:49:30,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:30,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 15:49:30,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:30,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 15:49:30,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:30,025 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 15:49:30,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:49:30,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694716813] [2024-11-13 15:49:30,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694716813] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:49:30,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:49:30,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:49:30,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912267936] [2024-11-13 15:49:30,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:49:30,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:49:30,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:49:30,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:49:30,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:49:30,030 INFO L87 Difference]: Start difference. First operand 109 states and 160 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 15:49:30,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:49:30,106 INFO L93 Difference]: Finished difference Result 217 states and 320 transitions. [2024-11-13 15:49:30,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:49:30,107 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 150 [2024-11-13 15:49:30,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:49:30,109 INFO L225 Difference]: With dead ends: 217 [2024-11-13 15:49:30,109 INFO L226 Difference]: Without dead ends: 111 [2024-11-13 15:49:30,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:49:30,114 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 0 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:49:30,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 463 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:49:30,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-13 15:49:30,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-13 15:49:30,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 90 states have (on average 1.3777777777777778) internal successors, (124), 90 states have internal predecessors, (124), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-13 15:49:30,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 162 transitions. [2024-11-13 15:49:30,135 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 162 transitions. Word has length 150 [2024-11-13 15:49:30,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:49:30,136 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 162 transitions. [2024-11-13 15:49:30,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 15:49:30,138 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 162 transitions. [2024-11-13 15:49:30,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-13 15:49:30,141 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:49:30,142 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:49:30,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 15:49:30,145 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:49:30,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:49:30,146 INFO L85 PathProgramCache]: Analyzing trace with hash -2107907062, now seen corresponding path program 1 times [2024-11-13 15:49:30,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:49:30,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928454360] [2024-11-13 15:49:30,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:49:30,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:49:30,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:30,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:49:30,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:30,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 15:49:30,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:30,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:49:30,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:30,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:49:30,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:30,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 15:49:30,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:30,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 15:49:30,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:30,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 15:49:30,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:30,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 15:49:30,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:30,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 15:49:30,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:30,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 15:49:30,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:30,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:49:30,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:30,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 15:49:30,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:30,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 15:49:30,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:30,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 15:49:30,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:30,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 15:49:30,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:30,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 15:49:30,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:30,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 15:49:30,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:30,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 15:49:30,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:30,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 15:49:30,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:30,603 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 15:49:30,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:49:30,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928454360] [2024-11-13 15:49:30,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928454360] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:49:30,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:49:30,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:49:30,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577068148] [2024-11-13 15:49:30,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:49:30,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:49:30,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:49:30,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:49:30,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:49:30,607 INFO L87 Difference]: Start difference. First operand 111 states and 162 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 15:49:30,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:49:30,664 INFO L93 Difference]: Finished difference Result 222 states and 325 transitions. [2024-11-13 15:49:30,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:49:30,667 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-11-13 15:49:30,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:49:30,669 INFO L225 Difference]: With dead ends: 222 [2024-11-13 15:49:30,669 INFO L226 Difference]: Without dead ends: 114 [2024-11-13 15:49:30,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:49:30,670 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 1 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:49:30,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 461 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:49:30,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-13 15:49:30,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2024-11-13 15:49:30,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 92 states have (on average 1.3695652173913044) internal successors, (126), 92 states have internal predecessors, (126), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-13 15:49:30,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 164 transitions. [2024-11-13 15:49:30,689 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 164 transitions. Word has length 153 [2024-11-13 15:49:30,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:49:30,691 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 164 transitions. [2024-11-13 15:49:30,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 15:49:30,691 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 164 transitions. [2024-11-13 15:49:30,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-13 15:49:30,697 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:49:30,697 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:49:30,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 15:49:30,701 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:49:30,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:49:30,701 INFO L85 PathProgramCache]: Analyzing trace with hash -332899700, now seen corresponding path program 1 times [2024-11-13 15:49:30,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:49:30,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359719284] [2024-11-13 15:49:30,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:49:30,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:49:30,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:31,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:49:31,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:31,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 15:49:31,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:31,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:49:31,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:31,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:49:31,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:31,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 15:49:31,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:31,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 15:49:31,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:31,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 15:49:31,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:31,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 15:49:31,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:31,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 15:49:31,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:31,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 15:49:31,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:31,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:49:31,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:31,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 15:49:31,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:31,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 15:49:31,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:31,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 15:49:31,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:31,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 15:49:31,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:31,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 15:49:31,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:31,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 15:49:31,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:31,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 15:49:31,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:31,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 15:49:31,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:31,128 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 15:49:31,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:49:31,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359719284] [2024-11-13 15:49:31,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359719284] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:49:31,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:49:31,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:49:31,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643238606] [2024-11-13 15:49:31,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:49:31,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:49:31,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:49:31,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:49:31,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:49:31,133 INFO L87 Difference]: Start difference. First operand 113 states and 164 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 15:49:31,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:49:31,170 INFO L93 Difference]: Finished difference Result 226 states and 329 transitions. [2024-11-13 15:49:31,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:49:31,172 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-11-13 15:49:31,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:49:31,174 INFO L225 Difference]: With dead ends: 226 [2024-11-13 15:49:31,174 INFO L226 Difference]: Without dead ends: 116 [2024-11-13 15:49:31,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:49:31,175 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 1 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:49:31,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 463 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:49:31,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-13 15:49:31,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2024-11-13 15:49:31,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 94 states have (on average 1.3617021276595744) internal successors, (128), 94 states have internal predecessors, (128), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-13 15:49:31,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 166 transitions. [2024-11-13 15:49:31,198 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 166 transitions. Word has length 153 [2024-11-13 15:49:31,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:49:31,199 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 166 transitions. [2024-11-13 15:49:31,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 15:49:31,199 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 166 transitions. [2024-11-13 15:49:31,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-13 15:49:31,202 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:49:31,202 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:49:31,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 15:49:31,202 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:49:31,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:49:31,203 INFO L85 PathProgramCache]: Analyzing trace with hash -331052658, now seen corresponding path program 1 times [2024-11-13 15:49:31,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:49:31,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907888223] [2024-11-13 15:49:31,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:49:31,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:49:31,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:34,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:49:34,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:34,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 15:49:34,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:34,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:49:34,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:34,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:49:34,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:34,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 15:49:34,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:34,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 15:49:34,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:34,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 15:49:34,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:34,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 15:49:34,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:34,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 15:49:34,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:34,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 15:49:34,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:34,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:49:34,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:34,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 15:49:34,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:34,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 15:49:34,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:34,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 15:49:34,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:34,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 15:49:34,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:34,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 15:49:34,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:34,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 15:49:34,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:34,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 15:49:34,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:34,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 15:49:34,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:34,372 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 15:49:34,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:49:34,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907888223] [2024-11-13 15:49:34,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907888223] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:49:34,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:49:34,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 15:49:34,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734145140] [2024-11-13 15:49:34,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:49:34,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 15:49:34,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:49:34,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 15:49:34,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-13 15:49:34,375 INFO L87 Difference]: Start difference. First operand 115 states and 166 transitions. Second operand has 8 states, 6 states have (on average 10.166666666666666) internal successors, (61), 8 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-13 15:49:35,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:49:35,538 INFO L93 Difference]: Finished difference Result 304 states and 436 transitions. [2024-11-13 15:49:35,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 15:49:35,539 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 10.166666666666666) internal successors, (61), 8 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 153 [2024-11-13 15:49:35,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:49:35,543 INFO L225 Difference]: With dead ends: 304 [2024-11-13 15:49:35,544 INFO L226 Difference]: Without dead ends: 192 [2024-11-13 15:49:35,545 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-13 15:49:35,546 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 87 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 907 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:49:35,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 907 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-13 15:49:35,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-11-13 15:49:35,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 189. [2024-11-13 15:49:35,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 157 states have (on average 1.3503184713375795) internal successors, (212), 158 states have internal predecessors, (212), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-13 15:49:35,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 270 transitions. [2024-11-13 15:49:35,586 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 270 transitions. Word has length 153 [2024-11-13 15:49:35,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:49:35,587 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 270 transitions. [2024-11-13 15:49:35,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 10.166666666666666) internal successors, (61), 8 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-13 15:49:35,587 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 270 transitions. [2024-11-13 15:49:35,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-13 15:49:35,592 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:49:35,593 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:49:35,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 15:49:35,593 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:49:35,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:49:35,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1352121012, now seen corresponding path program 1 times [2024-11-13 15:49:35,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:49:35,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355870085] [2024-11-13 15:49:35,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:49:35,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:49:35,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:49,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:49:49,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:49,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 15:49:49,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:49,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:49:49,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:49,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:49:49,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:49,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 15:49:49,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:49,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 15:49:49,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:49,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 15:49:49,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:49,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 15:49:49,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:49,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 15:49:49,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:49,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 15:49:49,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:49,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:49:49,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:49,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 15:49:49,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:49,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 15:49:49,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:49,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 15:49:49,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:49,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 15:49:49,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:49,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 15:49:49,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:49,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 15:49:49,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:49,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 15:49:49,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:49,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 15:49:49,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:49,904 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 15:49:49,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:49:49,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355870085] [2024-11-13 15:49:49,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355870085] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:49:49,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:49:49,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-13 15:49:49,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034001245] [2024-11-13 15:49:49,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:49:49,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 15:49:49,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:49:49,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 15:49:49,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-13 15:49:49,907 INFO L87 Difference]: Start difference. First operand 189 states and 270 transitions. Second operand has 9 states, 8 states have (on average 7.625) internal successors, (61), 9 states have internal predecessors, (61), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-13 15:49:55,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:49:55,163 INFO L93 Difference]: Finished difference Result 642 states and 913 transitions. [2024-11-13 15:49:55,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 15:49:55,163 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.625) internal successors, (61), 9 states have internal predecessors, (61), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 153 [2024-11-13 15:49:55,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:49:55,169 INFO L225 Difference]: With dead ends: 642 [2024-11-13 15:49:55,169 INFO L226 Difference]: Without dead ends: 456 [2024-11-13 15:49:55,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-13 15:49:55,171 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 177 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:49:55,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 585 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-11-13 15:49:55,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2024-11-13 15:49:55,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 448. [2024-11-13 15:49:55,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 375 states have (on average 1.344) internal successors, (504), 379 states have internal predecessors, (504), 66 states have call successors, (66), 6 states have call predecessors, (66), 6 states have return successors, (66), 62 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-13 15:49:55,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 636 transitions. [2024-11-13 15:49:55,236 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 636 transitions. Word has length 153 [2024-11-13 15:49:55,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:49:55,237 INFO L471 AbstractCegarLoop]: Abstraction has 448 states and 636 transitions. [2024-11-13 15:49:55,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.625) internal successors, (61), 9 states have internal predecessors, (61), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-13 15:49:55,237 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 636 transitions. [2024-11-13 15:49:55,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-13 15:49:55,240 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:49:55,240 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:49:55,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 15:49:55,241 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:49:55,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:49:55,241 INFO L85 PathProgramCache]: Analyzing trace with hash -134337694, now seen corresponding path program 1 times [2024-11-13 15:49:55,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:49:55,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012230368] [2024-11-13 15:49:55,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:49:55,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:49:55,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:55,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:49:55,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:55,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 15:49:55,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:55,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:49:55,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:55,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:49:55,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:55,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 15:49:55,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:55,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 15:49:55,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:55,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 15:49:55,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:55,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 15:49:55,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:55,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 15:49:55,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:55,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 15:49:55,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:55,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:49:55,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:55,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 15:49:55,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:55,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 15:49:55,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:55,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 15:49:55,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:55,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 15:49:55,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:55,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 15:49:55,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:55,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 15:49:55,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:55,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 15:49:55,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:55,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 15:49:55,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:49:55,562 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 15:49:55,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:49:55,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012230368] [2024-11-13 15:49:55,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012230368] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:49:55,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:49:55,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 15:49:55,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662117228] [2024-11-13 15:49:55,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:49:55,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:49:55,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:49:55,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:49:55,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:49:55,564 INFO L87 Difference]: Start difference. First operand 448 states and 636 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 15:49:55,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:49:55,648 INFO L93 Difference]: Finished difference Result 895 states and 1273 transitions. [2024-11-13 15:49:55,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:49:55,651 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-11-13 15:49:55,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:49:55,656 INFO L225 Difference]: With dead ends: 895 [2024-11-13 15:49:55,657 INFO L226 Difference]: Without dead ends: 463 [2024-11-13 15:49:55,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:49:55,659 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 613 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 [2024-11-13 15:49:55,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 613 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:49:55,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2024-11-13 15:49:55,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 453. [2024-11-13 15:49:55,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 380 states have (on average 1.3394736842105264) internal successors, (509), 384 states have internal predecessors, (509), 66 states have call successors, (66), 6 states have call predecessors, (66), 6 states have return successors, (66), 62 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-13 15:49:55,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 641 transitions. [2024-11-13 15:49:55,742 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 641 transitions. Word has length 153 [2024-11-13 15:49:55,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:49:55,742 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 641 transitions. [2024-11-13 15:49:55,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 15:49:55,743 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 641 transitions. [2024-11-13 15:49:55,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-13 15:49:55,747 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:49:55,747 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:49:55,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 15:49:55,747 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:49:55,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:49:55,748 INFO L85 PathProgramCache]: Analyzing trace with hash -190504048, now seen corresponding path program 1 times [2024-11-13 15:49:55,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:49:55,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648785933] [2024-11-13 15:49:55,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:49:55,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:49:55,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:05,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:50:05,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:05,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 15:50:05,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:05,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:50:05,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:05,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:50:05,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:05,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 15:50:05,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:05,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 15:50:05,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:05,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 15:50:05,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:05,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 15:50:05,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:05,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 15:50:05,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:05,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 15:50:05,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:05,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:50:05,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:05,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 15:50:05,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:05,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 15:50:05,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:05,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 15:50:05,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:05,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 15:50:05,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:05,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 15:50:05,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:05,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 15:50:05,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:05,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 15:50:05,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:05,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 15:50:05,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:05,405 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 15:50:05,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:50:05,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648785933] [2024-11-13 15:50:05,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648785933] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:50:05,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:50:05,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-13 15:50:05,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81483835] [2024-11-13 15:50:05,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:50:05,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 15:50:05,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:50:05,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 15:50:05,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-13 15:50:05,408 INFO L87 Difference]: Start difference. First operand 453 states and 641 transitions. Second operand has 9 states, 8 states have (on average 7.625) internal successors, (61), 9 states have internal predecessors, (61), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-13 15:50:13,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:50:13,859 INFO L93 Difference]: Finished difference Result 958 states and 1355 transitions. [2024-11-13 15:50:13,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 15:50:13,860 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.625) internal successors, (61), 9 states have internal predecessors, (61), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 153 [2024-11-13 15:50:13,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:50:13,863 INFO L225 Difference]: With dead ends: 958 [2024-11-13 15:50:13,864 INFO L226 Difference]: Without dead ends: 521 [2024-11-13 15:50:13,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-11-13 15:50:13,866 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 198 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-13 15:50:13,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 745 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 840 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-13 15:50:13,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2024-11-13 15:50:13,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 501. [2024-11-13 15:50:13,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 428 states have (on average 1.3504672897196262) internal successors, (578), 432 states have internal predecessors, (578), 66 states have call successors, (66), 6 states have call predecessors, (66), 6 states have return successors, (66), 62 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-13 15:50:13,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 710 transitions. [2024-11-13 15:50:13,916 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 710 transitions. Word has length 153 [2024-11-13 15:50:13,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:50:13,917 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 710 transitions. [2024-11-13 15:50:13,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.625) internal successors, (61), 9 states have internal predecessors, (61), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-13 15:50:13,917 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 710 transitions. [2024-11-13 15:50:13,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-13 15:50:13,919 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:50:13,919 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:50:13,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 15:50:13,920 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:50:13,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:50:13,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1211572402, now seen corresponding path program 1 times [2024-11-13 15:50:13,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:50:13,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886112609] [2024-11-13 15:50:13,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:50:13,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:50:14,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:15,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:50:15,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:15,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 15:50:15,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:15,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:50:15,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:15,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:50:15,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:15,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 15:50:15,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:15,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 15:50:15,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:15,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 15:50:15,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:15,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 15:50:15,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:15,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 15:50:15,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:15,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 15:50:15,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:15,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:50:15,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:15,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 15:50:15,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:15,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 15:50:15,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:15,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 15:50:15,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:15,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 15:50:15,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:15,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 15:50:15,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:15,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 15:50:15,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:15,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 15:50:15,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:15,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 15:50:15,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:15,131 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 15:50:15,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:50:15,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886112609] [2024-11-13 15:50:15,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886112609] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:50:15,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:50:15,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 15:50:15,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903735274] [2024-11-13 15:50:15,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:50:15,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 15:50:15,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:50:15,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 15:50:15,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:50:15,137 INFO L87 Difference]: Start difference. First operand 501 states and 710 transitions. Second operand has 7 states, 6 states have (on average 10.166666666666666) internal successors, (61), 7 states have internal predecessors, (61), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-13 15:50:16,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:50:16,282 INFO L93 Difference]: Finished difference Result 1053 states and 1484 transitions. [2024-11-13 15:50:16,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 15:50:16,282 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.166666666666666) internal successors, (61), 7 states have internal predecessors, (61), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 153 [2024-11-13 15:50:16,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:50:16,287 INFO L225 Difference]: With dead ends: 1053 [2024-11-13 15:50:16,287 INFO L226 Difference]: Without dead ends: 555 [2024-11-13 15:50:16,289 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-13 15:50:16,290 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 92 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 982 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:50:16,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 982 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-13 15:50:16,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2024-11-13 15:50:16,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 551. [2024-11-13 15:50:16,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 461 states have (on average 1.3253796095444685) internal successors, (611), 466 states have internal predecessors, (611), 80 states have call successors, (80), 9 states have call predecessors, (80), 9 states have return successors, (80), 75 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-13 15:50:16,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 771 transitions. [2024-11-13 15:50:16,365 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 771 transitions. Word has length 153 [2024-11-13 15:50:16,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:50:16,366 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 771 transitions. [2024-11-13 15:50:16,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.166666666666666) internal successors, (61), 7 states have internal predecessors, (61), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-13 15:50:16,366 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 771 transitions. [2024-11-13 15:50:16,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-13 15:50:16,370 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:50:16,371 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:50:16,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 15:50:16,371 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:50:16,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:50:16,372 INFO L85 PathProgramCache]: Analyzing trace with hash 610415274, now seen corresponding path program 1 times [2024-11-13 15:50:16,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:50:16,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398029150] [2024-11-13 15:50:16,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:50:16,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:50:16,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:16,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:50:16,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:16,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 15:50:16,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:16,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:50:16,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:16,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:50:16,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:16,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 15:50:16,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:16,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 15:50:16,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:16,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 15:50:16,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:16,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 15:50:16,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:16,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 15:50:16,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:16,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 15:50:16,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:16,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:50:16,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:16,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 15:50:16,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:16,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 15:50:16,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:16,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 15:50:16,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:16,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 15:50:16,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:16,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 15:50:16,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:16,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 15:50:16,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:16,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 15:50:16,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:16,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 15:50:16,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:16,991 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 15:50:16,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:50:16,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398029150] [2024-11-13 15:50:16,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398029150] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:50:16,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:50:16,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 15:50:16,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013617466] [2024-11-13 15:50:16,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:50:16,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 15:50:16,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:50:16,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 15:50:16,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:50:16,993 INFO L87 Difference]: Start difference. First operand 551 states and 771 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 15:50:18,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:50:18,402 INFO L93 Difference]: Finished difference Result 1319 states and 1844 transitions. [2024-11-13 15:50:18,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 15:50:18,403 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 154 [2024-11-13 15:50:18,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:50:18,413 INFO L225 Difference]: With dead ends: 1319 [2024-11-13 15:50:18,413 INFO L226 Difference]: Without dead ends: 796 [2024-11-13 15:50:18,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:50:18,416 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 120 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-13 15:50:18,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 718 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-13 15:50:18,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2024-11-13 15:50:18,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 643. [2024-11-13 15:50:18,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 527 states have (on average 1.3130929791271346) internal successors, (692), 532 states have internal predecessors, (692), 103 states have call successors, (103), 12 states have call predecessors, (103), 12 states have return successors, (103), 98 states have call predecessors, (103), 103 states have call successors, (103) [2024-11-13 15:50:18,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 898 transitions. [2024-11-13 15:50:18,515 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 898 transitions. Word has length 154 [2024-11-13 15:50:18,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:50:18,516 INFO L471 AbstractCegarLoop]: Abstraction has 643 states and 898 transitions. [2024-11-13 15:50:18,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 15:50:18,516 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 898 transitions. [2024-11-13 15:50:18,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-13 15:50:18,521 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:50:18,521 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:50:18,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 15:50:18,522 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:50:18,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:50:18,523 INFO L85 PathProgramCache]: Analyzing trace with hash -997931888, now seen corresponding path program 1 times [2024-11-13 15:50:18,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:50:18,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745743845] [2024-11-13 15:50:18,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:50:18,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:50:18,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:18,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:50:18,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:18,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 15:50:18,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:18,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:50:18,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:18,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:50:18,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:18,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 15:50:18,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:18,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 15:50:18,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:18,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 15:50:18,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:18,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 15:50:18,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:18,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 15:50:18,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:18,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 15:50:18,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:18,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:50:18,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:18,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 15:50:18,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:18,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 15:50:18,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:18,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 15:50:18,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:18,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 15:50:18,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:18,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 15:50:18,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:18,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 15:50:18,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:18,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 15:50:18,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:18,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 15:50:18,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:18,821 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 15:50:18,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:50:18,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745743845] [2024-11-13 15:50:18,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745743845] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:50:18,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:50:18,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 15:50:18,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920739708] [2024-11-13 15:50:18,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:50:18,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 15:50:18,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:50:18,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 15:50:18,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:50:18,824 INFO L87 Difference]: Start difference. First operand 643 states and 898 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 15:50:18,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:50:18,938 INFO L93 Difference]: Finished difference Result 1290 states and 1799 transitions. [2024-11-13 15:50:18,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 15:50:18,939 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2024-11-13 15:50:18,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:50:18,944 INFO L225 Difference]: With dead ends: 1290 [2024-11-13 15:50:18,945 INFO L226 Difference]: Without dead ends: 675 [2024-11-13 15:50:18,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:50:18,948 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 0 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:50:18,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 761 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:50:18,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2024-11-13 15:50:19,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 651. [2024-11-13 15:50:19,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 535 states have (on average 1.308411214953271) internal successors, (700), 540 states have internal predecessors, (700), 103 states have call successors, (103), 12 states have call predecessors, (103), 12 states have return successors, (103), 98 states have call predecessors, (103), 103 states have call successors, (103) [2024-11-13 15:50:19,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 906 transitions. [2024-11-13 15:50:19,042 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 906 transitions. Word has length 155 [2024-11-13 15:50:19,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:50:19,042 INFO L471 AbstractCegarLoop]: Abstraction has 651 states and 906 transitions. [2024-11-13 15:50:19,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 15:50:19,043 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 906 transitions. [2024-11-13 15:50:19,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-13 15:50:19,046 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:50:19,047 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:50:19,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 15:50:19,048 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:50:19,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:50:19,048 INFO L85 PathProgramCache]: Analyzing trace with hash -971283703, now seen corresponding path program 1 times [2024-11-13 15:50:19,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:50:19,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750079982] [2024-11-13 15:50:19,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:50:19,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:50:19,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:19,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:50:19,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:19,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 15:50:19,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:19,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:50:19,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:19,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:50:19,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:19,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 15:50:19,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:19,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 15:50:19,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:19,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 15:50:19,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:19,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 15:50:19,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:19,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 15:50:19,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:19,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 15:50:19,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:19,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:50:19,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:19,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 15:50:19,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:19,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 15:50:19,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:19,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 15:50:19,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:19,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 15:50:19,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:19,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 15:50:19,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:19,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 15:50:19,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:19,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 15:50:19,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:19,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 15:50:19,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:19,682 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 15:50:19,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:50:19,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750079982] [2024-11-13 15:50:19,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750079982] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:50:19,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:50:19,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 15:50:19,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899814917] [2024-11-13 15:50:19,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:50:19,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:50:19,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:50:19,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:50:19,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:50:19,685 INFO L87 Difference]: Start difference. First operand 651 states and 906 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 15:50:20,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:50:20,790 INFO L93 Difference]: Finished difference Result 1427 states and 1983 transitions. [2024-11-13 15:50:20,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 15:50:20,791 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2024-11-13 15:50:20,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:50:20,801 INFO L225 Difference]: With dead ends: 1427 [2024-11-13 15:50:20,801 INFO L226 Difference]: Without dead ends: 804 [2024-11-13 15:50:20,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:50:20,804 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 128 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:50:20,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 484 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-13 15:50:20,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2024-11-13 15:50:20,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 651. [2024-11-13 15:50:20,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 535 states have (on average 1.3009345794392524) internal successors, (696), 540 states have internal predecessors, (696), 103 states have call successors, (103), 12 states have call predecessors, (103), 12 states have return successors, (103), 98 states have call predecessors, (103), 103 states have call successors, (103) [2024-11-13 15:50:20,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 902 transitions. [2024-11-13 15:50:20,886 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 902 transitions. Word has length 155 [2024-11-13 15:50:20,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:50:20,887 INFO L471 AbstractCegarLoop]: Abstraction has 651 states and 902 transitions. [2024-11-13 15:50:20,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 15:50:20,887 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 902 transitions. [2024-11-13 15:50:20,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-13 15:50:20,889 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:50:20,889 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:50:20,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-13 15:50:20,890 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:50:20,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:50:20,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1552392945, now seen corresponding path program 1 times [2024-11-13 15:50:20,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:50:20,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300064660] [2024-11-13 15:50:20,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:50:20,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:50:21,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:32,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:50:32,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:32,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 15:50:32,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:32,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:50:32,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:32,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:50:32,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:32,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 15:50:32,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:32,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 15:50:32,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:32,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 15:50:32,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:32,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 15:50:32,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:32,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 15:50:32,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:32,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 15:50:32,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:32,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:50:32,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:32,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 15:50:32,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:32,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 15:50:32,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:32,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 15:50:32,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:32,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 15:50:32,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:32,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 15:50:32,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:32,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 15:50:32,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:32,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 15:50:32,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:32,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 15:50:32,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:32,548 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 15:50:32,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:50:32,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300064660] [2024-11-13 15:50:32,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300064660] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:50:32,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:50:32,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 15:50:32,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798569859] [2024-11-13 15:50:32,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:50:32,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 15:50:32,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:50:32,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 15:50:32,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-13 15:50:32,551 INFO L87 Difference]: Start difference. First operand 651 states and 902 transitions. Second operand has 8 states, 7 states have (on average 9.0) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-13 15:50:39,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:50:39,312 INFO L93 Difference]: Finished difference Result 936 states and 1297 transitions. [2024-11-13 15:50:39,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 15:50:39,313 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.0) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 155 [2024-11-13 15:50:39,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:50:39,318 INFO L225 Difference]: With dead ends: 936 [2024-11-13 15:50:39,318 INFO L226 Difference]: Without dead ends: 696 [2024-11-13 15:50:39,319 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-13 15:50:39,320 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 69 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:50:39,320 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 828 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-13 15:50:39,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2024-11-13 15:50:39,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 693. [2024-11-13 15:50:39,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 693 states, 572 states have (on average 1.298951048951049) internal successors, (743), 578 states have internal predecessors, (743), 107 states have call successors, (107), 13 states have call predecessors, (107), 13 states have return successors, (107), 101 states have call predecessors, (107), 107 states have call successors, (107) [2024-11-13 15:50:39,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 957 transitions. [2024-11-13 15:50:39,392 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 957 transitions. Word has length 155 [2024-11-13 15:50:39,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:50:39,393 INFO L471 AbstractCegarLoop]: Abstraction has 693 states and 957 transitions. [2024-11-13 15:50:39,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.0) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-13 15:50:39,393 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 957 transitions. [2024-11-13 15:50:39,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-13 15:50:39,395 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:50:39,395 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:50:39,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-13 15:50:39,396 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:50:39,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:50:39,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1580957387, now seen corresponding path program 1 times [2024-11-13 15:50:39,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:50:39,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281304790] [2024-11-13 15:50:39,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:50:39,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:50:39,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:46,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:50:46,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:46,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 15:50:46,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:46,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:50:46,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:46,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:50:46,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:46,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 15:50:46,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:46,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 15:50:46,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:46,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 15:50:46,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:46,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 15:50:46,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:46,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 15:50:46,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:46,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 15:50:46,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:46,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:50:46,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:46,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 15:50:46,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:46,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 15:50:46,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:46,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 15:50:46,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:46,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 15:50:46,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:46,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 15:50:46,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:46,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 15:50:46,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:46,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 15:50:46,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:46,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 15:50:46,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:46,207 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 15:50:46,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:50:46,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281304790] [2024-11-13 15:50:46,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281304790] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:50:46,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:50:46,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 15:50:46,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630226203] [2024-11-13 15:50:46,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:50:46,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 15:50:46,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:50:46,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 15:50:46,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-13 15:50:46,210 INFO L87 Difference]: Start difference. First operand 693 states and 957 transitions. Second operand has 8 states, 7 states have (on average 9.0) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-13 15:50:51,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:50:51,015 INFO L93 Difference]: Finished difference Result 1020 states and 1407 transitions. [2024-11-13 15:50:51,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 15:50:51,016 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.0) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 155 [2024-11-13 15:50:51,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:50:51,019 INFO L225 Difference]: With dead ends: 1020 [2024-11-13 15:50:51,019 INFO L226 Difference]: Without dead ends: 738 [2024-11-13 15:50:51,020 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-13 15:50:51,021 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 67 mSDsluCounter, 858 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 1055 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-13 15:50:51,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 1055 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-13 15:50:51,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2024-11-13 15:50:51,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 735. [2024-11-13 15:50:51,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 735 states, 609 states have (on average 1.297208538587849) internal successors, (790), 616 states have internal predecessors, (790), 111 states have call successors, (111), 14 states have call predecessors, (111), 14 states have return successors, (111), 104 states have call predecessors, (111), 111 states have call successors, (111) [2024-11-13 15:50:51,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 1012 transitions. [2024-11-13 15:50:51,130 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 1012 transitions. Word has length 155 [2024-11-13 15:50:51,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:50:51,131 INFO L471 AbstractCegarLoop]: Abstraction has 735 states and 1012 transitions. [2024-11-13 15:50:51,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.0) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-13 15:50:51,131 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 1012 transitions. [2024-11-13 15:50:51,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-13 15:50:51,133 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:50:51,134 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:50:51,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-13 15:50:51,134 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:50:51,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:50:51,134 INFO L85 PathProgramCache]: Analyzing trace with hash -932085080, now seen corresponding path program 1 times [2024-11-13 15:50:51,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:50:51,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969612381] [2024-11-13 15:50:51,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:50:51,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:50:51,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:51,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:50:51,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:51,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 15:50:51,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:51,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:50:51,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:51,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:50:51,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:51,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 15:50:51,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:51,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 15:50:51,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:51,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 15:50:51,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:51,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 15:50:51,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:51,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 15:50:51,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:51,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 15:50:51,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:51,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:50:51,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:51,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 15:50:51,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:51,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 15:50:51,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:51,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 15:50:51,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:51,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 15:50:51,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:51,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 15:50:51,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:51,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 15:50:51,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:51,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 15:50:51,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:51,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 15:50:51,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:50:51,368 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 15:50:51,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:50:51,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969612381] [2024-11-13 15:50:51,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969612381] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:50:51,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:50:51,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 15:50:51,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419063363] [2024-11-13 15:50:51,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:50:51,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:50:51,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:50:51,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:50:51,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:50:51,370 INFO L87 Difference]: Start difference. First operand 735 states and 1012 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 15:50:51,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:50:51,473 INFO L93 Difference]: Finished difference Result 1466 states and 2019 transitions. [2024-11-13 15:50:51,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:50:51,474 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 156 [2024-11-13 15:50:51,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:50:51,478 INFO L225 Difference]: With dead ends: 1466 [2024-11-13 15:50:51,478 INFO L226 Difference]: Without dead ends: 759 [2024-11-13 15:50:51,482 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:50:51,482 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:50:51,482 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 611 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:50:51,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2024-11-13 15:50:51,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 759. [2024-11-13 15:50:51,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 759 states, 633 states have (on average 1.2859399684044235) internal successors, (814), 640 states have internal predecessors, (814), 111 states have call successors, (111), 14 states have call predecessors, (111), 14 states have return successors, (111), 104 states have call predecessors, (111), 111 states have call successors, (111) [2024-11-13 15:50:51,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1036 transitions. [2024-11-13 15:50:51,566 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1036 transitions. Word has length 156 [2024-11-13 15:50:51,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:50:51,566 INFO L471 AbstractCegarLoop]: Abstraction has 759 states and 1036 transitions. [2024-11-13 15:50:51,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 15:50:51,566 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1036 transitions. [2024-11-13 15:50:51,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-13 15:50:51,569 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:50:51,569 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:50:51,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-13 15:50:51,570 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:50:51,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:50:51,570 INFO L85 PathProgramCache]: Analyzing trace with hash 79032170, now seen corresponding path program 1 times [2024-11-13 15:50:51,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:50:51,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811695715] [2024-11-13 15:50:51,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:50:51,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:50:51,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 15:50:51,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1329168013] [2024-11-13 15:50:51,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:50:51,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:50:51,775 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:50:51,777 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:50:51,779 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 15:50:53,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:50:53,050 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 15:50:53,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:50:54,117 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 15:50:54,117 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 15:50:54,118 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 15:50:54,146 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 15:50:54,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-13 15:50:54,324 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:50:54,404 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 15:50:54,410 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 03:50:54 BoogieIcfgContainer [2024-11-13 15:50:54,411 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 15:50:54,411 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 15:50:54,412 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 15:50:54,412 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 15:50:54,413 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:49:28" (3/4) ... [2024-11-13 15:50:54,416 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 15:50:54,417 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 15:50:54,418 INFO L158 Benchmark]: Toolchain (without parser) took 87638.99ms. Allocated memory was 109.1MB in the beginning and 142.6MB in the end (delta: 33.6MB). Free memory was 84.4MB in the beginning and 88.5MB in the end (delta: -4.1MB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. [2024-11-13 15:50:54,419 INFO L158 Benchmark]: CDTParser took 1.45ms. Allocated memory is still 83.9MB. Free memory was 42.0MB in the beginning and 41.8MB in the end (delta: 196.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 15:50:54,419 INFO L158 Benchmark]: CACSL2BoogieTranslator took 372.45ms. Allocated memory is still 109.1MB. Free memory was 84.0MB in the beginning and 67.9MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 15:50:54,419 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.15ms. Allocated memory is still 109.1MB. Free memory was 67.9MB in the beginning and 63.9MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 15:50:54,420 INFO L158 Benchmark]: Boogie Preprocessor took 72.67ms. Allocated memory is still 109.1MB. Free memory was 63.9MB in the beginning and 60.8MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 15:50:54,421 INFO L158 Benchmark]: RCFGBuilder took 1027.11ms. Allocated memory is still 109.1MB. Free memory was 60.8MB in the beginning and 74.6MB in the end (delta: -13.8MB). Peak memory consumption was 30.6MB. Max. memory is 16.1GB. [2024-11-13 15:50:54,421 INFO L158 Benchmark]: TraceAbstraction took 86093.18ms. Allocated memory was 109.1MB in the beginning and 142.6MB in the end (delta: 33.6MB). Free memory was 74.3MB in the beginning and 88.5MB in the end (delta: -14.3MB). Peak memory consumption was 90.4MB. Max. memory is 16.1GB. [2024-11-13 15:50:54,421 INFO L158 Benchmark]: Witness Printer took 6.07ms. Allocated memory is still 142.6MB. Free memory was 88.5MB in the beginning and 88.5MB in the end (delta: 11.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 15:50:54,423 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.45ms. Allocated memory is still 83.9MB. Free memory was 42.0MB in the beginning and 41.8MB in the end (delta: 196.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 372.45ms. Allocated memory is still 109.1MB. Free memory was 84.0MB in the beginning and 67.9MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.15ms. Allocated memory is still 109.1MB. Free memory was 67.9MB in the beginning and 63.9MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 72.67ms. Allocated memory is still 109.1MB. Free memory was 63.9MB in the beginning and 60.8MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1027.11ms. Allocated memory is still 109.1MB. Free memory was 60.8MB in the beginning and 74.6MB in the end (delta: -13.8MB). Peak memory consumption was 30.6MB. Max. memory is 16.1GB. * TraceAbstraction took 86093.18ms. Allocated memory was 109.1MB in the beginning and 142.6MB in the end (delta: 33.6MB). Free memory was 74.3MB in the beginning and 88.5MB in the end (delta: -14.3MB). Peak memory consumption was 90.4MB. Max. memory is 16.1GB. * Witness Printer took 6.07ms. Allocated memory is still 142.6MB. Free memory was 88.5MB in the beginning and 88.5MB in the end (delta: 11.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 84, overapproximation of someBinaryDOUBLEComparisonOperation at line 109, overapproximation of someBinaryDOUBLEComparisonOperation at line 121, overapproximation of someBinaryDOUBLEComparisonOperation at line 83, overapproximation of someBinaryDOUBLEComparisonOperation at line 109, overapproximation of someBinaryDOUBLEComparisonOperation at line 121, overapproximation of someBinaryDOUBLEComparisonOperation at line 83. Possible FailurePath: [L40] unsigned char isInitial = 0; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { -4, 0, 0, 64, -2, -10, 128, 1, 8.4, 49.75, -2, 25, -5, 7.5, 1, -256 }; [L59] double last_1_WrapperStruct00_var_1_13 = 8.4; VAL [WrapperStruct00={4:0}, isInitial=0, last_1_WrapperStruct00_var_1_13=42/5] [L125] isInitial = 1 [L126] FCALL initially() [L127] COND TRUE 1 [L128] CALL updateLastVariables() [L118] EXPR WrapperStruct00.var_1_13 [L118] last_1_WrapperStruct00_var_1_13 = WrapperStruct00.var_1_13 [L128] RET updateLastVariables() [L129] CALL updateVariables() [L88] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L89] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L89] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L89] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L90] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L90] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L90] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L91] WrapperStruct00.var_1_3 = __VERIFIER_nondet_uchar() [L92] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L93] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L94] WrapperStruct00.var_1_8 = __VERIFIER_nondet_long() [L95] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= -2147483648) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L95] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= -2147483648) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L96] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 2147483647) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 2147483647) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L97] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_8 != 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_8 != 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L98] WrapperStruct00.var_1_9 = __VERIFIER_nondet_long() [L99] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= -2147483648) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= -2147483648) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L100] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 2147483647) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 2147483647) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L101] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_9 != 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_9 != 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L102] WrapperStruct00.var_1_11 = __VERIFIER_nondet_uchar() [L103] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= 127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L104] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 254) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 254) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L105] WrapperStruct00.var_1_12 = __VERIFIER_nondet_uchar() [L106] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L107] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L108] WrapperStruct00.var_1_15 = __VERIFIER_nondet_double() [L109] EXPR WrapperStruct00.var_1_15 [L109] EXPR WrapperStruct00.var_1_15 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F [L109] EXPR WrapperStruct00.var_1_15 [L109] EXPR WrapperStruct00.var_1_15 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L109] EXPR (WrapperStruct00.var_1_15 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L109] CALL assume_abort_if_not((WrapperStruct00.var_1_15 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L109] RET assume_abort_if_not((WrapperStruct00.var_1_15 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L110] WrapperStruct00.var_1_17 = __VERIFIER_nondet_char() [L111] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_17 >= -127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_17 >= -127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L112] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_17 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_17 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L113] WrapperStruct00.var_1_18 = __VERIFIER_nondet_char() [L114] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_18 >= -63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_18 >= -63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L115] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_18 <= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_18 <= 63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L129] RET updateVariables() [L130] CALL step() [L63] WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L63] COND FALSE !(WrapperStruct00.var_1_3) [L66] EXPR WrapperStruct00.var_1_15 [L66] WrapperStruct00.var_1_19 = WrapperStruct00.var_1_15 [L67] EXPR WrapperStruct00.var_1_16 [L67] WrapperStruct00.var_1_20 = WrapperStruct00.var_1_16 [L68] EXPR WrapperStruct00.var_1_18 [L68] WrapperStruct00.var_1_21 = WrapperStruct00.var_1_18 [L69] WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L69] COND FALSE !(WrapperStruct00.var_1_2) [L78] EXPR WrapperStruct00.var_1_16 [L78] EXPR WrapperStruct00.var_1_8 [L78] EXPR WrapperStruct00.var_1_9 [L78] EXPR WrapperStruct00.var_1_21 [L78] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L78] EXPR WrapperStruct00.var_1_21 | WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L78] COND TRUE ((WrapperStruct00.var_1_16 / WrapperStruct00.var_1_8) / WrapperStruct00.var_1_9) >= (WrapperStruct00.var_1_21 | WrapperStruct00.var_1_16) [L79] EXPR WrapperStruct00.var_1_11 [L79] EXPR WrapperStruct00.var_1_12 [L79] WrapperStruct00.var_1_7 = (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12) [L83] EXPR WrapperStruct00.var_1_19 [L83] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L83] EXPR ((last_1_WrapperStruct00_var_1_13) < (WrapperStruct00.var_1_19)) ? (last_1_WrapperStruct00_var_1_13) : (WrapperStruct00.var_1_19) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L83] COND TRUE WrapperStruct00.var_1_19 != ((((last_1_WrapperStruct00_var_1_13) < (WrapperStruct00.var_1_19)) ? (last_1_WrapperStruct00_var_1_13) : (WrapperStruct00.var_1_19))) [L84] EXPR WrapperStruct00.var_1_15 [L84] WrapperStruct00.var_1_13 = (WrapperStruct00.var_1_15 + (127.4 - 8.25)) [L130] RET step() [L131] CALL, EXPR property() [L121] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L121] EXPR WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_3 && (WrapperStruct00.var_1_19 <= (- 63.9f))) ? ((WrapperStruct00.var_1_19 >= WrapperStruct00.var_1_19) ? (WrapperStruct00.var_1_3 ? (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_21)) : 1) : 1) : 1) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L121] EXPR (WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_3 && (WrapperStruct00.var_1_19 <= (- 63.9f))) ? ((WrapperStruct00.var_1_19 >= WrapperStruct00.var_1_19) ? (WrapperStruct00.var_1_3 ? (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_21)) : 1) : 1) : 1) : 1) && ((((WrapperStruct00.var_1_16 / WrapperStruct00.var_1_8) / WrapperStruct00.var_1_9) >= (WrapperStruct00.var_1_21 | WrapperStruct00.var_1_16)) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12))) : (WrapperStruct00.var_1_7 == ((unsigned char) WrapperStruct00.var_1_12))) [L121] EXPR WrapperStruct00.var_1_16 [L121] EXPR WrapperStruct00.var_1_8 [L121] EXPR WrapperStruct00.var_1_9 [L121] EXPR WrapperStruct00.var_1_21 [L121] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L121] EXPR WrapperStruct00.var_1_21 | WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L121] EXPR (((WrapperStruct00.var_1_16 / WrapperStruct00.var_1_8) / WrapperStruct00.var_1_9) >= (WrapperStruct00.var_1_21 | WrapperStruct00.var_1_16)) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12))) : (WrapperStruct00.var_1_7 == ((unsigned char) WrapperStruct00.var_1_12)) [L121] EXPR WrapperStruct00.var_1_7 [L121] EXPR WrapperStruct00.var_1_11 [L121] EXPR WrapperStruct00.var_1_12 [L121] EXPR (((WrapperStruct00.var_1_16 / WrapperStruct00.var_1_8) / WrapperStruct00.var_1_9) >= (WrapperStruct00.var_1_21 | WrapperStruct00.var_1_16)) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12))) : (WrapperStruct00.var_1_7 == ((unsigned char) WrapperStruct00.var_1_12)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L121] EXPR (WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_3 && (WrapperStruct00.var_1_19 <= (- 63.9f))) ? ((WrapperStruct00.var_1_19 >= WrapperStruct00.var_1_19) ? (WrapperStruct00.var_1_3 ? (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_21)) : 1) : 1) : 1) : 1) && ((((WrapperStruct00.var_1_16 / WrapperStruct00.var_1_8) / WrapperStruct00.var_1_9) >= (WrapperStruct00.var_1_21 | WrapperStruct00.var_1_16)) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12))) : (WrapperStruct00.var_1_7 == ((unsigned char) WrapperStruct00.var_1_12))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L121] EXPR ((WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_3 && (WrapperStruct00.var_1_19 <= (- 63.9f))) ? ((WrapperStruct00.var_1_19 >= WrapperStruct00.var_1_19) ? (WrapperStruct00.var_1_3 ? (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_21)) : 1) : 1) : 1) : 1) && ((((WrapperStruct00.var_1_16 / WrapperStruct00.var_1_8) / WrapperStruct00.var_1_9) >= (WrapperStruct00.var_1_21 | WrapperStruct00.var_1_16)) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12))) : (WrapperStruct00.var_1_7 == ((unsigned char) WrapperStruct00.var_1_12)))) && ((WrapperStruct00.var_1_19 != ((((last_1_WrapperStruct00_var_1_13) < (WrapperStruct00.var_1_19)) ? (last_1_WrapperStruct00_var_1_13) : (WrapperStruct00.var_1_19)))) ? (WrapperStruct00.var_1_13 == ((double) (WrapperStruct00.var_1_15 + (127.4 - 8.25)))) : 1) [L121] EXPR WrapperStruct00.var_1_19 [L121] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L121] EXPR ((last_1_WrapperStruct00_var_1_13) < (WrapperStruct00.var_1_19)) ? (last_1_WrapperStruct00_var_1_13) : (WrapperStruct00.var_1_19) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L121] EXPR (WrapperStruct00.var_1_19 != ((((last_1_WrapperStruct00_var_1_13) < (WrapperStruct00.var_1_19)) ? (last_1_WrapperStruct00_var_1_13) : (WrapperStruct00.var_1_19)))) ? (WrapperStruct00.var_1_13 == ((double) (WrapperStruct00.var_1_15 + (127.4 - 8.25)))) : 1 [L121] EXPR WrapperStruct00.var_1_13 [L121] EXPR WrapperStruct00.var_1_15 [L121] EXPR (WrapperStruct00.var_1_19 != ((((last_1_WrapperStruct00_var_1_13) < (WrapperStruct00.var_1_19)) ? (last_1_WrapperStruct00_var_1_13) : (WrapperStruct00.var_1_19)))) ? (WrapperStruct00.var_1_13 == ((double) (WrapperStruct00.var_1_15 + (127.4 - 8.25)))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L121] EXPR ((WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_3 && (WrapperStruct00.var_1_19 <= (- 63.9f))) ? ((WrapperStruct00.var_1_19 >= WrapperStruct00.var_1_19) ? (WrapperStruct00.var_1_3 ? (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_21)) : 1) : 1) : 1) : 1) && ((((WrapperStruct00.var_1_16 / WrapperStruct00.var_1_8) / WrapperStruct00.var_1_9) >= (WrapperStruct00.var_1_21 | WrapperStruct00.var_1_16)) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12))) : (WrapperStruct00.var_1_7 == ((unsigned char) WrapperStruct00.var_1_12)))) && ((WrapperStruct00.var_1_19 != ((((last_1_WrapperStruct00_var_1_13) < (WrapperStruct00.var_1_19)) ? (last_1_WrapperStruct00_var_1_13) : (WrapperStruct00.var_1_19)))) ? (WrapperStruct00.var_1_13 == ((double) (WrapperStruct00.var_1_15 + (127.4 - 8.25)))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L121] EXPR (((WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_3 && (WrapperStruct00.var_1_19 <= (- 63.9f))) ? ((WrapperStruct00.var_1_19 >= WrapperStruct00.var_1_19) ? (WrapperStruct00.var_1_3 ? (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_21)) : 1) : 1) : 1) : 1) && ((((WrapperStruct00.var_1_16 / WrapperStruct00.var_1_8) / WrapperStruct00.var_1_9) >= (WrapperStruct00.var_1_21 | WrapperStruct00.var_1_16)) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12))) : (WrapperStruct00.var_1_7 == ((unsigned char) WrapperStruct00.var_1_12)))) && ((WrapperStruct00.var_1_19 != ((((last_1_WrapperStruct00_var_1_13) < (WrapperStruct00.var_1_19)) ? (last_1_WrapperStruct00_var_1_13) : (WrapperStruct00.var_1_19)))) ? (WrapperStruct00.var_1_13 == ((double) (WrapperStruct00.var_1_15 + (127.4 - 8.25)))) : 1)) && (WrapperStruct00.var_1_3 ? (WrapperStruct00.var_1_16 == ((signed char) ((((WrapperStruct00.var_1_17) > ((-2 + WrapperStruct00.var_1_18))) ? (WrapperStruct00.var_1_17) : ((-2 + WrapperStruct00.var_1_18)))))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L121] EXPR ((((WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_3 && (WrapperStruct00.var_1_19 <= (- 63.9f))) ? ((WrapperStruct00.var_1_19 >= WrapperStruct00.var_1_19) ? (WrapperStruct00.var_1_3 ? (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_21)) : 1) : 1) : 1) : 1) && ((((WrapperStruct00.var_1_16 / WrapperStruct00.var_1_8) / WrapperStruct00.var_1_9) >= (WrapperStruct00.var_1_21 | WrapperStruct00.var_1_16)) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12))) : (WrapperStruct00.var_1_7 == ((unsigned char) WrapperStruct00.var_1_12)))) && ((WrapperStruct00.var_1_19 != ((((last_1_WrapperStruct00_var_1_13) < (WrapperStruct00.var_1_19)) ? (last_1_WrapperStruct00_var_1_13) : (WrapperStruct00.var_1_19)))) ? (WrapperStruct00.var_1_13 == ((double) (WrapperStruct00.var_1_15 + (127.4 - 8.25)))) : 1)) && (WrapperStruct00.var_1_3 ? (WrapperStruct00.var_1_16 == ((signed char) ((((WrapperStruct00.var_1_17) > ((-2 + WrapperStruct00.var_1_18))) ? (WrapperStruct00.var_1_17) : ((-2 + WrapperStruct00.var_1_18)))))) : 1)) && (WrapperStruct00.var_1_19 == ((float) WrapperStruct00.var_1_15)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L121] EXPR (((((WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_3 && (WrapperStruct00.var_1_19 <= (- 63.9f))) ? ((WrapperStruct00.var_1_19 >= WrapperStruct00.var_1_19) ? (WrapperStruct00.var_1_3 ? (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_21)) : 1) : 1) : 1) : 1) && ((((WrapperStruct00.var_1_16 / WrapperStruct00.var_1_8) / WrapperStruct00.var_1_9) >= (WrapperStruct00.var_1_21 | WrapperStruct00.var_1_16)) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12))) : (WrapperStruct00.var_1_7 == ((unsigned char) WrapperStruct00.var_1_12)))) && ((WrapperStruct00.var_1_19 != ((((last_1_WrapperStruct00_var_1_13) < (WrapperStruct00.var_1_19)) ? (last_1_WrapperStruct00_var_1_13) : (WrapperStruct00.var_1_19)))) ? (WrapperStruct00.var_1_13 == ((double) (WrapperStruct00.var_1_15 + (127.4 - 8.25)))) : 1)) && (WrapperStruct00.var_1_3 ? (WrapperStruct00.var_1_16 == ((signed char) ((((WrapperStruct00.var_1_17) > ((-2 + WrapperStruct00.var_1_18))) ? (WrapperStruct00.var_1_17) : ((-2 + WrapperStruct00.var_1_18)))))) : 1)) && (WrapperStruct00.var_1_19 == ((float) WrapperStruct00.var_1_15))) && (WrapperStruct00.var_1_20 == ((signed short int) WrapperStruct00.var_1_16)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L121] EXPR ((((((WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_3 && (WrapperStruct00.var_1_19 <= (- 63.9f))) ? ((WrapperStruct00.var_1_19 >= WrapperStruct00.var_1_19) ? (WrapperStruct00.var_1_3 ? (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_21)) : 1) : 1) : 1) : 1) && ((((WrapperStruct00.var_1_16 / WrapperStruct00.var_1_8) / WrapperStruct00.var_1_9) >= (WrapperStruct00.var_1_21 | WrapperStruct00.var_1_16)) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12))) : (WrapperStruct00.var_1_7 == ((unsigned char) WrapperStruct00.var_1_12)))) && ((WrapperStruct00.var_1_19 != ((((last_1_WrapperStruct00_var_1_13) < (WrapperStruct00.var_1_19)) ? (last_1_WrapperStruct00_var_1_13) : (WrapperStruct00.var_1_19)))) ? (WrapperStruct00.var_1_13 == ((double) (WrapperStruct00.var_1_15 + (127.4 - 8.25)))) : 1)) && (WrapperStruct00.var_1_3 ? (WrapperStruct00.var_1_16 == ((signed char) ((((WrapperStruct00.var_1_17) > ((-2 + WrapperStruct00.var_1_18))) ? (WrapperStruct00.var_1_17) : ((-2 + WrapperStruct00.var_1_18)))))) : 1)) && (WrapperStruct00.var_1_19 == ((float) WrapperStruct00.var_1_15))) && (WrapperStruct00.var_1_20 == ((signed short int) WrapperStruct00.var_1_16))) && (WrapperStruct00.var_1_21 == ((signed short int) WrapperStruct00.var_1_18)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L121-L122] return ((((((WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_3 && (WrapperStruct00.var_1_19 <= (- 63.9f))) ? ((WrapperStruct00.var_1_19 >= WrapperStruct00.var_1_19) ? (WrapperStruct00.var_1_3 ? (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_21)) : 1) : 1) : 1) : 1) && ((((WrapperStruct00.var_1_16 / WrapperStruct00.var_1_8) / WrapperStruct00.var_1_9) >= (WrapperStruct00.var_1_21 | WrapperStruct00.var_1_16)) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12))) : (WrapperStruct00.var_1_7 == ((unsigned char) WrapperStruct00.var_1_12)))) && ((WrapperStruct00.var_1_19 != ((((last_1_WrapperStruct00_var_1_13) < (WrapperStruct00.var_1_19)) ? (last_1_WrapperStruct00_var_1_13) : (WrapperStruct00.var_1_19)))) ? (WrapperStruct00.var_1_13 == ((double) (WrapperStruct00.var_1_15 + (127.4 - 8.25)))) : 1)) && (WrapperStruct00.var_1_3 ? (WrapperStruct00.var_1_16 == ((signed char) ((((WrapperStruct00.var_1_17) > ((-2 + WrapperStruct00.var_1_18))) ? (WrapperStruct00.var_1_17) : ((-2 + WrapperStruct00.var_1_18)))))) : 1)) && (WrapperStruct00.var_1_19 == ((float) WrapperStruct00.var_1_15))) && (WrapperStruct00.var_1_20 == ((signed short int) WrapperStruct00.var_1_16))) && (WrapperStruct00.var_1_21 == ((signed short int) WrapperStruct00.var_1_18)) ; [L131] RET, EXPR property() [L131] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=42/5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 113 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 85.9s, OverallIterations: 16, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 30.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 947 SdHoareTripleChecker+Valid, 17.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 940 mSDsluCounter, 9836 SdHoareTripleChecker+Invalid, 15.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7485 mSDsCounter, 70 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4072 IncrementalHoareTripleChecker+Invalid, 4142 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 70 mSolverCounterUnsat, 2351 mSDtfsCounter, 4072 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 765 GetRequests, 685 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 18.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=759occurred in iteration=15, InterpolantAutomatonStates: 91, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 15 MinimizatonAttempts, 383 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 49.1s InterpolantComputationTime, 2613 NumberOfCodeBlocks, 2613 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 2286 ConstructedInterpolants, 0 QuantifiedInterpolants, 23167 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 10260/10260 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-13 15:50:54,583 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-40.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/bin/uautomizer-verify-qhAvR1uOyd --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 213b4bc058d12ef32d87a969037b39ae9c0589373b4a3de6d034bf3aa394040f --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 15:50:57,054 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 15:50:57,196 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-13 15:50:57,206 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 15:50:57,207 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 15:50:57,249 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 15:50:57,250 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 15:50:57,251 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 15:50:57,251 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 15:50:57,251 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 15:50:57,251 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 15:50:57,251 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 15:50:57,252 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 15:50:57,252 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 15:50:57,254 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 15:50:57,254 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 15:50:57,254 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 15:50:57,254 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 15:50:57,254 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 15:50:57,254 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 15:50:57,254 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 15:50:57,254 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 15:50:57,254 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 15:50:57,254 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 15:50:57,255 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 15:50:57,255 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 15:50:57,255 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 15:50:57,255 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 15:50:57,255 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 15:50:57,255 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 15:50:57,255 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 15:50:57,255 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 15:50:57,255 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 15:50:57,255 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 15:50:57,255 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:50:57,255 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 15:50:57,255 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 15:50:57,256 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 15:50:57,256 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-13 15:50:57,256 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 15:50:57,256 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 15:50:57,256 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 15:50:57,256 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 15:50:57,256 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 15:50:57,256 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/bin/uautomizer-verify-qhAvR1uOyd 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 -> 213b4bc058d12ef32d87a969037b39ae9c0589373b4a3de6d034bf3aa394040f [2024-11-13 15:50:57,606 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 15:50:57,615 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 15:50:57,618 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 15:50:57,619 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 15:50:57,620 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 15:50:57,621 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-40.i Unable to find full path for "g++" [2024-11-13 15:50:59,801 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 15:51:00,172 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 15:51:00,173 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-40.i [2024-11-13 15:51:00,190 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/bin/uautomizer-verify-qhAvR1uOyd/data/9c0abc07a/1bf6b8a4f6ca4d7cab28a4fee3dcb941/FLAG33bc47bb6 [2024-11-13 15:51:00,218 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/bin/uautomizer-verify-qhAvR1uOyd/data/9c0abc07a/1bf6b8a4f6ca4d7cab28a4fee3dcb941 [2024-11-13 15:51:00,222 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 15:51:00,224 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 15:51:00,228 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 15:51:00,230 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 15:51:00,235 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 15:51:00,236 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:51:00" (1/1) ... [2024-11-13 15:51:00,238 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25d0d9f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:51:00, skipping insertion in model container [2024-11-13 15:51:00,240 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:51:00" (1/1) ... [2024-11-13 15:51:00,268 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 15:51:00,496 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-40.i[916,929] [2024-11-13 15:51:00,600 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:51:00,622 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 15:51:00,635 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-40.i[916,929] [2024-11-13 15:51:00,706 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:51:00,759 INFO L204 MainTranslator]: Completed translation [2024-11-13 15:51:00,761 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:51:00 WrapperNode [2024-11-13 15:51:00,761 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 15:51:00,763 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 15:51:00,765 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 15:51:00,766 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 15:51:00,774 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:51:00" (1/1) ... [2024-11-13 15:51:00,808 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:51:00" (1/1) ... [2024-11-13 15:51:00,879 INFO L138 Inliner]: procedures = 40, calls = 151, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 441 [2024-11-13 15:51:00,880 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 15:51:00,880 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 15:51:00,881 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 15:51:00,881 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 15:51:00,902 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:51:00" (1/1) ... [2024-11-13 15:51:00,903 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:51:00" (1/1) ... [2024-11-13 15:51:00,918 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:51:00" (1/1) ... [2024-11-13 15:51:00,967 INFO L175 MemorySlicer]: Split 121 memory accesses to 2 slices as follows [2, 119]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 34 writes are split as follows [0, 34]. [2024-11-13 15:51:00,968 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:51:00" (1/1) ... [2024-11-13 15:51:00,968 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:51:00" (1/1) ... [2024-11-13 15:51:01,024 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:51:00" (1/1) ... [2024-11-13 15:51:01,029 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:51:00" (1/1) ... [2024-11-13 15:51:01,040 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:51:00" (1/1) ... [2024-11-13 15:51:01,046 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:51:00" (1/1) ... [2024-11-13 15:51:01,061 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 15:51:01,062 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 15:51:01,062 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 15:51:01,062 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 15:51:01,067 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:51:00" (1/1) ... [2024-11-13 15:51:01,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:51:01,096 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:51:01,114 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 15:51:01,124 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 15:51:01,157 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 15:51:01,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-13 15:51:01,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-13 15:51:01,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2024-11-13 15:51:01,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2024-11-13 15:51:01,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-13 15:51:01,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-13 15:51:01,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-13 15:51:01,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-13 15:51:01,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-13 15:51:01,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-13 15:51:01,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-13 15:51:01,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-13 15:51:01,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-13 15:51:01,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-13 15:51:01,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-13 15:51:01,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-13 15:51:01,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-13 15:51:01,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-13 15:51:01,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-13 15:51:01,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-13 15:51:01,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2024-11-13 15:51:01,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2024-11-13 15:51:01,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-13 15:51:01,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-13 15:51:01,163 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 15:51:01,163 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 15:51:01,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-13 15:51:01,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-13 15:51:01,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 15:51:01,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 15:51:01,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-13 15:51:01,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-13 15:51:01,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-13 15:51:01,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-13 15:51:01,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-13 15:51:01,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-13 15:51:01,442 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 15:51:01,444 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 15:51:05,993 INFO L? ?]: Removed 95 outVars from TransFormulas that were not future-live. [2024-11-13 15:51:05,993 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 15:51:06,012 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 15:51:06,015 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 15:51:06,016 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:51:06 BoogieIcfgContainer [2024-11-13 15:51:06,016 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 15:51:06,018 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 15:51:06,019 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 15:51:06,026 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 15:51:06,026 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 03:51:00" (1/3) ... [2024-11-13 15:51:06,027 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e78ee2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:51:06, skipping insertion in model container [2024-11-13 15:51:06,027 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:51:00" (2/3) ... [2024-11-13 15:51:06,027 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e78ee2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:51:06, skipping insertion in model container [2024-11-13 15:51:06,029 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:51:06" (3/3) ... [2024-11-13 15:51:06,031 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-40.i [2024-11-13 15:51:06,049 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 15:51:06,051 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-40.i that has 2 procedures, 107 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 15:51:06,138 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 15:51:06,151 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3b5b2ee4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 15:51:06,153 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 15:51:06,161 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 85 states have (on average 1.4) internal successors, (119), 86 states have internal predecessors, (119), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-13 15:51:06,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-13 15:51:06,182 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:51:06,184 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:51:06,184 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:51:06,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:51:06,192 INFO L85 PathProgramCache]: Analyzing trace with hash 720397154, now seen corresponding path program 1 times [2024-11-13 15:51:06,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:51:06,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [980846483] [2024-11-13 15:51:06,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:51:06,207 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 15:51:06,207 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:51:06,212 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 15:51:06,213 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-13 15:51:06,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:51:06,885 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-13 15:51:06,896 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:51:06,944 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 356 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2024-11-13 15:51:06,945 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:51:06,945 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:51:06,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [980846483] [2024-11-13 15:51:06,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [980846483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:51:06,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:51:06,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:51:06,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428325819] [2024-11-13 15:51:06,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:51:06,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 15:51:06,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:51:06,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 15:51:06,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 15:51:06,981 INFO L87 Difference]: Start difference. First operand has 107 states, 85 states have (on average 1.4) internal successors, (119), 86 states have internal predecessors, (119), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-13 15:51:07,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:51:07,020 INFO L93 Difference]: Finished difference Result 207 states and 327 transitions. [2024-11-13 15:51:07,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 15:51:07,022 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 149 [2024-11-13 15:51:07,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:51:07,031 INFO L225 Difference]: With dead ends: 207 [2024-11-13 15:51:07,031 INFO L226 Difference]: Without dead ends: 103 [2024-11-13 15:51:07,035 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 15:51:07,039 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:51:07,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:51:07,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-13 15:51:07,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-13 15:51:07,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 82 states have (on average 1.3658536585365855) internal successors, (112), 82 states have internal predecessors, (112), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-13 15:51:07,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 150 transitions. [2024-11-13 15:51:07,115 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 150 transitions. Word has length 149 [2024-11-13 15:51:07,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:51:07,117 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 150 transitions. [2024-11-13 15:51:07,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-13 15:51:07,117 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 150 transitions. [2024-11-13 15:51:07,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-13 15:51:07,124 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:51:07,125 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:51:07,139 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-13 15:51:07,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 15:51:07,326 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:51:07,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:51:07,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1606994992, now seen corresponding path program 1 times [2024-11-13 15:51:07,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:51:07,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [94417453] [2024-11-13 15:51:07,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:51:07,329 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 15:51:07,329 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:51:07,332 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 15:51:07,335 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-13 15:51:07,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:51:08,004 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 15:51:08,013 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:51:08,115 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 15:51:08,115 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:51:08,115 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:51:08,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [94417453] [2024-11-13 15:51:08,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [94417453] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:51:08,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:51:08,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:51:08,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659631824] [2024-11-13 15:51:08,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:51:08,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:51:08,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:51:08,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:51:08,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:51:08,120 INFO L87 Difference]: Start difference. First operand 103 states and 150 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 15:51:08,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:51:08,219 INFO L93 Difference]: Finished difference Result 205 states and 300 transitions. [2024-11-13 15:51:08,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:51:08,220 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 149 [2024-11-13 15:51:08,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:51:08,223 INFO L225 Difference]: With dead ends: 205 [2024-11-13 15:51:08,223 INFO L226 Difference]: Without dead ends: 105 [2024-11-13 15:51:08,224 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:51:08,225 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:51:08,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 433 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:51:08,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-13 15:51:08,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-11-13 15:51:08,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 84 states have (on average 1.3571428571428572) internal successors, (114), 84 states have internal predecessors, (114), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-13 15:51:08,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 152 transitions. [2024-11-13 15:51:08,243 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 152 transitions. Word has length 149 [2024-11-13 15:51:08,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:51:08,245 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 152 transitions. [2024-11-13 15:51:08,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 15:51:08,245 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 152 transitions. [2024-11-13 15:51:08,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 15:51:08,248 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:51:08,249 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:51:08,261 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-13 15:51:08,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 15:51:08,453 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:51:08,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:51:08,454 INFO L85 PathProgramCache]: Analyzing trace with hash 14358315, now seen corresponding path program 1 times [2024-11-13 15:51:08,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:51:08,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1440763177] [2024-11-13 15:51:08,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:51:08,455 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 15:51:08,455 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:51:08,460 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 15:51:08,461 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-13 15:51:09,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:51:09,111 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 15:51:09,117 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:51:09,255 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 15:51:09,255 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:51:09,255 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:51:09,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1440763177] [2024-11-13 15:51:09,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1440763177] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:51:09,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:51:09,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 15:51:09,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748092274] [2024-11-13 15:51:09,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:51:09,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 15:51:09,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:51:09,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 15:51:09,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:51:09,259 INFO L87 Difference]: Start difference. First operand 105 states and 152 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 15:51:09,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:51:09,695 INFO L93 Difference]: Finished difference Result 214 states and 311 transitions. [2024-11-13 15:51:09,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 15:51:09,696 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2024-11-13 15:51:09,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:51:09,698 INFO L225 Difference]: With dead ends: 214 [2024-11-13 15:51:09,699 INFO L226 Difference]: Without dead ends: 112 [2024-11-13 15:51:09,700 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:51:09,701 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 1 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 15:51:09,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 695 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 15:51:09,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-13 15:51:09,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2024-11-13 15:51:09,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 90 states have (on average 1.3333333333333333) internal successors, (120), 90 states have internal predecessors, (120), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-13 15:51:09,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 158 transitions. [2024-11-13 15:51:09,715 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 158 transitions. Word has length 151 [2024-11-13 15:51:09,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:51:09,716 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 158 transitions. [2024-11-13 15:51:09,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 15:51:09,717 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 158 transitions. [2024-11-13 15:51:09,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 15:51:09,720 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:51:09,720 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:51:09,738 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-13 15:51:09,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 15:51:09,921 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:51:09,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:51:09,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1789365677, now seen corresponding path program 1 times [2024-11-13 15:51:09,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:51:09,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [540644404] [2024-11-13 15:51:09,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:51:09,925 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 15:51:09,925 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:51:09,928 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 15:51:09,932 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-13 15:51:10,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:51:10,552 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 15:51:10,558 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:51:10,712 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 15:51:10,712 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:51:10,712 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:51:10,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [540644404] [2024-11-13 15:51:10,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [540644404] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:51:10,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:51:10,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 15:51:10,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276013799] [2024-11-13 15:51:10,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:51:10,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 15:51:10,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:51:10,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 15:51:10,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:51:10,716 INFO L87 Difference]: Start difference. First operand 111 states and 158 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 15:51:11,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:51:11,035 INFO L93 Difference]: Finished difference Result 222 states and 317 transitions. [2024-11-13 15:51:11,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 15:51:11,036 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2024-11-13 15:51:11,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:51:11,039 INFO L225 Difference]: With dead ends: 222 [2024-11-13 15:51:11,039 INFO L226 Difference]: Without dead ends: 114 [2024-11-13 15:51:11,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:51:11,041 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 1 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 827 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 15:51:11,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 827 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 15:51:11,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-13 15:51:11,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2024-11-13 15:51:11,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 92 states have (on average 1.326086956521739) internal successors, (122), 92 states have internal predecessors, (122), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-13 15:51:11,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 160 transitions. [2024-11-13 15:51:11,055 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 160 transitions. Word has length 151 [2024-11-13 15:51:11,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:51:11,056 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 160 transitions. [2024-11-13 15:51:11,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 15:51:11,057 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 160 transitions. [2024-11-13 15:51:11,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 15:51:11,060 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:51:11,060 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:51:11,075 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-13 15:51:11,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 15:51:11,261 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:51:11,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:51:11,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1791212719, now seen corresponding path program 1 times [2024-11-13 15:51:11,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:51:11,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1350387079] [2024-11-13 15:51:11,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:51:11,263 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 15:51:11,263 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:51:11,265 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 15:51:11,268 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-13 15:51:11,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:51:12,023 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 15:51:12,029 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:51:12,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 19 [2024-11-13 15:51:13,003 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 15:51:13,003 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:51:13,003 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:51:13,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1350387079] [2024-11-13 15:51:13,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1350387079] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:51:13,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:51:13,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:51:13,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749178845] [2024-11-13 15:51:13,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:51:13,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:51:13,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:51:13,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:51:13,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:51:13,007 INFO L87 Difference]: Start difference. First operand 113 states and 160 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 15:51:15,064 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:51:21,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:51:25,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:51:29,181 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:51:29,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:51:29,184 INFO L93 Difference]: Finished difference Result 224 states and 319 transitions. [2024-11-13 15:51:29,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:51:29,213 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2024-11-13 15:51:29,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:51:29,217 INFO L225 Difference]: With dead ends: 224 [2024-11-13 15:51:29,217 INFO L226 Difference]: Without dead ends: 114 [2024-11-13 15:51:29,218 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:51:29,219 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:51:29,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 420 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 16.2s Time] [2024-11-13 15:51:29,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-13 15:51:29,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-11-13 15:51:29,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 93 states have (on average 1.3225806451612903) internal successors, (123), 93 states have internal predecessors, (123), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-13 15:51:29,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 161 transitions. [2024-11-13 15:51:29,236 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 161 transitions. Word has length 151 [2024-11-13 15:51:29,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:51:29,237 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 161 transitions. [2024-11-13 15:51:29,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 15:51:29,237 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 161 transitions. [2024-11-13 15:51:29,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 15:51:29,240 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:51:29,240 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:51:29,268 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-13 15:51:29,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 15:51:29,441 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:51:29,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:51:29,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1368510893, now seen corresponding path program 1 times [2024-11-13 15:51:29,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:51:29,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [466849447] [2024-11-13 15:51:29,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:51:29,445 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 15:51:29,445 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:51:29,448 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 15:51:29,451 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-13 15:51:30,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:51:30,522 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-13 15:51:30,533 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:51:30,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 102 [2024-11-13 15:51:31,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 196 treesize of output 168 [2024-11-13 15:51:34,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 1 [2024-11-13 15:51:36,136 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:51:36,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 132 treesize of output 59 [2024-11-13 15:51:37,244 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:51:37,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 132 treesize of output 59 [2024-11-13 15:51:38,542 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:51:38,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 237 treesize of output 142 [2024-11-13 15:51:45,728 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:51:45,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 245 treesize of output 139 [2024-11-13 15:51:46,819 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:51:46,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 253 treesize of output 85 [2024-11-13 15:51:50,720 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 280 proven. 0 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2024-11-13 15:51:50,721 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:51:50,721 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:51:50,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [466849447] [2024-11-13 15:51:50,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [466849447] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:51:50,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:51:50,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-13 15:51:50,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226927574] [2024-11-13 15:51:50,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:51:50,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 15:51:50,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:51:50,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 15:51:50,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-13 15:51:50,724 INFO L87 Difference]: Start difference. First operand 114 states and 161 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-13 15:52:17,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:52:28,213 WARN L286 SmtUtils]: Spent 7.53s on a formula simplification that was a NOOP. DAG size: 97 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 15:52:33,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:52:35,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:52:39,398 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:52:43,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:52:54,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:52:57,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:53:02,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:53:07,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:53:08,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:53:09,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:53:09,148 INFO L93 Difference]: Finished difference Result 472 states and 662 transitions. [2024-11-13 15:53:09,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 15:53:09,155 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 151 [2024-11-13 15:53:09,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:53:09,158 INFO L225 Difference]: With dead ends: 472 [2024-11-13 15:53:09,158 INFO L226 Difference]: Without dead ends: 361 [2024-11-13 15:53:09,159 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 19.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-13 15:53:09,160 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 423 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 15 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 64.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 66.9s IncrementalHoareTripleChecker+Time [2024-11-13 15:53:09,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 561 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 743 Invalid, 2 Unknown, 0 Unchecked, 66.9s Time] [2024-11-13 15:53:09,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2024-11-13 15:53:09,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 196. [2024-11-13 15:53:09,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 148 states have (on average 1.2837837837837838) internal successors, (190), 149 states have internal predecessors, (190), 43 states have call successors, (43), 4 states have call predecessors, (43), 4 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-13 15:53:09,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 276 transitions. [2024-11-13 15:53:09,220 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 276 transitions. Word has length 151 [2024-11-13 15:53:09,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:53:09,221 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 276 transitions. [2024-11-13 15:53:09,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-13 15:53:09,225 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 276 transitions. [2024-11-13 15:53:09,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 15:53:09,228 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:53:09,228 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:53:09,254 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-13 15:53:09,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 15:53:09,432 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:53:09,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:53:09,433 INFO L85 PathProgramCache]: Analyzing trace with hash 2010067437, now seen corresponding path program 1 times [2024-11-13 15:53:09,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:53:09,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1940281829] [2024-11-13 15:53:09,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:53:09,433 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 15:53:09,434 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:53:09,438 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 15:53:09,439 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-13 15:53:10,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:53:10,388 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-13 15:53:10,396 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:53:10,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-13 15:53:10,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2024-11-13 15:53:11,544 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:53:11,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 58 treesize of output 43 [2024-11-13 15:53:16,202 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:53:16,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 56 [2024-11-13 15:53:17,245 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:53:17,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 54 [2024-11-13 15:53:18,129 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:53:18,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 89 treesize of output 96 [2024-11-13 15:53:18,644 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:53:18,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 112 treesize of output 120 [2024-11-13 15:53:20,075 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:53:20,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 182 treesize of output 80 [2024-11-13 15:53:20,525 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 433 proven. 36 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2024-11-13 15:53:20,525 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:53:21,568 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 15:53:21,568 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:53:21,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1940281829] [2024-11-13 15:53:21,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1940281829] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 15:53:21,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 15:53:21,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [18] total 20 [2024-11-13 15:53:21,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010528948] [2024-11-13 15:53:21,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:53:21,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 15:53:21,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:53:21,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 15:53:21,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=311, Unknown=1, NotChecked=0, Total=380 [2024-11-13 15:53:21,571 INFO L87 Difference]: Start difference. First operand 196 states and 276 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 15:53:22,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 15:53:25,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 15:53:28,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 15:53:30,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:53:30,131 INFO L93 Difference]: Finished difference Result 386 states and 541 transitions. [2024-11-13 15:53:30,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 15:53:30,132 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2024-11-13 15:53:30,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:53:30,137 INFO L225 Difference]: With dead ends: 386 [2024-11-13 15:53:30,137 INFO L226 Difference]: Without dead ends: 275 [2024-11-13 15:53:30,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=80, Invalid=425, Unknown=1, NotChecked=0, Total=506 [2024-11-13 15:53:30,139 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 82 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2024-11-13 15:53:30,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 679 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 8.3s Time] [2024-11-13 15:53:30,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-11-13 15:53:30,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 272. [2024-11-13 15:53:30,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 213 states have (on average 1.2863849765258215) internal successors, (274), 215 states have internal predecessors, (274), 53 states have call successors, (53), 5 states have call predecessors, (53), 5 states have return successors, (53), 51 states have call predecessors, (53), 53 states have call successors, (53) [2024-11-13 15:53:30,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 380 transitions. [2024-11-13 15:53:30,187 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 380 transitions. Word has length 151 [2024-11-13 15:53:30,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:53:30,188 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 380 transitions. [2024-11-13 15:53:30,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 15:53:30,188 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 380 transitions. [2024-11-13 15:53:30,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 15:53:30,191 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:53:30,191 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:53:30,211 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-13 15:53:30,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 15:53:30,395 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:53:30,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:53:30,396 INFO L85 PathProgramCache]: Analyzing trace with hash 988999083, now seen corresponding path program 1 times [2024-11-13 15:53:30,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:53:30,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [381864289] [2024-11-13 15:53:30,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:53:30,396 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 15:53:30,397 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:53:30,399 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 15:53:30,400 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-13 15:53:31,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:53:31,200 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-13 15:53:31,209 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:53:31,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:53:31,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:53:31,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:53:31,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:53:31,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:53:31,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:53:31,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:53:31,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:53:31,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:53:31,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:53:31,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 51 [2024-11-13 15:53:31,609 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:53:31,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 70 treesize of output 66 [2024-11-13 15:53:32,405 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:53:32,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 65 treesize of output 76 [2024-11-13 15:53:33,453 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:53:33,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 80 treesize of output 79 [2024-11-13 15:53:34,965 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:53:34,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 80 treesize of output 79 [2024-11-13 15:53:36,334 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:53:36,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 75 treesize of output 89 [2024-11-13 15:53:37,621 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:53:37,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 85 treesize of output 102 [2024-11-13 15:53:39,026 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:53:39,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 101 treesize of output 125 [2024-11-13 15:53:44,363 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:53:44,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 115 treesize of output 132 [2024-11-13 15:53:50,041 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:53:50,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 120 treesize of output 122 [2024-11-13 15:53:56,036 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:53:56,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 138 treesize of output 133 [2024-11-13 15:53:57,093 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:53:57,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 166 treesize of output 165 [2024-11-13 15:54:11,636 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:54:11,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 188 treesize of output 80 [2024-11-13 15:54:14,108 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 296 proven. 256 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2024-11-13 15:54:14,108 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:54:26,909 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 15:54:26,909 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:54:26,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [381864289] [2024-11-13 15:54:26,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [381864289] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 15:54:26,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 15:54:26,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 16 [2024-11-13 15:54:26,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351558931] [2024-11-13 15:54:26,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:54:26,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:54:26,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:54:26,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:54:26,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=174, Unknown=3, NotChecked=0, Total=240 [2024-11-13 15:54:26,912 INFO L87 Difference]: Start difference. First operand 272 states and 380 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 15:54:31,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 15:54:35,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 15:54:46,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 15:54:51,105 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 15:54:55,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 15:55:03,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 15:55:08,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:55:08,670 INFO L93 Difference]: Finished difference Result 509 states and 708 transitions. [2024-11-13 15:55:08,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:55:08,688 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2024-11-13 15:55:08,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:55:08,691 INFO L225 Difference]: With dead ends: 509 [2024-11-13 15:55:08,691 INFO L226 Difference]: Without dead ends: 322 [2024-11-13 15:55:08,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 31.3s TimeCoverageRelationStatistics Valid=68, Invalid=201, Unknown=3, NotChecked=0, Total=272 [2024-11-13 15:55:08,693 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 104 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 2 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 37.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 39.5s IncrementalHoareTripleChecker+Time [2024-11-13 15:55:08,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 365 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 113 Invalid, 4 Unknown, 0 Unchecked, 39.5s Time] [2024-11-13 15:55:08,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-11-13 15:55:08,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 286. [2024-11-13 15:55:08,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 227 states have (on average 1.2951541850220265) internal successors, (294), 229 states have internal predecessors, (294), 53 states have call successors, (53), 5 states have call predecessors, (53), 5 states have return successors, (53), 51 states have call predecessors, (53), 53 states have call successors, (53) [2024-11-13 15:55:08,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 400 transitions. [2024-11-13 15:55:08,723 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 400 transitions. Word has length 151 [2024-11-13 15:55:08,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:55:08,723 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 400 transitions. [2024-11-13 15:55:08,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 15:55:08,724 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 400 transitions. [2024-11-13 15:55:08,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 15:55:08,726 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:55:08,726 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:55:08,743 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-13 15:55:08,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 15:55:08,927 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:55:08,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:55:08,927 INFO L85 PathProgramCache]: Analyzing trace with hash 566297257, now seen corresponding path program 1 times [2024-11-13 15:55:08,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:55:08,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1206281523] [2024-11-13 15:55:08,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:55:08,928 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 15:55:08,928 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:55:08,929 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 15:55:08,931 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-13 15:55:09,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:55:10,022 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-13 15:55:10,028 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:55:10,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-13 15:55:11,790 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:55:11,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 127 treesize of output 69 [2024-11-13 15:55:12,737 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:55:12,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 142 treesize of output 72 [2024-11-13 15:55:13,668 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:55:13,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 241 treesize of output 113 [2024-11-13 15:55:19,625 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:55:19,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 219 treesize of output 104 [2024-11-13 15:55:26,085 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:55:26,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 256 treesize of output 88 [2024-11-13 15:55:49,679 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 296 proven. 0 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2024-11-13 15:55:49,679 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:55:49,679 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:55:49,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1206281523] [2024-11-13 15:55:49,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1206281523] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:55:49,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:55:49,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 15:55:49,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740946660] [2024-11-13 15:55:49,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:55:49,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 15:55:49,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:55:49,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 15:55:49,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-13 15:55:49,681 INFO L87 Difference]: Start difference. First operand 286 states and 400 transitions. Second operand has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 10 states have internal predecessors, (65), 3 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-13 15:56:08,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:56:09,820 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:56:12,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:56:14,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:56:23,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.99s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:56:25,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:56:29,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:56:33,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:56:36,377 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:56:38,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:56:41,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:56:43,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:56:47,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:56:51,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:56:53,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:56:56,347 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:56:58,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:57:02,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:57:05,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:57:07,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:57:09,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:57:10,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:57:12,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:57:15,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:57:18,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:57:20,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:57:24,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:57:28,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:57:30,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:57:32,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:57:35,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:57:39,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.84s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:57:41,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:57:45,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:57:47,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:57:50,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.73s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:57:51,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:58:09,825 WARN L286 SmtUtils]: Spent 13.64s on a formula simplification that was a NOOP. DAG size: 69 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 15:58:13,002 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:58:14,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:58:18,452 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:58:20,254 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:58:24,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:58:26,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:58:29,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:58:33,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:58:35,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:58:38,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:58:41,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:58:44,177 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:58:47,306 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:58:51,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:58:56,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:59:00,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:59:03,994 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:59:06,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:59:09,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:59:14,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:59:16,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:59:22,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:59:23,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:59:27,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:59:30,933 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:59:32,606 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:59:36,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:59:38,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:59:42,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:59:45,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:59:48,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:59:51,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:59:54,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:59:57,820 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:00:02,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:00:06,454 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:00:09,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:00:11,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:00:13,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:00:16,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:00:19,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:00:21,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:00:24,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:00:26,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:00:29,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:00:31,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:00:35,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:00:39,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:00:42,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:00:45,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:00:47,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:00:49,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:00:52,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:00:56,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:01:03,396 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:01:09,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:01:15,091 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:01:17,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:01:21,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:01:23,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:01:27,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:01:30,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:01:34,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:01:38,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:01:41,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:01:43,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:01:47,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:01:51,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:01:55,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:01:58,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:02:02,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:02:06,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:02:10,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:02:13,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:02:15,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:02:17,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:02:20,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:02:24,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:02:28,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:02:32,875 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:02:37,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:02:41,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:02:44,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:02:48,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:02:52,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:02:56,238 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:02:59,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:03:01,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:03:04,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:03:06,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:03:10,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:03:12,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:03:15,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:03:17,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:03:20,635 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:03:24,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:03:28,549 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 16:03:28,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:03:28,651 INFO L93 Difference]: Finished difference Result 799 states and 1103 transitions. [2024-11-13 16:03:28,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 16:03:28,656 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 10 states have internal predecessors, (65), 3 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 151 [2024-11-13 16:03:28,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:03:28,662 INFO L225 Difference]: With dead ends: 799 [2024-11-13 16:03:28,662 INFO L226 Difference]: Without dead ends: 598 [2024-11-13 16:03:28,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 48.9s TimeCoverageRelationStatistics Valid=46, Invalid=109, Unknown=1, NotChecked=0, Total=156 [2024-11-13 16:03:28,664 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 330 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 1111 mSolverCounterSat, 13 mSolverCounterUnsat, 23 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 432.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 1147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1111 IncrementalHoareTripleChecker+Invalid, 23 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 437.6s IncrementalHoareTripleChecker+Time [2024-11-13 16:03:28,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 634 Invalid, 1147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1111 Invalid, 23 Unknown, 0 Unchecked, 437.6s Time] [2024-11-13 16:03:28,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2024-11-13 16:03:28,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 591. [2024-11-13 16:03:28,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 489 states have (on average 1.296523517382413) internal successors, (634), 495 states have internal predecessors, (634), 90 states have call successors, (90), 11 states have call predecessors, (90), 11 states have return successors, (90), 84 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-13 16:03:28,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 814 transitions. [2024-11-13 16:03:28,747 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 814 transitions. Word has length 151 [2024-11-13 16:03:28,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:03:28,748 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 814 transitions. [2024-11-13 16:03:28,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 10 states have internal predecessors, (65), 3 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-13 16:03:28,748 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 814 transitions. [2024-11-13 16:03:28,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 16:03:28,751 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:03:28,751 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:03:28,777 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-13 16:03:28,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 16:03:28,952 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:03:28,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:03:28,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1234497387, now seen corresponding path program 1 times [2024-11-13 16:03:28,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:03:28,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [27794813] [2024-11-13 16:03:28,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:03:28,953 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 16:03:28,953 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 16:03:28,955 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 16:03:28,957 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a53d134-95ad-484c-87b0-f0a5fa2625a3/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-13 16:03:30,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:03:30,082 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-13 16:03:30,092 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:03:30,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 104 [2024-11-13 16:03:30,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 186 treesize of output 162 [2024-11-13 16:03:34,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 1 [2024-11-13 16:03:37,023 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:03:37,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 127 treesize of output 69 [2024-11-13 16:03:38,919 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:03:38,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 137 treesize of output 82 [2024-11-13 16:03:41,500 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:03:41,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 254 treesize of output 138