./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-17.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-17.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 a3b2b2359789daf7bb58416c09d5d24053c0bcce4099550d43f78ef9b7c15c79 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 09:44:15,283 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 09:44:15,365 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 09:44:15,379 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 09:44:15,380 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 09:44:15,407 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 09:44:15,408 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 09:44:15,408 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 09:44:15,409 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 09:44:15,410 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 09:44:15,410 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 09:44:15,411 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 09:44:15,411 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 09:44:15,413 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 09:44:15,414 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 09:44:15,414 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 09:44:15,414 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 09:44:15,415 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 09:44:15,415 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 09:44:15,415 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 09:44:15,419 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 09:44:15,419 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 09:44:15,420 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 09:44:15,420 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 09:44:15,420 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 09:44:15,420 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 09:44:15,421 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 09:44:15,421 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 09:44:15,421 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 09:44:15,421 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 09:44:15,421 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 09:44:15,422 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 09:44:15,422 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:44:15,422 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 09:44:15,422 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 09:44:15,422 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 09:44:15,423 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 09:44:15,423 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 09:44:15,423 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 09:44:15,424 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 09:44:15,424 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 09:44:15,425 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 09:44:15,425 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> a3b2b2359789daf7bb58416c09d5d24053c0bcce4099550d43f78ef9b7c15c79 [2024-11-10 09:44:15,684 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 09:44:15,706 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 09:44:15,710 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 09:44:15,711 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 09:44:15,712 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 09:44:15,713 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-17.i [2024-11-10 09:44:17,147 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 09:44:17,347 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 09:44:17,348 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-17.i [2024-11-10 09:44:17,356 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d043e433/18c9dd6a7c4b47faad5b16329b5f0ade/FLAG0c51f2cc4 [2024-11-10 09:44:17,728 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d043e433/18c9dd6a7c4b47faad5b16329b5f0ade [2024-11-10 09:44:17,730 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 09:44:17,731 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 09:44:17,733 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 09:44:17,733 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 09:44:17,738 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 09:44:17,738 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:44:17" (1/1) ... [2024-11-10 09:44:17,739 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e8a4257 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:44:17, skipping insertion in model container [2024-11-10 09:44:17,739 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:44:17" (1/1) ... [2024-11-10 09:44:17,772 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 09:44:17,956 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-17.i[916,929] [2024-11-10 09:44:18,044 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:44:18,058 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 09:44:18,072 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-17.i[916,929] [2024-11-10 09:44:18,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:44:18,155 INFO L204 MainTranslator]: Completed translation [2024-11-10 09:44:18,155 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:44:18 WrapperNode [2024-11-10 09:44:18,155 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 09:44:18,156 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 09:44:18,157 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 09:44:18,157 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 09:44:18,163 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:44:18" (1/1) ... [2024-11-10 09:44:18,182 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:44:18" (1/1) ... [2024-11-10 09:44:18,233 INFO L138 Inliner]: procedures = 30, calls = 184, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 617 [2024-11-10 09:44:18,233 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 09:44:18,234 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 09:44:18,234 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 09:44:18,234 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 09:44:18,244 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:44:18" (1/1) ... [2024-11-10 09:44:18,244 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:44:18" (1/1) ... [2024-11-10 09:44:18,250 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:44:18" (1/1) ... [2024-11-10 09:44:18,259 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-10 09:44:18,259 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:44:18" (1/1) ... [2024-11-10 09:44:18,259 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:44:18" (1/1) ... [2024-11-10 09:44:18,279 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:44:18" (1/1) ... [2024-11-10 09:44:18,281 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:44:18" (1/1) ... [2024-11-10 09:44:18,284 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:44:18" (1/1) ... [2024-11-10 09:44:18,286 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:44:18" (1/1) ... [2024-11-10 09:44:18,295 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 09:44:18,296 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 09:44:18,296 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 09:44:18,296 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 09:44:18,298 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:44:18" (1/1) ... [2024-11-10 09:44:18,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:44:18,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:44:18,349 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 09:44:18,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 09:44:18,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 09:44:18,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-10 09:44:18,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-10 09:44:18,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-10 09:44:18,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-10 09:44:18,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-10 09:44:18,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-10 09:44:18,404 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 09:44:18,404 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 09:44:18,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-10 09:44:18,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 09:44:18,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 09:44:18,571 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 09:44:18,575 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 09:44:19,347 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L124: havoc property_#t~mem114#1;havoc property_#t~ite122#1;havoc property_#t~mem121#1;havoc property_#t~mem120#1;havoc property_#t~mem116#1;havoc property_#t~mem115#1;havoc property_#t~ite119#1;havoc property_#t~mem117#1;havoc property_#t~mem118#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~mem125#1;havoc property_#t~ite137#1;havoc property_#t~mem128#1;havoc property_#t~mem126#1;havoc property_#t~mem127#1;havoc property_#t~mem129#1;havoc property_#t~ite136#1;havoc property_#t~mem130#1;havoc property_#t~ite133#1;havoc property_#t~mem132#1;havoc property_#t~mem131#1;havoc property_#t~mem135#1;havoc property_#t~mem134#1;havoc property_#t~short138#1;havoc property_#t~mem139#1;havoc property_#t~short140#1;havoc property_#t~mem143#1;havoc property_#t~mem141#1;havoc property_#t~mem142#1;havoc property_#t~ite166#1;havoc property_#t~mem165#1;havoc property_#t~mem153#1;havoc property_#t~mem144#1;havoc property_#t~ite146#1;havoc property_#t~mem145#1;havoc property_#t~mem147#1;havoc property_#t~ite152#1;havoc property_#t~mem148#1;havoc property_#t~ite150#1;havoc property_#t~mem149#1;havoc property_#t~mem151#1;havoc property_#t~ite164#1;havoc property_#t~mem154#1;havoc property_#t~mem155#1;havoc property_#t~ite157#1;havoc property_#t~mem156#1;havoc property_#t~mem158#1;havoc property_#t~ite163#1;havoc property_#t~mem159#1;havoc property_#t~ite161#1;havoc property_#t~mem160#1;havoc property_#t~mem162#1;havoc property_#t~short167#1;havoc property_#t~mem168#1;havoc property_#t~mem169#1;havoc property_#t~ite177#1;havoc property_#t~mem170#1;havoc property_#t~mem171#1;havoc property_#t~ite176#1;havoc property_#t~mem173#1;havoc property_#t~mem172#1;havoc property_#t~mem175#1;havoc property_#t~mem174#1;havoc property_#t~short178#1; [2024-11-10 09:44:19,421 INFO L? ?]: Removed 167 outVars from TransFormulas that were not future-live. [2024-11-10 09:44:19,422 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 09:44:19,441 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 09:44:19,441 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 09:44:19,442 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:44:19 BoogieIcfgContainer [2024-11-10 09:44:19,442 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 09:44:19,444 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 09:44:19,444 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 09:44:19,447 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 09:44:19,448 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:44:17" (1/3) ... [2024-11-10 09:44:19,449 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b86b30d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:44:19, skipping insertion in model container [2024-11-10 09:44:19,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:44:18" (2/3) ... [2024-11-10 09:44:19,450 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b86b30d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:44:19, skipping insertion in model container [2024-11-10 09:44:19,450 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:44:19" (3/3) ... [2024-11-10 09:44:19,451 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-17.i [2024-11-10 09:44:19,469 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 09:44:19,469 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 09:44:19,530 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 09:44:19,536 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;@24655bc6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 09:44:19,537 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 09:44:19,541 INFO L276 IsEmpty]: Start isEmpty. Operand has 147 states, 128 states have (on average 1.4453125) internal successors, (185), 129 states have internal predecessors, (185), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 09:44:19,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-10 09:44:19,557 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:44:19,559 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:44:19,559 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:44:19,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:44:19,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1787161692, now seen corresponding path program 1 times [2024-11-10 09:44:19,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:44:19,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603013335] [2024-11-10 09:44:19,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:44:19,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:44:19,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:19,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:44:19,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:19,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:44:19,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:19,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 09:44:19,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:19,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:44:19,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:19,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:44:20,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:20,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:44:20,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:20,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:44:20,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:20,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:44:20,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:20,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:44:20,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:20,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 09:44:20,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:20,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:44:20,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:20,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 09:44:20,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:20,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:44:20,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:20,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:44:20,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:20,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:44:20,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:20,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 09:44:20,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:20,068 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 09:44:20,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:44:20,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603013335] [2024-11-10 09:44:20,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603013335] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:44:20,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:44:20,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 09:44:20,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374163065] [2024-11-10 09:44:20,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:44:20,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 09:44:20,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:44:20,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 09:44:20,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:44:20,102 INFO L87 Difference]: Start difference. First operand has 147 states, 128 states have (on average 1.4453125) internal successors, (185), 129 states have internal predecessors, (185), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 09:44:20,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:44:20,144 INFO L93 Difference]: Finished difference Result 286 states and 443 transitions. [2024-11-10 09:44:20,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 09:44:20,147 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 143 [2024-11-10 09:44:20,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:44:20,156 INFO L225 Difference]: With dead ends: 286 [2024-11-10 09:44:20,156 INFO L226 Difference]: Without dead ends: 142 [2024-11-10 09:44:20,161 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 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-10 09:44:20,166 INFO L432 NwaCegarLoop]: 209 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, 209 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-10 09:44:20,167 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:44:20,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-10 09:44:20,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2024-11-10 09:44:20,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 124 states have (on average 1.4274193548387097) internal successors, (177), 124 states have internal predecessors, (177), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 09:44:20,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 209 transitions. [2024-11-10 09:44:20,236 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 209 transitions. Word has length 143 [2024-11-10 09:44:20,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:44:20,237 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 209 transitions. [2024-11-10 09:44:20,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 09:44:20,238 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 209 transitions. [2024-11-10 09:44:20,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-10 09:44:20,241 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:44:20,241 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:44:20,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 09:44:20,242 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:44:20,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:44:20,242 INFO L85 PathProgramCache]: Analyzing trace with hash -68837702, now seen corresponding path program 1 times [2024-11-10 09:44:20,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:44:20,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251290036] [2024-11-10 09:44:20,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:44:20,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:44:20,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:20,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:44:20,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:20,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:44:20,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:20,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 09:44:20,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:20,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:44:20,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:20,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:44:20,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:20,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:44:20,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:20,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:44:20,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:20,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:44:20,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:20,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:44:20,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:20,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 09:44:20,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:20,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:44:20,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:20,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 09:44:20,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:20,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:44:20,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:20,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:44:20,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:20,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:44:20,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:20,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 09:44:20,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:20,751 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 09:44:20,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:44:20,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251290036] [2024-11-10 09:44:20,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251290036] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:44:20,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:44:20,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:44:20,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958751911] [2024-11-10 09:44:20,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:44:20,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:44:20,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:44:20,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:44:20,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:44:20,757 INFO L87 Difference]: Start difference. First operand 142 states and 209 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:44:20,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:44:20,811 INFO L93 Difference]: Finished difference Result 283 states and 418 transitions. [2024-11-10 09:44:20,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:44:20,815 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 143 [2024-11-10 09:44:20,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:44:20,817 INFO L225 Difference]: With dead ends: 283 [2024-11-10 09:44:20,818 INFO L226 Difference]: Without dead ends: 144 [2024-11-10 09:44:20,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 35 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-10 09:44:20,820 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 0 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 610 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-10 09:44:20,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 610 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:44:20,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-10 09:44:20,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2024-11-10 09:44:20,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 126 states have (on average 1.4206349206349207) internal successors, (179), 126 states have internal predecessors, (179), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 09:44:20,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 211 transitions. [2024-11-10 09:44:20,843 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 211 transitions. Word has length 143 [2024-11-10 09:44:20,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:44:20,845 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 211 transitions. [2024-11-10 09:44:20,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:44:20,846 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 211 transitions. [2024-11-10 09:44:20,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-10 09:44:20,848 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:44:20,848 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:44:20,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 09:44:20,848 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:44:20,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:44:20,849 INFO L85 PathProgramCache]: Analyzing trace with hash -214227844, now seen corresponding path program 1 times [2024-11-10 09:44:20,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:44:20,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287953021] [2024-11-10 09:44:20,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:44:20,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:44:20,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:21,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:44:21,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:21,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:44:21,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:21,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 09:44:21,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:21,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:44:21,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:21,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:44:21,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:21,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:44:21,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:21,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:44:21,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:21,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:44:21,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:21,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:44:21,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:21,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 09:44:21,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:21,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:44:21,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:21,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 09:44:21,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:21,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:44:21,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:21,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:44:21,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:21,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:44:21,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:21,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 09:44:21,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:21,085 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 09:44:21,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:44:21,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287953021] [2024-11-10 09:44:21,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287953021] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:44:21,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:44:21,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:44:21,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292389371] [2024-11-10 09:44:21,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:44:21,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:44:21,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:44:21,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:44:21,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:44:21,093 INFO L87 Difference]: Start difference. First operand 144 states and 211 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:44:21,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:44:21,132 INFO L93 Difference]: Finished difference Result 288 states and 423 transitions. [2024-11-10 09:44:21,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:44:21,133 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 145 [2024-11-10 09:44:21,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:44:21,135 INFO L225 Difference]: With dead ends: 288 [2024-11-10 09:44:21,135 INFO L226 Difference]: Without dead ends: 147 [2024-11-10 09:44:21,135 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 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-10 09:44:21,136 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 1 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:44:21,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 607 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:44:21,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-10 09:44:21,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2024-11-10 09:44:21,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 128 states have (on average 1.4140625) internal successors, (181), 128 states have internal predecessors, (181), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 09:44:21,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 213 transitions. [2024-11-10 09:44:21,147 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 213 transitions. Word has length 145 [2024-11-10 09:44:21,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:44:21,147 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 213 transitions. [2024-11-10 09:44:21,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:44:21,147 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 213 transitions. [2024-11-10 09:44:21,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-10 09:44:21,150 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:44:21,150 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:44:21,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 09:44:21,150 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:44:21,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:44:21,154 INFO L85 PathProgramCache]: Analyzing trace with hash -410741349, now seen corresponding path program 1 times [2024-11-10 09:44:21,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:44:21,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920743082] [2024-11-10 09:44:21,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:44:21,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:44:21,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:23,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:44:23,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:23,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:44:23,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:23,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 09:44:23,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:23,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:44:23,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:23,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:44:23,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:23,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:44:23,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:23,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:44:23,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:23,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:44:23,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:23,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:44:23,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:23,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 09:44:23,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:23,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:44:23,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:23,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 09:44:23,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:23,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:44:23,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:23,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:44:23,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:23,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:44:23,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:23,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 09:44:23,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:23,244 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 09:44:23,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:44:23,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920743082] [2024-11-10 09:44:23,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920743082] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:44:23,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:44:23,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 09:44:23,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105571922] [2024-11-10 09:44:23,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:44:23,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:44:23,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:44:23,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:44:23,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:44:23,249 INFO L87 Difference]: Start difference. First operand 146 states and 213 transitions. Second operand has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 09:44:23,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:44:23,824 INFO L93 Difference]: Finished difference Result 353 states and 515 transitions. [2024-11-10 09:44:23,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 09:44:23,825 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 145 [2024-11-10 09:44:23,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:44:23,828 INFO L225 Difference]: With dead ends: 353 [2024-11-10 09:44:23,829 INFO L226 Difference]: Without dead ends: 210 [2024-11-10 09:44:23,829 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:44:23,833 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 85 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 09:44:23,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 637 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 09:44:23,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-11-10 09:44:23,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 167. [2024-11-10 09:44:23,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 149 states have (on average 1.429530201342282) internal successors, (213), 149 states have internal predecessors, (213), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 09:44:23,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 245 transitions. [2024-11-10 09:44:23,851 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 245 transitions. Word has length 145 [2024-11-10 09:44:23,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:44:23,854 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 245 transitions. [2024-11-10 09:44:23,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 09:44:23,854 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 245 transitions. [2024-11-10 09:44:23,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-10 09:44:23,860 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:44:23,861 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:44:23,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 09:44:23,861 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:44:23,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:44:23,861 INFO L85 PathProgramCache]: Analyzing trace with hash -579986884, now seen corresponding path program 1 times [2024-11-10 09:44:23,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:44:23,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643777760] [2024-11-10 09:44:23,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:44:23,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:44:23,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:24,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:44:24,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:24,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:44:24,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:24,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 09:44:24,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:24,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:44:24,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:24,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:44:24,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:24,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:44:24,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:24,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:44:24,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:24,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:44:24,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:24,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:44:24,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:24,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 09:44:24,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:24,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:44:24,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:24,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 09:44:24,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:24,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:44:24,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:24,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:44:24,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:24,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:44:24,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:24,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 09:44:24,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:24,441 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 09:44:24,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:44:24,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643777760] [2024-11-10 09:44:24,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643777760] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:44:24,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:44:24,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:44:24,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924150924] [2024-11-10 09:44:24,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:44:24,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:44:24,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:44:24,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:44:24,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:44:24,444 INFO L87 Difference]: Start difference. First operand 167 states and 245 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:44:24,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:44:24,802 INFO L93 Difference]: Finished difference Result 335 states and 492 transitions. [2024-11-10 09:44:24,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:44:24,803 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 145 [2024-11-10 09:44:24,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:44:24,806 INFO L225 Difference]: With dead ends: 335 [2024-11-10 09:44:24,806 INFO L226 Difference]: Without dead ends: 171 [2024-11-10 09:44:24,807 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:44:24,811 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 86 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 09:44:24,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 513 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 09:44:24,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-10 09:44:24,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2024-11-10 09:44:24,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 151 states have (on average 1.423841059602649) internal successors, (215), 151 states have internal predecessors, (215), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 09:44:24,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 247 transitions. [2024-11-10 09:44:24,827 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 247 transitions. Word has length 145 [2024-11-10 09:44:24,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:44:24,828 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 247 transitions. [2024-11-10 09:44:24,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:44:24,828 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 247 transitions. [2024-11-10 09:44:24,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-10 09:44:24,830 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:44:24,830 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:44:24,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 09:44:24,831 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:44:24,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:44:24,831 INFO L85 PathProgramCache]: Analyzing trace with hash -776500389, now seen corresponding path program 1 times [2024-11-10 09:44:24,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:44:24,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352999219] [2024-11-10 09:44:24,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:44:24,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:44:24,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:26,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:44:26,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:26,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:44:26,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:26,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 09:44:26,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:26,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:44:26,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:26,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:44:26,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:26,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:44:26,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:26,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:44:26,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:26,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:44:26,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:26,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:44:26,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:26,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 09:44:26,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:26,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:44:26,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:26,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 09:44:26,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:26,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:44:26,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:26,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:44:26,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:26,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:44:26,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:26,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 09:44:26,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:26,527 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 09:44:26,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:44:26,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352999219] [2024-11-10 09:44:26,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352999219] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:44:26,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:44:26,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 09:44:26,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009907562] [2024-11-10 09:44:26,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:44:26,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 09:44:26,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:44:26,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 09:44:26,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:44:26,530 INFO L87 Difference]: Start difference. First operand 169 states and 247 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:44:27,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:44:27,411 INFO L93 Difference]: Finished difference Result 670 states and 983 transitions. [2024-11-10 09:44:27,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 09:44:27,412 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 145 [2024-11-10 09:44:27,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:44:27,415 INFO L225 Difference]: With dead ends: 670 [2024-11-10 09:44:27,416 INFO L226 Difference]: Without dead ends: 504 [2024-11-10 09:44:27,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-10 09:44:27,417 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 386 mSDsluCounter, 814 mSDsCounter, 0 mSdLazyCounter, 852 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 1029 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 09:44:27,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 1029 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 852 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 09:44:27,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2024-11-10 09:44:27,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 496. [2024-11-10 09:44:27,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 444 states have (on average 1.427927927927928) internal successors, (634), 444 states have internal predecessors, (634), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-10 09:44:27,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 730 transitions. [2024-11-10 09:44:27,450 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 730 transitions. Word has length 145 [2024-11-10 09:44:27,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:44:27,450 INFO L471 AbstractCegarLoop]: Abstraction has 496 states and 730 transitions. [2024-11-10 09:44:27,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:44:27,451 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 730 transitions. [2024-11-10 09:44:27,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-10 09:44:27,453 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:44:27,453 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:44:27,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 09:44:27,453 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:44:27,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:44:27,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1743560211, now seen corresponding path program 1 times [2024-11-10 09:44:27,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:44:27,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931572218] [2024-11-10 09:44:27,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:44:27,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:44:27,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:28,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:44:28,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:28,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:44:28,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:28,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 09:44:28,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:28,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:44:28,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:28,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:44:28,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:28,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:44:28,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:28,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:44:28,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:28,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:44:28,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:28,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:44:28,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:28,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 09:44:28,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:28,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:44:28,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:28,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 09:44:28,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:28,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:44:28,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:28,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:44:28,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:28,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:44:28,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:28,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 09:44:28,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:28,528 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 09:44:28,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:44:28,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931572218] [2024-11-10 09:44:28,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931572218] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:44:28,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:44:28,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 09:44:28,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973487543] [2024-11-10 09:44:28,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:44:28,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 09:44:28,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:44:28,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 09:44:28,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-10 09:44:28,531 INFO L87 Difference]: Start difference. First operand 496 states and 730 transitions. Second operand has 8 states, 7 states have (on average 9.857142857142858) internal successors, (69), 8 states have internal predecessors, (69), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 09:44:29,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:44:29,451 INFO L93 Difference]: Finished difference Result 831 states and 1222 transitions. [2024-11-10 09:44:29,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 09:44:29,452 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.857142857142858) internal successors, (69), 8 states have internal predecessors, (69), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 146 [2024-11-10 09:44:29,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:44:29,456 INFO L225 Difference]: With dead ends: 831 [2024-11-10 09:44:29,456 INFO L226 Difference]: Without dead ends: 665 [2024-11-10 09:44:29,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-10 09:44:29,457 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 328 mSDsluCounter, 779 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 974 SdHoareTripleChecker+Invalid, 987 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 09:44:29,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 974 Invalid, 987 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 969 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 09:44:29,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2024-11-10 09:44:29,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 335. [2024-11-10 09:44:29,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 300 states have (on average 1.4266666666666667) internal successors, (428), 300 states have internal predecessors, (428), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-10 09:44:29,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 492 transitions. [2024-11-10 09:44:29,481 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 492 transitions. Word has length 146 [2024-11-10 09:44:29,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:44:29,481 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 492 transitions. [2024-11-10 09:44:29,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.857142857142858) internal successors, (69), 8 states have internal predecessors, (69), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 09:44:29,482 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 492 transitions. [2024-11-10 09:44:29,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-10 09:44:29,483 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:44:29,484 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:44:29,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 09:44:29,484 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:44:29,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:44:29,484 INFO L85 PathProgramCache]: Analyzing trace with hash -949860946, now seen corresponding path program 1 times [2024-11-10 09:44:29,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:44:29,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213270597] [2024-11-10 09:44:29,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:44:29,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:44:29,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 09:44:29,576 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 09:44:29,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 09:44:29,681 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 09:44:29,682 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 09:44:29,683 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 09:44:29,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 09:44:29,689 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:44:29,763 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 09:44:29,766 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 09:44:29 BoogieIcfgContainer [2024-11-10 09:44:29,767 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 09:44:29,767 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 09:44:29,767 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 09:44:29,768 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 09:44:29,768 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:44:19" (3/4) ... [2024-11-10 09:44:29,770 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 09:44:29,771 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 09:44:29,771 INFO L158 Benchmark]: Toolchain (without parser) took 12040.01ms. Allocated memory was 176.2MB in the beginning and 371.2MB in the end (delta: 195.0MB). Free memory was 106.1MB in the beginning and 191.8MB in the end (delta: -85.6MB). Peak memory consumption was 110.9MB. Max. memory is 16.1GB. [2024-11-10 09:44:29,771 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 130.0MB. Free memory was 94.4MB in the beginning and 94.2MB in the end (delta: 155.9kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 09:44:29,772 INFO L158 Benchmark]: CACSL2BoogieTranslator took 423.00ms. Allocated memory is still 176.2MB. Free memory was 105.9MB in the beginning and 86.3MB in the end (delta: 19.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-10 09:44:29,772 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.69ms. Allocated memory is still 176.2MB. Free memory was 86.3MB in the beginning and 81.6MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 09:44:29,772 INFO L158 Benchmark]: Boogie Preprocessor took 61.85ms. Allocated memory is still 176.2MB. Free memory was 81.6MB in the beginning and 77.7MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 09:44:29,772 INFO L158 Benchmark]: IcfgBuilder took 1146.06ms. Allocated memory is still 176.2MB. Free memory was 77.4MB in the beginning and 114.0MB in the end (delta: -36.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-10 09:44:29,773 INFO L158 Benchmark]: TraceAbstraction took 10322.97ms. Allocated memory was 176.2MB in the beginning and 371.2MB in the end (delta: 195.0MB). Free memory was 113.6MB in the beginning and 191.8MB in the end (delta: -78.2MB). Peak memory consumption was 118.9MB. Max. memory is 16.1GB. [2024-11-10 09:44:29,773 INFO L158 Benchmark]: Witness Printer took 3.46ms. Allocated memory is still 371.2MB. Free memory is still 191.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 09:44:29,774 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 130.0MB. Free memory was 94.4MB in the beginning and 94.2MB in the end (delta: 155.9kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 423.00ms. Allocated memory is still 176.2MB. Free memory was 105.9MB in the beginning and 86.3MB in the end (delta: 19.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.69ms. Allocated memory is still 176.2MB. Free memory was 86.3MB in the beginning and 81.6MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.85ms. Allocated memory is still 176.2MB. Free memory was 81.6MB in the beginning and 77.7MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 1146.06ms. Allocated memory is still 176.2MB. Free memory was 77.4MB in the beginning and 114.0MB in the end (delta: -36.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 10322.97ms. Allocated memory was 176.2MB in the beginning and 371.2MB in the end (delta: 195.0MB). Free memory was 113.6MB in the beginning and 191.8MB in the end (delta: -78.2MB). Peak memory consumption was 118.9MB. Max. memory is 16.1GB. * Witness Printer took 3.46ms. Allocated memory is still 371.2MB. Free memory is still 191.8MB. 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 someBinaryDOUBLEComparisonOperation at line 124. Possible FailurePath: [L40] unsigned char isInitial = 0; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 10000000.8, 0, 16.2, 7.5, 49.6, -10, 4.5, 9.4, 128, 128, 0, 100, 128.4, 3.5, 16, 2 }; [L59] unsigned char last_1_WrapperStruct00_var_1_15 = 16; VAL [WrapperStruct00={4:0}, isInitial=0, last_1_WrapperStruct00_var_1_15=16] [L128] isInitial = 1 [L129] FCALL initially() [L130] COND TRUE 1 [L131] CALL updateLastVariables() [L121] EXPR WrapperStruct00.var_1_15 [L121] last_1_WrapperStruct00_var_1_15 = WrapperStruct00.var_1_15 [L131] RET updateLastVariables() [L132] CALL updateVariables() [L92] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L93] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L94] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L95] WrapperStruct00.var_1_3 = __VERIFIER_nondet_double() [L96] EXPR WrapperStruct00.var_1_3 [L96] EXPR WrapperStruct00.var_1_3 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F [L96] EXPR WrapperStruct00.var_1_3 [L96] EXPR WrapperStruct00.var_1_3 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L96] EXPR (WrapperStruct00.var_1_3 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L96] CALL assume_abort_if_not((WrapperStruct00.var_1_3 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L96] RET assume_abort_if_not((WrapperStruct00.var_1_3 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L97] WrapperStruct00.var_1_4 = __VERIFIER_nondet_double() [L98] EXPR WrapperStruct00.var_1_4 [L98] EXPR WrapperStruct00.var_1_4 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F [L98] EXPR WrapperStruct00.var_1_4 [L98] EXPR WrapperStruct00.var_1_4 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L98] EXPR (WrapperStruct00.var_1_4 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L98] CALL assume_abort_if_not((WrapperStruct00.var_1_4 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L98] RET assume_abort_if_not((WrapperStruct00.var_1_4 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L99] WrapperStruct00.var_1_5 = __VERIFIER_nondet_double() [L100] EXPR WrapperStruct00.var_1_5 [L100] EXPR WrapperStruct00.var_1_5 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F [L100] EXPR WrapperStruct00.var_1_5 [L100] EXPR WrapperStruct00.var_1_5 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L100] EXPR (WrapperStruct00.var_1_5 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L100] CALL assume_abort_if_not((WrapperStruct00.var_1_5 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L100] RET assume_abort_if_not((WrapperStruct00.var_1_5 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L101] WrapperStruct00.var_1_7 = __VERIFIER_nondet_double() [L102] EXPR WrapperStruct00.var_1_7 [L102] EXPR WrapperStruct00.var_1_7 >= 0.0F && WrapperStruct00.var_1_7 <= -1.0e-20F [L102] EXPR WrapperStruct00.var_1_7 [L102] EXPR WrapperStruct00.var_1_7 >= 0.0F && WrapperStruct00.var_1_7 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L102] EXPR (WrapperStruct00.var_1_7 >= 0.0F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L102] CALL assume_abort_if_not((WrapperStruct00.var_1_7 >= 0.0F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L102] RET assume_abort_if_not((WrapperStruct00.var_1_7 >= 0.0F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L103] WrapperStruct00.var_1_8 = __VERIFIER_nondet_double() [L104] EXPR WrapperStruct00.var_1_8 [L104] EXPR WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F [L104] EXPR WrapperStruct00.var_1_8 [L104] EXPR WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L104] EXPR (WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L104] CALL assume_abort_if_not((WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L104] RET assume_abort_if_not((WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L105] WrapperStruct00.var_1_9 = __VERIFIER_nondet_short() [L106] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L107] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 16383) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L108] WrapperStruct00.var_1_10 = __VERIFIER_nondet_short() [L109] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L110] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 32766) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 32766) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L111] WrapperStruct00.var_1_11 = __VERIFIER_nondet_uchar() [L112] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L113] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L114] WrapperStruct00.var_1_14 = __VERIFIER_nondet_double() [L115] EXPR WrapperStruct00.var_1_14 [L115] EXPR WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F [L115] EXPR WrapperStruct00.var_1_14 [L115] EXPR WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L115] EXPR (WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L115] CALL assume_abort_if_not((WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L115] RET assume_abort_if_not((WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L116] WrapperStruct00.var_1_16 = __VERIFIER_nondet_uchar() [L117] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L117] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L117] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L118] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L118] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 254) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L118] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 254) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L132] RET updateVariables() [L133] CALL step() [L63] WrapperStruct00.var_1_12 = last_1_WrapperStruct00_var_1_15 [L64] EXPR WrapperStruct00.var_1_12 [L64] unsigned long int stepLocal_1 = WrapperStruct00.var_1_12; [L65] EXPR WrapperStruct00.var_1_9 [L65] signed short int stepLocal_0 = WrapperStruct00.var_1_9; [L66] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16, stepLocal_0=5, stepLocal_1=16] [L66] COND FALSE !(stepLocal_0 >= WrapperStruct00.var_1_10) [L73] WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16, stepLocal_1=16] [L73] COND FALSE !(WrapperStruct00.var_1_2) [L76] EXPR WrapperStruct00.var_1_7 [L76] EXPR WrapperStruct00.var_1_8 [L76] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16, stepLocal_1=16] [L76] COND FALSE !((- (WrapperStruct00.var_1_7 - WrapperStruct00.var_1_8)) <= WrapperStruct00.var_1_3) [L79] WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16, stepLocal_1=16] [L79] COND FALSE !(WrapperStruct00.var_1_2) [L84] EXPR WrapperStruct00.var_1_15 [L84] WrapperStruct00.var_1_6 = WrapperStruct00.var_1_15 [L87] EXPR WrapperStruct00.var_1_7 [L87] EXPR WrapperStruct00.var_1_8 [L87] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16, stepLocal_1=16] [L87] COND FALSE !(WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_14)) [L133] RET step() [L134] CALL, EXPR property() [L124] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L124] EXPR WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((double) (WrapperStruct00.var_1_3 + ((((WrapperStruct00.var_1_4) < ((49.5 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_4) : ((49.5 + WrapperStruct00.var_1_5))))))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L124] EXPR (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((double) (WrapperStruct00.var_1_3 + ((((WrapperStruct00.var_1_4) < ((49.5 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_4) : ((49.5 + WrapperStruct00.var_1_5))))))) : 1) && (((- (WrapperStruct00.var_1_7 - WrapperStruct00.var_1_8)) <= WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_6 == ((signed short int) ((8 + WrapperStruct00.var_1_15) - WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_11 ? (WrapperStruct00.var_1_6 == ((signed short int) WrapperStruct00.var_1_15)) : 1) : (WrapperStruct00.var_1_6 == ((signed short int) WrapperStruct00.var_1_15)))) [L124] EXPR WrapperStruct00.var_1_7 [L124] EXPR WrapperStruct00.var_1_8 [L124] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L124] EXPR ((- (WrapperStruct00.var_1_7 - WrapperStruct00.var_1_8)) <= WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_6 == ((signed short int) ((8 + WrapperStruct00.var_1_15) - WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_11 ? (WrapperStruct00.var_1_6 == ((signed short int) WrapperStruct00.var_1_15)) : 1) : (WrapperStruct00.var_1_6 == ((signed short int) WrapperStruct00.var_1_15))) [L124] EXPR WrapperStruct00.var_1_6 [L124] EXPR WrapperStruct00.var_1_15 [L124] EXPR WrapperStruct00.var_1_15 [L124] EXPR ((- (WrapperStruct00.var_1_7 - WrapperStruct00.var_1_8)) <= WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_6 == ((signed short int) ((8 + WrapperStruct00.var_1_15) - WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_11 ? (WrapperStruct00.var_1_6 == ((signed short int) WrapperStruct00.var_1_15)) : 1) : (WrapperStruct00.var_1_6 == ((signed short int) WrapperStruct00.var_1_15))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L124] EXPR (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((double) (WrapperStruct00.var_1_3 + ((((WrapperStruct00.var_1_4) < ((49.5 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_4) : ((49.5 + WrapperStruct00.var_1_5))))))) : 1) && (((- (WrapperStruct00.var_1_7 - WrapperStruct00.var_1_8)) <= WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_6 == ((signed short int) ((8 + WrapperStruct00.var_1_15) - WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_11 ? (WrapperStruct00.var_1_6 == ((signed short int) WrapperStruct00.var_1_15)) : 1) : (WrapperStruct00.var_1_6 == ((signed short int) WrapperStruct00.var_1_15)))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L124] EXPR ((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((double) (WrapperStruct00.var_1_3 + ((((WrapperStruct00.var_1_4) < ((49.5 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_4) : ((49.5 + WrapperStruct00.var_1_5))))))) : 1) && (((- (WrapperStruct00.var_1_7 - WrapperStruct00.var_1_8)) <= WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_6 == ((signed short int) ((8 + WrapperStruct00.var_1_15) - WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_11 ? (WrapperStruct00.var_1_6 == ((signed short int) WrapperStruct00.var_1_15)) : 1) : (WrapperStruct00.var_1_6 == ((signed short int) WrapperStruct00.var_1_15))))) && (WrapperStruct00.var_1_12 == ((unsigned long int) last_1_WrapperStruct00_var_1_15)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L124] EXPR (((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((double) (WrapperStruct00.var_1_3 + ((((WrapperStruct00.var_1_4) < ((49.5 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_4) : ((49.5 + WrapperStruct00.var_1_5))))))) : 1) && (((- (WrapperStruct00.var_1_7 - WrapperStruct00.var_1_8)) <= WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_6 == ((signed short int) ((8 + WrapperStruct00.var_1_15) - WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_11 ? (WrapperStruct00.var_1_6 == ((signed short int) WrapperStruct00.var_1_15)) : 1) : (WrapperStruct00.var_1_6 == ((signed short int) WrapperStruct00.var_1_15))))) && (WrapperStruct00.var_1_12 == ((unsigned long int) last_1_WrapperStruct00_var_1_15))) && ((WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13 == ((float) ((((WrapperStruct00.var_1_4) > (((((((((127.4f) > (WrapperStruct00.var_1_5)) ? (127.4f) : (WrapperStruct00.var_1_5)))) > (WrapperStruct00.var_1_3)) ? (((((127.4f) > (WrapperStruct00.var_1_5)) ? (127.4f) : (WrapperStruct00.var_1_5)))) : (WrapperStruct00.var_1_3))))) ? (WrapperStruct00.var_1_4) : (((((((((127.4f) > (WrapperStruct00.var_1_5)) ? (127.4f) : (WrapperStruct00.var_1_5)))) > (WrapperStruct00.var_1_3)) ? (((((127.4f) > (WrapperStruct00.var_1_5)) ? (127.4f) : (WrapperStruct00.var_1_5)))) : (WrapperStruct00.var_1_3)))))))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L124] EXPR ((((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((double) (WrapperStruct00.var_1_3 + ((((WrapperStruct00.var_1_4) < ((49.5 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_4) : ((49.5 + WrapperStruct00.var_1_5))))))) : 1) && (((- (WrapperStruct00.var_1_7 - WrapperStruct00.var_1_8)) <= WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_6 == ((signed short int) ((8 + WrapperStruct00.var_1_15) - WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_11 ? (WrapperStruct00.var_1_6 == ((signed short int) WrapperStruct00.var_1_15)) : 1) : (WrapperStruct00.var_1_6 == ((signed short int) WrapperStruct00.var_1_15))))) && (WrapperStruct00.var_1_12 == ((unsigned long int) last_1_WrapperStruct00_var_1_15))) && ((WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13 == ((float) ((((WrapperStruct00.var_1_4) > (((((((((127.4f) > (WrapperStruct00.var_1_5)) ? (127.4f) : (WrapperStruct00.var_1_5)))) > (WrapperStruct00.var_1_3)) ? (((((127.4f) > (WrapperStruct00.var_1_5)) ? (127.4f) : (WrapperStruct00.var_1_5)))) : (WrapperStruct00.var_1_3))))) ? (WrapperStruct00.var_1_4) : (((((((((127.4f) > (WrapperStruct00.var_1_5)) ? (127.4f) : (WrapperStruct00.var_1_5)))) > (WrapperStruct00.var_1_3)) ? (((((127.4f) > (WrapperStruct00.var_1_5)) ? (127.4f) : (WrapperStruct00.var_1_5)))) : (WrapperStruct00.var_1_3)))))))) : 1)) && ((WrapperStruct00.var_1_9 >= WrapperStruct00.var_1_10) ? (((WrapperStruct00.var_1_9 + last_1_WrapperStruct00_var_1_15) >= WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_15 == ((unsigned char) WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_15 == ((unsigned char) WrapperStruct00.var_1_16))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L124-L125] return ((((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((double) (WrapperStruct00.var_1_3 + ((((WrapperStruct00.var_1_4) < ((49.5 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_4) : ((49.5 + WrapperStruct00.var_1_5))))))) : 1) && (((- (WrapperStruct00.var_1_7 - WrapperStruct00.var_1_8)) <= WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_6 == ((signed short int) ((8 + WrapperStruct00.var_1_15) - WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_11 ? (WrapperStruct00.var_1_6 == ((signed short int) WrapperStruct00.var_1_15)) : 1) : (WrapperStruct00.var_1_6 == ((signed short int) WrapperStruct00.var_1_15))))) && (WrapperStruct00.var_1_12 == ((unsigned long int) last_1_WrapperStruct00_var_1_15))) && ((WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13 == ((float) ((((WrapperStruct00.var_1_4) > (((((((((127.4f) > (WrapperStruct00.var_1_5)) ? (127.4f) : (WrapperStruct00.var_1_5)))) > (WrapperStruct00.var_1_3)) ? (((((127.4f) > (WrapperStruct00.var_1_5)) ? (127.4f) : (WrapperStruct00.var_1_5)))) : (WrapperStruct00.var_1_3))))) ? (WrapperStruct00.var_1_4) : (((((((((127.4f) > (WrapperStruct00.var_1_5)) ? (127.4f) : (WrapperStruct00.var_1_5)))) > (WrapperStruct00.var_1_3)) ? (((((127.4f) > (WrapperStruct00.var_1_5)) ? (127.4f) : (WrapperStruct00.var_1_5)))) : (WrapperStruct00.var_1_3)))))))) : 1)) && ((WrapperStruct00.var_1_9 >= WrapperStruct00.var_1_10) ? (((WrapperStruct00.var_1_9 + last_1_WrapperStruct00_var_1_15) >= WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_15 == ((unsigned char) WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_15 == ((unsigned char) WrapperStruct00.var_1_16))) : 1) ; [L134] RET, EXPR property() [L134] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 147 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.2s, OverallIterations: 8, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 888 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 886 mSDsluCounter, 4579 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3240 mSDsCounter, 48 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2477 IncrementalHoareTripleChecker+Invalid, 2525 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 48 mSolverCounterUnsat, 1339 mSDtfsCounter, 2477 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 316 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=496occurred in iteration=6, InterpolantAutomatonStates: 37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 384 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 1158 NumberOfCodeBlocks, 1158 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1005 ConstructedInterpolants, 0 QuantifiedInterpolants, 2171 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 3360/3360 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-10 09:44:29,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-17.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 a3b2b2359789daf7bb58416c09d5d24053c0bcce4099550d43f78ef9b7c15c79 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 09:44:32,032 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 09:44:32,117 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 09:44:32,124 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 09:44:32,125 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 09:44:32,157 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 09:44:32,158 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 09:44:32,158 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 09:44:32,159 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 09:44:32,159 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 09:44:32,160 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 09:44:32,160 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 09:44:32,161 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 09:44:32,162 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 09:44:32,162 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 09:44:32,163 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 09:44:32,163 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 09:44:32,164 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 09:44:32,164 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 09:44:32,164 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 09:44:32,165 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 09:44:32,165 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 09:44:32,165 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 09:44:32,166 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 09:44:32,166 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 09:44:32,166 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 09:44:32,167 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 09:44:32,167 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 09:44:32,167 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 09:44:32,168 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 09:44:32,168 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 09:44:32,168 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 09:44:32,169 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 09:44:32,169 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 09:44:32,169 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:44:32,170 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 09:44:32,170 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 09:44:32,170 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 09:44:32,170 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 09:44:32,171 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 09:44:32,171 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 09:44:32,172 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 09:44:32,172 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 09:44:32,172 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 09:44:32,173 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> a3b2b2359789daf7bb58416c09d5d24053c0bcce4099550d43f78ef9b7c15c79 [2024-11-10 09:44:32,511 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 09:44:32,530 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 09:44:32,533 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 09:44:32,535 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 09:44:32,535 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 09:44:32,536 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-17.i [2024-11-10 09:44:34,019 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 09:44:34,264 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 09:44:34,265 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-17.i [2024-11-10 09:44:34,275 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6804fc91b/ba3790bffad040e1beaccb9f5443a72a/FLAGf9029789a [2024-11-10 09:44:34,289 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6804fc91b/ba3790bffad040e1beaccb9f5443a72a [2024-11-10 09:44:34,291 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 09:44:34,295 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 09:44:34,297 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 09:44:34,298 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 09:44:34,303 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 09:44:34,304 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:44:34" (1/1) ... [2024-11-10 09:44:34,305 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ddd18b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:44:34, skipping insertion in model container [2024-11-10 09:44:34,305 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:44:34" (1/1) ... [2024-11-10 09:44:34,341 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 09:44:34,548 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-17.i[916,929] [2024-11-10 09:44:34,638 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:44:34,660 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 09:44:34,672 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-17.i[916,929] [2024-11-10 09:44:34,732 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:44:34,767 INFO L204 MainTranslator]: Completed translation [2024-11-10 09:44:34,768 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:44:34 WrapperNode [2024-11-10 09:44:34,768 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 09:44:34,769 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 09:44:34,769 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 09:44:34,769 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 09:44:34,776 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:44:34" (1/1) ... [2024-11-10 09:44:34,802 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:44:34" (1/1) ... [2024-11-10 09:44:34,850 INFO L138 Inliner]: procedures = 40, calls = 184, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 614 [2024-11-10 09:44:34,850 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 09:44:34,852 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 09:44:34,852 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 09:44:34,852 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 09:44:34,864 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:44:34" (1/1) ... [2024-11-10 09:44:34,864 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:44:34" (1/1) ... [2024-11-10 09:44:34,873 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:44:34" (1/1) ... [2024-11-10 09:44:34,894 INFO L175 MemorySlicer]: Split 157 memory accesses to 2 slices as follows [2, 155]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 36 writes are split as follows [0, 36]. [2024-11-10 09:44:34,894 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:44:34" (1/1) ... [2024-11-10 09:44:34,895 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:44:34" (1/1) ... [2024-11-10 09:44:34,935 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:44:34" (1/1) ... [2024-11-10 09:44:34,936 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:44:34" (1/1) ... [2024-11-10 09:44:34,939 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:44:34" (1/1) ... [2024-11-10 09:44:34,947 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:44:34" (1/1) ... [2024-11-10 09:44:34,958 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 09:44:34,959 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 09:44:34,959 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 09:44:34,959 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 09:44:34,960 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:44:34" (1/1) ... [2024-11-10 09:44:34,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:44:34,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:44:35,000 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 09:44:35,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 09:44:35,050 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 09:44:35,051 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-10 09:44:35,051 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-10 09:44:35,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2024-11-10 09:44:35,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2024-11-10 09:44:35,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-10 09:44:35,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-10 09:44:35,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-10 09:44:35,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-10 09:44:35,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 09:44:35,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-10 09:44:35,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-10 09:44:35,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-10 09:44:35,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-10 09:44:35,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-10 09:44:35,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-10 09:44:35,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-10 09:44:35,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-10 09:44:35,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-10 09:44:35,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-10 09:44:35,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-10 09:44:35,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2024-11-10 09:44:35,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2024-11-10 09:44:35,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-10 09:44:35,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-10 09:44:35,057 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 09:44:35,057 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 09:44:35,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-10 09:44:35,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-10 09:44:35,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 09:44:35,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 09:44:35,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-10 09:44:35,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-10 09:44:35,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-10 09:44:35,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-10 09:44:35,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-10 09:44:35,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-10 09:44:35,259 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 09:44:35,262 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 09:44:39,992 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L124: havoc property_#t~mem114#1;havoc property_#t~ite122#1;havoc property_#t~mem121#1;havoc property_#t~mem120#1;havoc property_#t~mem116#1;havoc property_#t~mem115#1;havoc property_#t~ite119#1;havoc property_#t~mem117#1;havoc property_#t~mem118#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~mem125#1;havoc property_#t~ite137#1;havoc property_#t~mem128#1;havoc property_#t~mem126#1;havoc property_#t~mem127#1;havoc property_#t~mem129#1;havoc property_#t~ite136#1;havoc property_#t~mem130#1;havoc property_#t~ite133#1;havoc property_#t~mem132#1;havoc property_#t~mem131#1;havoc property_#t~mem135#1;havoc property_#t~mem134#1;havoc property_#t~short138#1;havoc property_#t~mem139#1;havoc property_#t~short140#1;havoc property_#t~mem143#1;havoc property_#t~mem141#1;havoc property_#t~mem142#1;havoc property_#t~ite166#1;havoc property_#t~mem165#1;havoc property_#t~mem153#1;havoc property_#t~mem144#1;havoc property_#t~ite146#1;havoc property_#t~mem145#1;havoc property_#t~mem147#1;havoc property_#t~ite152#1;havoc property_#t~mem148#1;havoc property_#t~ite150#1;havoc property_#t~mem149#1;havoc property_#t~mem151#1;havoc property_#t~ite164#1;havoc property_#t~mem154#1;havoc property_#t~mem155#1;havoc property_#t~ite157#1;havoc property_#t~mem156#1;havoc property_#t~mem158#1;havoc property_#t~ite163#1;havoc property_#t~mem159#1;havoc property_#t~ite161#1;havoc property_#t~mem160#1;havoc property_#t~mem162#1;havoc property_#t~short167#1;havoc property_#t~mem168#1;havoc property_#t~mem169#1;havoc property_#t~ite177#1;havoc property_#t~mem170#1;havoc property_#t~mem171#1;havoc property_#t~ite176#1;havoc property_#t~mem173#1;havoc property_#t~mem172#1;havoc property_#t~mem175#1;havoc property_#t~mem174#1;havoc property_#t~short178#1; [2024-11-10 09:44:40,046 INFO L? ?]: Removed 182 outVars from TransFormulas that were not future-live. [2024-11-10 09:44:40,046 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 09:44:40,059 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 09:44:40,060 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 09:44:40,060 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:44:40 BoogieIcfgContainer [2024-11-10 09:44:40,060 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 09:44:40,062 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 09:44:40,062 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 09:44:40,065 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 09:44:40,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:44:34" (1/3) ... [2024-11-10 09:44:40,066 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21b2f741 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:44:40, skipping insertion in model container [2024-11-10 09:44:40,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:44:34" (2/3) ... [2024-11-10 09:44:40,066 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21b2f741 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:44:40, skipping insertion in model container [2024-11-10 09:44:40,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:44:40" (3/3) ... [2024-11-10 09:44:40,067 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-17.i [2024-11-10 09:44:40,082 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 09:44:40,082 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 09:44:40,131 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 09:44:40,136 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;@5dab8be3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 09:44:40,136 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 09:44:40,140 INFO L276 IsEmpty]: Start isEmpty. Operand has 147 states, 128 states have (on average 1.4453125) internal successors, (185), 129 states have internal predecessors, (185), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 09:44:40,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-10 09:44:40,152 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:44:40,153 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:44:40,154 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:44:40,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:44:40,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1796212722, now seen corresponding path program 1 times [2024-11-10 09:44:40,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:44:40,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [740889200] [2024-11-10 09:44:40,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:44:40,177 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-10 09:44:40,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:44:40,182 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10 09:44:40,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10 09:44:40,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:40,767 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 09:44:40,784 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:44:40,827 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2024-11-10 09:44:40,828 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:44:40,829 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:44:40,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [740889200] [2024-11-10 09:44:40,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [740889200] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:44:40,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:44:40,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 09:44:40,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139875833] [2024-11-10 09:44:40,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:44:40,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 09:44:40,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:44:40,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 09:44:40,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:44:40,865 INFO L87 Difference]: Start difference. First operand has 147 states, 128 states have (on average 1.4453125) internal successors, (185), 129 states have internal predecessors, (185), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 09:44:40,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:44:40,913 INFO L93 Difference]: Finished difference Result 286 states and 443 transitions. [2024-11-10 09:44:40,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 09:44:40,915 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 143 [2024-11-10 09:44:40,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:44:40,925 INFO L225 Difference]: With dead ends: 286 [2024-11-10 09:44:40,925 INFO L226 Difference]: Without dead ends: 142 [2024-11-10 09:44:40,929 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 142 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-10 09:44:40,935 INFO L432 NwaCegarLoop]: 209 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, 209 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-10 09:44:40,936 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:44:40,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-10 09:44:40,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2024-11-10 09:44:40,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 124 states have (on average 1.4274193548387097) internal successors, (177), 124 states have internal predecessors, (177), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 09:44:40,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 209 transitions. [2024-11-10 09:44:40,993 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 209 transitions. Word has length 143 [2024-11-10 09:44:40,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:44:40,994 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 209 transitions. [2024-11-10 09:44:40,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 09:44:40,995 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 209 transitions. [2024-11-10 09:44:41,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-10 09:44:41,001 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:44:41,001 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:44:41,020 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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)] Ended with exit code 0 [2024-11-10 09:44:41,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10 09:44:41,203 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:44:41,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:44:41,205 INFO L85 PathProgramCache]: Analyzing trace with hash -59786672, now seen corresponding path program 1 times [2024-11-10 09:44:41,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:44:41,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1118710955] [2024-11-10 09:44:41,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:44:41,208 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-10 09:44:41,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:44:41,211 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10 09:44:41,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10 09:44:41,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:41,753 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 09:44:41,768 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:44:41,839 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 09:44:41,842 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:44:41,843 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:44:41,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1118710955] [2024-11-10 09:44:41,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1118710955] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:44:41,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:44:41,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:44:41,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673551862] [2024-11-10 09:44:41,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:44:41,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:44:41,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:44:41,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:44:41,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:44:41,848 INFO L87 Difference]: Start difference. First operand 142 states and 209 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:44:42,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:44:42,004 INFO L93 Difference]: Finished difference Result 283 states and 418 transitions. [2024-11-10 09:44:42,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:44:42,005 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 143 [2024-11-10 09:44:42,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:44:42,008 INFO L225 Difference]: With dead ends: 283 [2024-11-10 09:44:42,008 INFO L226 Difference]: Without dead ends: 144 [2024-11-10 09:44:42,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 140 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-10 09:44:42,010 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 0 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 610 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-10 09:44:42,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 610 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:44:42,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-10 09:44:42,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2024-11-10 09:44:42,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 126 states have (on average 1.4206349206349207) internal successors, (179), 126 states have internal predecessors, (179), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 09:44:42,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 211 transitions. [2024-11-10 09:44:42,029 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 211 transitions. Word has length 143 [2024-11-10 09:44:42,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:44:42,031 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 211 transitions. [2024-11-10 09:44:42,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:44:42,032 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 211 transitions. [2024-11-10 09:44:42,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-10 09:44:42,034 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:44:42,034 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:44:42,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10 09:44:42,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10 09:44:42,236 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:44:42,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:44:42,237 INFO L85 PathProgramCache]: Analyzing trace with hash -106122478, now seen corresponding path program 1 times [2024-11-10 09:44:42,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:44:42,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1084876319] [2024-11-10 09:44:42,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:44:42,238 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-10 09:44:42,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:44:42,242 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10 09:44:42,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10 09:44:42,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:42,846 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 09:44:42,850 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:44:42,892 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 09:44:42,894 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:44:42,894 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:44:42,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1084876319] [2024-11-10 09:44:42,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1084876319] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:44:42,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:44:42,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:44:42,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289132064] [2024-11-10 09:44:42,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:44:42,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:44:42,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:44:42,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:44:42,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:44:42,898 INFO L87 Difference]: Start difference. First operand 144 states and 211 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:44:42,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:44:42,955 INFO L93 Difference]: Finished difference Result 288 states and 423 transitions. [2024-11-10 09:44:42,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:44:42,957 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 145 [2024-11-10 09:44:42,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:44:42,960 INFO L225 Difference]: With dead ends: 288 [2024-11-10 09:44:42,960 INFO L226 Difference]: Without dead ends: 147 [2024-11-10 09:44:42,962 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 142 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-10 09:44:42,963 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 1 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:44:42,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 607 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:44:42,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-10 09:44:42,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2024-11-10 09:44:42,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 128 states have (on average 1.4140625) internal successors, (181), 128 states have internal predecessors, (181), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 09:44:42,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 213 transitions. [2024-11-10 09:44:42,977 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 213 transitions. Word has length 145 [2024-11-10 09:44:42,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:44:42,978 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 213 transitions. [2024-11-10 09:44:42,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:44:42,979 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 213 transitions. [2024-11-10 09:44:42,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-10 09:44:42,981 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:44:42,981 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:44:43,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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)] Forceful destruction successful, exit code 0 [2024-11-10 09:44:43,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10 09:44:43,182 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:44:43,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:44:43,183 INFO L85 PathProgramCache]: Analyzing trace with hash -302635983, now seen corresponding path program 1 times [2024-11-10 09:44:43,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:44:43,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [203247732] [2024-11-10 09:44:43,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:44:43,184 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-10 09:44:43,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:44:43,187 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10 09:44:43,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10 09:44:43,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:43,816 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 09:44:43,821 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:44:44,069 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:44:44,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2024-11-10 09:44:44,118 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-11-10 09:44:44,119 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:44:44,119 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:44:44,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [203247732] [2024-11-10 09:44:44,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [203247732] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:44:44,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:44:44,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:44:44,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145927419] [2024-11-10 09:44:44,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:44:44,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:44:44,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:44:44,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:44:44,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:44:44,123 INFO L87 Difference]: Start difference. First operand 146 states and 213 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 09:44:47,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-10 09:44:51,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:44:51,435 INFO L93 Difference]: Finished difference Result 290 states and 424 transitions. [2024-11-10 09:44:51,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 09:44:51,436 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 145 [2024-11-10 09:44:51,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:44:51,437 INFO L225 Difference]: With dead ends: 290 [2024-11-10 09:44:51,437 INFO L226 Difference]: Without dead ends: 147 [2024-11-10 09:44:51,438 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-10 09:44:51,439 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 175 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:44:51,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 512 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2024-11-10 09:44:51,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-10 09:44:51,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2024-11-10 09:44:51,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 128 states have (on average 1.40625) internal successors, (180), 128 states have internal predecessors, (180), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 09:44:51,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 212 transitions. [2024-11-10 09:44:51,456 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 212 transitions. Word has length 145 [2024-11-10 09:44:51,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:44:51,456 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 212 transitions. [2024-11-10 09:44:51,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 09:44:51,457 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 212 transitions. [2024-11-10 09:44:51,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-10 09:44:51,458 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:44:51,459 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:44:51,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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)] Forceful destruction successful, exit code 0 [2024-11-10 09:44:51,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10 09:44:51,660 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:44:51,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:44:51,660 INFO L85 PathProgramCache]: Analyzing trace with hash 257670035, now seen corresponding path program 1 times [2024-11-10 09:44:51,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:44:51,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2042773969] [2024-11-10 09:44:51,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:44:51,661 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-10 09:44:51,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:44:51,663 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10 09:44:51,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10 09:44:52,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:52,243 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 09:44:52,247 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:44:52,468 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:44:52,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2024-11-10 09:44:52,505 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2024-11-10 09:44:52,505 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:44:52,506 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:44:52,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2042773969] [2024-11-10 09:44:52,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2042773969] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:44:52,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:44:52,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:44:52,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5822971] [2024-11-10 09:44:52,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:44:52,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:44:52,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:44:52,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:44:52,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:44:52,508 INFO L87 Difference]: Start difference. First operand 146 states and 212 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 09:44:54,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-10 09:44:57,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:44:57,899 INFO L93 Difference]: Finished difference Result 290 states and 422 transitions. [2024-11-10 09:44:57,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 09:44:57,901 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 147 [2024-11-10 09:44:57,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:44:57,902 INFO L225 Difference]: With dead ends: 290 [2024-11-10 09:44:57,902 INFO L226 Difference]: Without dead ends: 147 [2024-11-10 09:44:57,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-10 09:44:57,904 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 166 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2024-11-10 09:44:57,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 506 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2024-11-10 09:44:57,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-10 09:44:57,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2024-11-10 09:44:57,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 128 states have (on average 1.3984375) internal successors, (179), 128 states have internal predecessors, (179), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 09:44:57,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 211 transitions. [2024-11-10 09:44:57,913 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 211 transitions. Word has length 147 [2024-11-10 09:44:57,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:44:57,913 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 211 transitions. [2024-11-10 09:44:57,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 09:44:57,914 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 211 transitions. [2024-11-10 09:44:57,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-10 09:44:57,915 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:44:57,915 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:44:57,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10 09:44:58,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10 09:44:58,120 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:44:58,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:44:58,120 INFO L85 PathProgramCache]: Analyzing trace with hash 443755185, now seen corresponding path program 1 times [2024-11-10 09:44:58,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:44:58,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [212598830] [2024-11-10 09:44:58,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:44:58,121 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-10 09:44:58,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:44:58,123 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10 09:44:58,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10 09:44:58,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:44:58,703 INFO L255 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 09:44:58,707 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:44:59,041 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:44:59,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2024-11-10 09:44:59,074 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2024-11-10 09:44:59,074 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:44:59,074 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:44:59,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [212598830] [2024-11-10 09:44:59,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [212598830] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:44:59,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:44:59,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:44:59,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938277537] [2024-11-10 09:44:59,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:44:59,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:44:59,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:44:59,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:44:59,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:44:59,077 INFO L87 Difference]: Start difference. First operand 146 states and 211 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 5 states have internal predecessors, (75), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 09:45:01,471 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 [] [2024-11-10 09:45:05,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:45:05,113 INFO L93 Difference]: Finished difference Result 290 states and 420 transitions. [2024-11-10 09:45:05,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 09:45:05,114 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 5 states have internal predecessors, (75), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 149 [2024-11-10 09:45:05,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:45:05,116 INFO L225 Difference]: With dead ends: 290 [2024-11-10 09:45:05,116 INFO L226 Difference]: Without dead ends: 147 [2024-11-10 09:45:05,116 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-10 09:45:05,117 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 140 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:45:05,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 502 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2024-11-10 09:45:05,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-10 09:45:05,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2024-11-10 09:45:05,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 128 states have (on average 1.390625) internal successors, (178), 128 states have internal predecessors, (178), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 09:45:05,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 210 transitions. [2024-11-10 09:45:05,131 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 210 transitions. Word has length 149 [2024-11-10 09:45:05,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:45:05,131 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 210 transitions. [2024-11-10 09:45:05,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 5 states have internal predecessors, (75), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 09:45:05,131 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 210 transitions. [2024-11-10 09:45:05,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-10 09:45:05,133 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:45:05,133 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:45:05,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10 09:45:05,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10 09:45:05,334 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:45:05,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:45:05,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1335685485, now seen corresponding path program 1 times [2024-11-10 09:45:05,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:45:05,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [510700851] [2024-11-10 09:45:05,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:45:05,336 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-10 09:45:05,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:45:05,337 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10 09:45:05,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10 09:45:06,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:45:06,145 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-10 09:45:06,152 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:45:06,160 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-10 09:45:06,217 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 37 treesize of output 25 [2024-11-10 09:45:08,536 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:45:08,536 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 52 treesize of output 28 [2024-11-10 09:45:08,651 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:45:08,651 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 42 treesize of output 48 [2024-11-10 09:45:14,484 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:45:14,485 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 67 treesize of output 64 [2024-11-10 09:45:26,121 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:45:26,121 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 72 treesize of output 87 [2024-11-10 09:45:41,298 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:45:41,299 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 86 treesize of output 103 [2024-11-10 09:45:42,059 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:45:42,060 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 96 treesize of output 116 [2024-11-10 09:45:42,940 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:45:42,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 106 treesize of output 129 [2024-11-10 09:45:43,740 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:45:43,740 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 122 treesize of output 152