./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-49.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d 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-49.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 06bb6f3bbb0c6ee3bc73b3f1732ad2bc217c179634d5fa3dbf744e010ef897a1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 18:44:59,215 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 18:44:59,270 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 18:44:59,275 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 18:44:59,275 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 18:44:59,294 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 18:44:59,295 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 18:44:59,296 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 18:44:59,296 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 18:44:59,299 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 18:44:59,299 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 18:44:59,299 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 18:44:59,300 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 18:44:59,301 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 18:44:59,301 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 18:44:59,302 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 18:44:59,302 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 18:44:59,302 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 18:44:59,302 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 18:44:59,302 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 18:44:59,303 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 18:44:59,304 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 18:44:59,304 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 18:44:59,304 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 18:44:59,304 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 18:44:59,304 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 18:44:59,305 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 18:44:59,305 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 18:44:59,305 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 18:44:59,305 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 18:44:59,305 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 18:44:59,306 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 18:44:59,306 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:44:59,314 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 18:44:59,315 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 18:44:59,315 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 18:44:59,315 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 18:44:59,315 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 18:44:59,316 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 18:44:59,316 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 18:44:59,316 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 18:44:59,316 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 18:44:59,316 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 -> 06bb6f3bbb0c6ee3bc73b3f1732ad2bc217c179634d5fa3dbf744e010ef897a1 [2024-11-16 18:44:59,509 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 18:44:59,527 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 18:44:59,530 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 18:44:59,531 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 18:44:59,531 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 18:44:59,532 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-49.i [2024-11-16 18:45:00,750 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 18:45:00,897 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 18:45:00,898 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-49.i [2024-11-16 18:45:00,904 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9b6367ef/d79306c05ec948d3b5d54612dc89172f/FLAG044c60e8f [2024-11-16 18:45:00,914 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9b6367ef/d79306c05ec948d3b5d54612dc89172f [2024-11-16 18:45:00,915 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 18:45:00,916 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 18:45:00,917 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 18:45:00,917 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 18:45:00,921 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 18:45:00,921 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:45:00" (1/1) ... [2024-11-16 18:45:00,922 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17f91da8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:45:00, skipping insertion in model container [2024-11-16 18:45:00,922 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:45:00" (1/1) ... [2024-11-16 18:45:00,945 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 18:45:01,086 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-49.i[916,929] [2024-11-16 18:45:01,161 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:45:01,169 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 18:45:01,178 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-49.i[916,929] [2024-11-16 18:45:01,223 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:45:01,246 INFO L204 MainTranslator]: Completed translation [2024-11-16 18:45:01,246 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:45:01 WrapperNode [2024-11-16 18:45:01,247 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 18:45:01,247 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 18:45:01,247 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 18:45:01,248 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 18:45:01,252 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:45:01" (1/1) ... [2024-11-16 18:45:01,270 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:45:01" (1/1) ... [2024-11-16 18:45:01,312 INFO L138 Inliner]: procedures = 30, calls = 192, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 657 [2024-11-16 18:45:01,313 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 18:45:01,314 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 18:45:01,314 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 18:45:01,314 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 18:45:01,325 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:45:01" (1/1) ... [2024-11-16 18:45:01,325 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:45:01" (1/1) ... [2024-11-16 18:45:01,330 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:45:01" (1/1) ... [2024-11-16 18:45:01,339 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-16 18:45:01,339 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:45:01" (1/1) ... [2024-11-16 18:45:01,339 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:45:01" (1/1) ... [2024-11-16 18:45:01,361 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:45:01" (1/1) ... [2024-11-16 18:45:01,363 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:45:01" (1/1) ... [2024-11-16 18:45:01,364 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:45:01" (1/1) ... [2024-11-16 18:45:01,366 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:45:01" (1/1) ... [2024-11-16 18:45:01,370 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 18:45:01,371 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 18:45:01,371 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 18:45:01,371 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 18:45:01,372 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:45:01" (1/1) ... [2024-11-16 18:45:01,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:45:01,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 18:45:01,411 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-16 18:45:01,414 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-16 18:45:01,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 18:45:01,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-16 18:45:01,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-16 18:45:01,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-16 18:45:01,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-16 18:45:01,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-16 18:45:01,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-16 18:45:01,451 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 18:45:01,451 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 18:45:01,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-16 18:45:01,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 18:45:01,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 18:45:01,554 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 18:45:01,555 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 18:45:02,028 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L108: havoc property_#t~mem106#1;havoc property_#t~ite158#1;havoc property_#t~mem107#1;havoc property_#t~mem108#1;havoc property_#t~ite156#1;havoc property_#t~mem149#1;havoc property_#t~mem114#1;havoc property_#t~mem109#1;havoc property_#t~mem110#1;havoc property_#t~ite113#1;havoc property_#t~mem111#1;havoc property_#t~mem112#1;havoc property_#t~ite121#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~ite120#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~ite148#1;havoc property_#t~mem127#1;havoc property_#t~mem122#1;havoc property_#t~mem123#1;havoc property_#t~ite126#1;havoc property_#t~mem124#1;havoc property_#t~mem125#1;havoc property_#t~ite134#1;havoc property_#t~mem128#1;havoc property_#t~mem129#1;havoc property_#t~mem130#1;havoc property_#t~ite133#1;havoc property_#t~mem131#1;havoc property_#t~mem132#1;havoc property_#t~mem140#1;havoc property_#t~mem135#1;havoc property_#t~mem136#1;havoc property_#t~ite139#1;havoc property_#t~mem137#1;havoc property_#t~mem138#1;havoc property_#t~ite147#1;havoc property_#t~mem141#1;havoc property_#t~mem142#1;havoc property_#t~mem143#1;havoc property_#t~ite146#1;havoc property_#t~mem144#1;havoc property_#t~mem145#1;havoc property_#t~mem150#1;havoc property_#t~ite155#1;havoc property_#t~mem152#1;havoc property_#t~mem151#1;havoc property_#t~mem154#1;havoc property_#t~mem153#1;havoc property_#t~mem157#1;havoc property_#t~mem163#1;havoc property_#t~mem159#1;havoc property_#t~ite162#1;havoc property_#t~mem160#1;havoc property_#t~mem161#1;havoc property_#t~short164#1;havoc property_#t~mem165#1;havoc property_#t~bitwise166#1;havoc property_#t~mem167#1;havoc property_#t~ite174#1;havoc property_#t~mem171#1;havoc property_#t~mem168#1;havoc property_#t~mem169#1;havoc property_#t~short170#1;havoc property_#t~mem173#1;havoc property_#t~mem172#1;havoc property_#t~short175#1;havoc property_#t~mem176#1;havoc property_#t~ite190#1;havoc property_#t~mem182#1;havoc property_#t~mem177#1;havoc property_#t~mem178#1;havoc property_#t~ite181#1;havoc property_#t~mem179#1;havoc property_#t~mem180#1;havoc property_#t~ite189#1;havoc property_#t~mem186#1;havoc property_#t~mem183#1;havoc property_#t~mem184#1;havoc property_#t~short185#1;havoc property_#t~mem188#1;havoc property_#t~mem187#1;havoc property_#t~short191#1; [2024-11-16 18:45:02,066 INFO L? ?]: Removed 216 outVars from TransFormulas that were not future-live. [2024-11-16 18:45:02,066 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 18:45:02,086 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 18:45:02,087 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 18:45:02,087 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:45:02 BoogieIcfgContainer [2024-11-16 18:45:02,087 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 18:45:02,090 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 18:45:02,090 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 18:45:02,092 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 18:45:02,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 06:45:00" (1/3) ... [2024-11-16 18:45:02,093 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36d1e934 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:45:02, skipping insertion in model container [2024-11-16 18:45:02,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:45:01" (2/3) ... [2024-11-16 18:45:02,094 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36d1e934 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:45:02, skipping insertion in model container [2024-11-16 18:45:02,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:45:02" (3/3) ... [2024-11-16 18:45:02,095 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-49.i [2024-11-16 18:45:02,107 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 18:45:02,107 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 18:45:02,158 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 18:45:02,164 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;@144f37c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 18:45:02,165 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 18:45:02,170 INFO L276 IsEmpty]: Start isEmpty. Operand has 139 states, 122 states have (on average 1.459016393442623) internal successors, (178), 123 states have internal predecessors, (178), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-16 18:45:02,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-16 18:45:02,182 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:45:02,183 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:45:02,184 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:45:02,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:45:02,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1632025654, now seen corresponding path program 1 times [2024-11-16 18:45:02,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:45:02,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955691337] [2024-11-16 18:45:02,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:45:02,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:45:02,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:45:02,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 18:45:02,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:45:02,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:45:02,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:45:02,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:45:02,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:45:02,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:45:02,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:45:02,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:45:02,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:45:02,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:45:02,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:45:02,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:45:02,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:45:02,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:45:02,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:45:02,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:45:02,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:45:02,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:45:02,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:45:02,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:45:02,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:45:02,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:45:02,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:45:02,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:45:02,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:45:02,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 18:45:02,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:45:02,505 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-16 18:45:02,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:45:02,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955691337] [2024-11-16 18:45:02,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955691337] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:45:02,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:45:02,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 18:45:02,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841853505] [2024-11-16 18:45:02,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:45:02,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 18:45:02,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:45:02,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 18:45:02,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 18:45:02,538 INFO L87 Difference]: Start difference. First operand has 139 states, 122 states have (on average 1.459016393442623) internal successors, (178), 123 states have internal predecessors, (178), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-16 18:45:02,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:45:02,566 INFO L93 Difference]: Finished difference Result 270 states and 419 transitions. [2024-11-16 18:45:02,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 18:45:02,568 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 119 [2024-11-16 18:45:02,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:45:02,574 INFO L225 Difference]: With dead ends: 270 [2024-11-16 18:45:02,574 INFO L226 Difference]: Without dead ends: 134 [2024-11-16 18:45:02,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 18:45:02,581 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:45:02,581 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 196 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:45:02,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-16 18:45:02,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2024-11-16 18:45:02,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 118 states have (on average 1.4406779661016949) internal successors, (170), 118 states have internal predecessors, (170), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-16 18:45:02,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 198 transitions. [2024-11-16 18:45:02,623 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 198 transitions. Word has length 119 [2024-11-16 18:45:02,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:45:02,624 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 198 transitions. [2024-11-16 18:45:02,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-16 18:45:02,625 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 198 transitions. [2024-11-16 18:45:02,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-16 18:45:02,629 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:45:02,629 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:45:02,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 18:45:02,630 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:45:02,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:45:02,631 INFO L85 PathProgramCache]: Analyzing trace with hash 374838498, now seen corresponding path program 1 times [2024-11-16 18:45:02,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:45:02,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843867738] [2024-11-16 18:45:02,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:45:02,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:45:02,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:45:03,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 18:45:03,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:45:03,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:45:03,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:45:03,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:45:03,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:45:03,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:45:03,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:45:03,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:45:03,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:45:03,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:45:03,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:45:03,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:45:03,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:45:03,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:45:03,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:45:03,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:45:03,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:45:03,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:45:03,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:45:03,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:45:03,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:45:03,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:45:03,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:45:03,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:45:03,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:45:03,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 18:45:03,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:45:03,201 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-16 18:45:03,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:45:03,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843867738] [2024-11-16 18:45:03,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843867738] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:45:03,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:45:03,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:45:03,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605013139] [2024-11-16 18:45:03,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:45:03,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:45:03,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:45:03,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:45:03,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:45:03,208 INFO L87 Difference]: Start difference. First operand 134 states and 198 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-16 18:45:03,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:45:03,611 INFO L93 Difference]: Finished difference Result 398 states and 591 transitions. [2024-11-16 18:45:03,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:45:03,612 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 119 [2024-11-16 18:45:03,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:45:03,615 INFO L225 Difference]: With dead ends: 398 [2024-11-16 18:45:03,615 INFO L226 Difference]: Without dead ends: 267 [2024-11-16 18:45:03,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 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-16 18:45:03,617 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 179 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 797 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 18:45:03,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 797 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 18:45:03,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2024-11-16 18:45:03,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 138. [2024-11-16 18:45:03,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 122 states have (on average 1.4344262295081966) internal successors, (175), 122 states have internal predecessors, (175), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-16 18:45:03,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 203 transitions. [2024-11-16 18:45:03,637 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 203 transitions. Word has length 119 [2024-11-16 18:45:03,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:45:03,638 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 203 transitions. [2024-11-16 18:45:03,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-16 18:45:03,639 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 203 transitions. [2024-11-16 18:45:03,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-16 18:45:03,640 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:45:03,642 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:45:03,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 18:45:03,642 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:45:03,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:45:03,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1486120316, now seen corresponding path program 1 times [2024-11-16 18:45:03,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:45:03,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144257235] [2024-11-16 18:45:03,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:45:03,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:45:03,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:45:04,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 18:45:04,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:45:04,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:45:04,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:45:04,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:45:04,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:45:04,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:45:04,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:45:04,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:45:04,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:45:04,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:45:04,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:45:04,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:45:04,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:45:04,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:45:04,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:45:04,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:45:04,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:45:04,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:45:04,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:45:04,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:45:04,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:45:04,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:45:04,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:45:04,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:45:04,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:45:04,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 18:45:04,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:45:04,422 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-16 18:45:04,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:45:04,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144257235] [2024-11-16 18:45:04,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144257235] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:45:04,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:45:04,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 18:45:04,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268720636] [2024-11-16 18:45:04,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:45:04,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 18:45:04,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:45:04,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 18:45:04,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 18:45:04,425 INFO L87 Difference]: Start difference. First operand 138 states and 203 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-16 18:45:04,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:45:04,723 INFO L93 Difference]: Finished difference Result 408 states and 603 transitions. [2024-11-16 18:45:04,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 18:45:04,724 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 121 [2024-11-16 18:45:04,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:45:04,726 INFO L225 Difference]: With dead ends: 408 [2024-11-16 18:45:04,726 INFO L226 Difference]: Without dead ends: 273 [2024-11-16 18:45:04,726 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:45:04,727 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 141 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 18:45:04,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 265 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 18:45:04,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-11-16 18:45:04,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 266. [2024-11-16 18:45:04,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 235 states have (on average 1.4340425531914893) internal successors, (337), 235 states have internal predecessors, (337), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-16 18:45:04,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 393 transitions. [2024-11-16 18:45:04,745 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 393 transitions. Word has length 121 [2024-11-16 18:45:04,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:45:04,745 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 393 transitions. [2024-11-16 18:45:04,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-16 18:45:04,746 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 393 transitions. [2024-11-16 18:45:04,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-16 18:45:04,747 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:45:04,747 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:45:04,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 18:45:04,748 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:45:04,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:45:04,748 INFO L85 PathProgramCache]: Analyzing trace with hash -980561691, now seen corresponding path program 1 times [2024-11-16 18:45:04,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:45:04,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791605353] [2024-11-16 18:45:04,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:45:04,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:45:04,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:45:05,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 18:45:05,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:45:05,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:45:05,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:45:05,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:45:05,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:45:05,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:45:05,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:45:05,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:45:05,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:45:05,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:45:05,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:45:05,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:45:05,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:45:05,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:45:05,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:45:05,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:45:05,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:45:05,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:45:05,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:45:05,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:45:05,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:45:05,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:45:05,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:45:05,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:45:05,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:45:05,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 18:45:05,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:45:05,267 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-16 18:45:05,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:45:05,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791605353] [2024-11-16 18:45:05,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791605353] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:45:05,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:45:05,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 18:45:05,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70944049] [2024-11-16 18:45:05,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:45:05,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 18:45:05,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:45:05,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 18:45:05,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-16 18:45:05,272 INFO L87 Difference]: Start difference. First operand 266 states and 393 transitions. Second operand has 8 states, 7 states have (on average 8.142857142857142) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-16 18:45:05,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:45:05,785 INFO L93 Difference]: Finished difference Result 473 states and 687 transitions. [2024-11-16 18:45:05,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-16 18:45:05,786 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.142857142857142) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 121 [2024-11-16 18:45:05,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:45:05,787 INFO L225 Difference]: With dead ends: 473 [2024-11-16 18:45:05,787 INFO L226 Difference]: Without dead ends: 210 [2024-11-16 18:45:05,788 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2024-11-16 18:45:05,789 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 297 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 18:45:05,789 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 319 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 18:45:05,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-11-16 18:45:05,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 142. [2024-11-16 18:45:05,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 125 states have (on average 1.416) internal successors, (177), 125 states have internal predecessors, (177), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-16 18:45:05,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 205 transitions. [2024-11-16 18:45:05,805 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 205 transitions. Word has length 121 [2024-11-16 18:45:05,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:45:05,805 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 205 transitions. [2024-11-16 18:45:05,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.142857142857142) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-16 18:45:05,806 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 205 transitions. [2024-11-16 18:45:05,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-16 18:45:05,807 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:45:05,807 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:45:05,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 18:45:05,807 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:45:05,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:45:05,808 INFO L85 PathProgramCache]: Analyzing trace with hash 614569542, now seen corresponding path program 1 times [2024-11-16 18:45:05,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:45:05,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381610247] [2024-11-16 18:45:05,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:45:05,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:45:05,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 18:45:05,866 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 18:45:05,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 18:45:05,956 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 18:45:05,956 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 18:45:05,958 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 18:45:05,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 18:45:05,961 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-16 18:45:06,013 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 18:45:06,019 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 06:45:06 BoogieIcfgContainer [2024-11-16 18:45:06,020 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 18:45:06,020 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 18:45:06,020 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 18:45:06,020 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 18:45:06,020 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:45:02" (3/4) ... [2024-11-16 18:45:06,022 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 18:45:06,023 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 18:45:06,023 INFO L158 Benchmark]: Toolchain (without parser) took 5106.90ms. Allocated memory was 167.8MB in the beginning and 308.3MB in the end (delta: 140.5MB). Free memory was 113.0MB in the beginning and 253.3MB in the end (delta: -140.3MB). Peak memory consumption was 3.2MB. Max. memory is 16.1GB. [2024-11-16 18:45:06,024 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 167.8MB. Free memory is still 134.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 18:45:06,024 INFO L158 Benchmark]: CACSL2BoogieTranslator took 329.63ms. Allocated memory is still 167.8MB. Free memory was 112.9MB in the beginning and 92.4MB in the end (delta: 20.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-16 18:45:06,024 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.07ms. Allocated memory is still 167.8MB. Free memory was 92.4MB in the beginning and 86.5MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-16 18:45:06,024 INFO L158 Benchmark]: Boogie Preprocessor took 56.65ms. Allocated memory is still 167.8MB. Free memory was 86.5MB in the beginning and 81.9MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 18:45:06,024 INFO L158 Benchmark]: IcfgBuilder took 716.06ms. Allocated memory is still 167.8MB. Free memory was 81.9MB in the beginning and 124.8MB in the end (delta: -42.8MB). Peak memory consumption was 45.1MB. Max. memory is 16.1GB. [2024-11-16 18:45:06,025 INFO L158 Benchmark]: TraceAbstraction took 3930.01ms. Allocated memory was 167.8MB in the beginning and 308.3MB in the end (delta: 140.5MB). Free memory was 124.8MB in the beginning and 254.3MB in the end (delta: -129.5MB). Peak memory consumption was 176.2MB. Max. memory is 16.1GB. [2024-11-16 18:45:06,025 INFO L158 Benchmark]: Witness Printer took 2.91ms. Allocated memory is still 308.3MB. Free memory was 254.3MB in the beginning and 253.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 18:45:06,028 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.16ms. Allocated memory is still 167.8MB. Free memory is still 134.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 329.63ms. Allocated memory is still 167.8MB. Free memory was 112.9MB in the beginning and 92.4MB in the end (delta: 20.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.07ms. Allocated memory is still 167.8MB. Free memory was 92.4MB in the beginning and 86.5MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.65ms. Allocated memory is still 167.8MB. Free memory was 86.5MB in the beginning and 81.9MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 716.06ms. Allocated memory is still 167.8MB. Free memory was 81.9MB in the beginning and 124.8MB in the end (delta: -42.8MB). Peak memory consumption was 45.1MB. Max. memory is 16.1GB. * TraceAbstraction took 3930.01ms. Allocated memory was 167.8MB in the beginning and 308.3MB in the end (delta: 140.5MB). Free memory was 124.8MB in the beginning and 254.3MB in the end (delta: -129.5MB). Peak memory consumption was 176.2MB. Max. memory is 16.1GB. * Witness Printer took 2.91ms. Allocated memory is still 308.3MB. Free memory was 254.3MB in the beginning and 253.3MB in the end (delta: 1.0MB). 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 someBinaryFLOATComparisonOperation at line 108. Possible FailurePath: [L36] unsigned char isInitial = 0; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 4, 1000000000000000.4, 1000.2, 256, 4, 10, 128, -2, 0, 0, 0, 1 }; VAL [WrapperStruct00={4:0}, isInitial=0] [L112] isInitial = 1 [L113] FCALL initially() [L114] COND TRUE 1 [L115] FCALL updateLastVariables() [L116] CALL updateVariables() [L82] WrapperStruct00.var_1_2 = __VERIFIER_nondet_float() [L83] EXPR WrapperStruct00.var_1_2 [L83] EXPR WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F [L83] EXPR WrapperStruct00.var_1_2 [L83] EXPR WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L83] EXPR (WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L83] CALL assume_abort_if_not((WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L83] RET assume_abort_if_not((WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L84] WrapperStruct00.var_1_3 = __VERIFIER_nondet_float() [L85] EXPR WrapperStruct00.var_1_3 [L85] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F [L85] EXPR WrapperStruct00.var_1_3 [L85] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L85] EXPR (WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L85] CALL assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L85] RET assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L86] WrapperStruct00.var_1_4 = __VERIFIER_nondet_ushort() [L87] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L87] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L87] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L88] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L88] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 65534) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L88] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 65534) VAL [WrapperStruct00={4:0}, isInitial=1] [L89] WrapperStruct00.var_1_5 = __VERIFIER_nondet_ushort() [L90] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1] [L90] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L90] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L91] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 65534) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 65534) VAL [WrapperStruct00={4:0}, isInitial=1] [L92] WrapperStruct00.var_1_6 = __VERIFIER_nondet_ushort() [L93] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L94] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 65534) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 65534) VAL [WrapperStruct00={4:0}, isInitial=1] [L95] WrapperStruct00.var_1_9 = __VERIFIER_nondet_short() [L96] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= -32766) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= -32766) VAL [WrapperStruct00={4:0}, isInitial=1] [L97] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 32766) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 32766) VAL [WrapperStruct00={4:0}, isInitial=1] [L98] WrapperStruct00.var_1_11 = __VERIFIER_nondet_uchar() [L99] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L100] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L101] WrapperStruct00.var_1_12 = __VERIFIER_nondet_uchar() [L102] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L103] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L116] RET updateVariables() [L117] CALL step() [L54] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1] [L54] EXPR ((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9) [L54] EXPR WrapperStruct00.var_1_9 [L54] EXPR ((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9) VAL [WrapperStruct00={4:0}, isInitial=1] [L54] WrapperStruct00.var_1_8 = ((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))) [L55] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L55] EXPR 50 >> WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L55] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1] [L55] COND FALSE !((50 >> WrapperStruct00.var_1_4) <= WrapperStruct00.var_1_8) [L58] EXPR WrapperStruct00.var_1_11 [L58] WrapperStruct00.var_1_10 = (! WrapperStruct00.var_1_11) [L60] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1] [L60] COND TRUE ! WrapperStruct00.var_1_12 [L61] EXPR WrapperStruct00.var_1_4 [L61] EXPR WrapperStruct00.var_1_6 [L61] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1] [L61] EXPR ((WrapperStruct00.var_1_6) < (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_6) : (WrapperStruct00.var_1_8) [L61] EXPR WrapperStruct00.var_1_6 [L61] EXPR ((WrapperStruct00.var_1_6) < (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_6) : (WrapperStruct00.var_1_8) VAL [WrapperStruct00={4:0}, isInitial=1] [L61] COND FALSE !(WrapperStruct00.var_1_4 >= ((((WrapperStruct00.var_1_6) < (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_6) : (WrapperStruct00.var_1_8)))) [L64] EXPR WrapperStruct00.var_1_11 [L64] WrapperStruct00.var_1_13 = WrapperStruct00.var_1_11 [L67] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L67] COND TRUE WrapperStruct00.var_1_2 >= 64.5f [L68] EXPR WrapperStruct00.var_1_2 [L68] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L68] COND FALSE !(WrapperStruct00.var_1_2 >= WrapperStruct00.var_1_3) [L71] WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1] [L71] COND FALSE !(WrapperStruct00.var_1_13) [L74] EXPR WrapperStruct00.var_1_6 [L74] WrapperStruct00.var_1_1 = WrapperStruct00.var_1_6 [L117] RET step() [L118] CALL, EXPR property() [L108] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L108] EXPR (WrapperStruct00.var_1_2 >= 64.5f) ? ((WrapperStruct00.var_1_2 >= WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_1 == ((unsigned short int) (((((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))))) < 0 ) ? -((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))))) : ((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))))))))) : (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_1 == ((unsigned short int) 50)) [L108] EXPR WrapperStruct00.var_1_1 [L108] EXPR (WrapperStruct00.var_1_2 >= 64.5f) ? ((WrapperStruct00.var_1_2 >= WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_1 == ((unsigned short int) (((((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))))) < 0 ) ? -((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))))) : ((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))))))))) : (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_1 == ((unsigned short int) 50)) VAL [WrapperStruct00={4:0}, isInitial=1] [L108] EXPR ((WrapperStruct00.var_1_2 >= 64.5f) ? ((WrapperStruct00.var_1_2 >= WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_1 == ((unsigned short int) (((((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))))) < 0 ) ? -((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))))) : ((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))))))))) : (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_1 == ((unsigned short int) 50))) && (WrapperStruct00.var_1_8 == ((signed short int) ((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))))) VAL [WrapperStruct00={4:0}, isInitial=1] [L108] EXPR (((WrapperStruct00.var_1_2 >= 64.5f) ? ((WrapperStruct00.var_1_2 >= WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_1 == ((unsigned short int) (((((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))))) < 0 ) ? -((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))))) : ((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))))))))) : (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_1 == ((unsigned short int) 50))) && (WrapperStruct00.var_1_8 == ((signed short int) ((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9)))))) && (((50 >> WrapperStruct00.var_1_4) <= WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_10 == ((unsigned char) ((! (! WrapperStruct00.var_1_11)) || WrapperStruct00.var_1_12))) : (WrapperStruct00.var_1_10 == ((unsigned char) (! WrapperStruct00.var_1_11)))) VAL [WrapperStruct00={4:0}, isInitial=1] [L108] EXPR ((((WrapperStruct00.var_1_2 >= 64.5f) ? ((WrapperStruct00.var_1_2 >= WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_1 == ((unsigned short int) (((((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))))) < 0 ) ? -((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))))) : ((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))))))))) : (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_1 == ((unsigned short int) 50))) && (WrapperStruct00.var_1_8 == ((signed short int) ((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9)))))) && (((50 >> WrapperStruct00.var_1_4) <= WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_10 == ((unsigned char) ((! (! WrapperStruct00.var_1_11)) || WrapperStruct00.var_1_12))) : (WrapperStruct00.var_1_10 == ((unsigned char) (! WrapperStruct00.var_1_11))))) && ((! WrapperStruct00.var_1_12) ? ((WrapperStruct00.var_1_4 >= ((((WrapperStruct00.var_1_6) < (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_6) : (WrapperStruct00.var_1_8)))) ? (WrapperStruct00.var_1_13 == ((unsigned char) (WrapperStruct00.var_1_10 && WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_13 == ((unsigned char) WrapperStruct00.var_1_11))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L108-L109] return ((((WrapperStruct00.var_1_2 >= 64.5f) ? ((WrapperStruct00.var_1_2 >= WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_1 == ((unsigned short int) (((((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))))) < 0 ) ? -((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))))) : ((((WrapperStruct00.var_1_4) > (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6))))) ? (WrapperStruct00.var_1_4) : (((((WrapperStruct00.var_1_5) > (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))))))))) : (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_1 == ((unsigned short int) 50))) && (WrapperStruct00.var_1_8 == ((signed short int) ((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9)))))) && (((50 >> WrapperStruct00.var_1_4) <= WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_10 == ((unsigned char) ((! (! WrapperStruct00.var_1_11)) || WrapperStruct00.var_1_12))) : (WrapperStruct00.var_1_10 == ((unsigned char) (! WrapperStruct00.var_1_11))))) && ((! WrapperStruct00.var_1_12) ? ((WrapperStruct00.var_1_4 >= ((((WrapperStruct00.var_1_6) < (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_6) : (WrapperStruct00.var_1_8)))) ? (WrapperStruct00.var_1_13 == ((unsigned char) (WrapperStruct00.var_1_10 && WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_13 == ((unsigned char) WrapperStruct00.var_1_11))) : 1) ; [L118] RET, EXPR property() [L118] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 139 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.8s, OverallIterations: 5, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 618 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 617 mSDsluCounter, 1577 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 977 mSDsCounter, 75 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1461 IncrementalHoareTripleChecker+Invalid, 1536 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 75 mSolverCounterUnsat, 600 mSDtfsCounter, 1461 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 170 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=266occurred in iteration=3, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 204 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 603 NumberOfCodeBlocks, 603 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 476 ConstructedInterpolants, 0 QuantifiedInterpolants, 1079 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 1456/1456 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-16 18:45:06,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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-49.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 06bb6f3bbb0c6ee3bc73b3f1732ad2bc217c179634d5fa3dbf744e010ef897a1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 18:45:07,805 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 18:45:07,847 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 18:45:07,850 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 18:45:07,850 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 18:45:07,877 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 18:45:07,878 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 18:45:07,878 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 18:45:07,879 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 18:45:07,880 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 18:45:07,881 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 18:45:07,881 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 18:45:07,881 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 18:45:07,882 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 18:45:07,882 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 18:45:07,884 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 18:45:07,884 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 18:45:07,885 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 18:45:07,885 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 18:45:07,885 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 18:45:07,885 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 18:45:07,885 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 18:45:07,885 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 18:45:07,886 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 18:45:07,886 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 18:45:07,886 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 18:45:07,886 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 18:45:07,886 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 18:45:07,886 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 18:45:07,887 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 18:45:07,887 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 18:45:07,887 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 18:45:07,887 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 18:45:07,887 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 18:45:07,887 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:45:07,888 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 18:45:07,888 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 18:45:07,888 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 18:45:07,888 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 18:45:07,888 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 18:45:07,888 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 18:45:07,890 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 18:45:07,890 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 18:45:07,890 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 18:45:07,890 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 -> 06bb6f3bbb0c6ee3bc73b3f1732ad2bc217c179634d5fa3dbf744e010ef897a1 [2024-11-16 18:45:08,128 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 18:45:08,148 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 18:45:08,151 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 18:45:08,152 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 18:45:08,153 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 18:45:08,154 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-49.i [2024-11-16 18:45:09,396 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 18:45:09,547 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 18:45:09,547 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-49.i [2024-11-16 18:45:09,557 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d75c35600/fbf542e0474944ba94c08593ea791559/FLAG4adf28708 [2024-11-16 18:45:09,567 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d75c35600/fbf542e0474944ba94c08593ea791559 [2024-11-16 18:45:09,569 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 18:45:09,569 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 18:45:09,570 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 18:45:09,570 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 18:45:09,575 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 18:45:09,575 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:45:09" (1/1) ... [2024-11-16 18:45:09,576 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46e498fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:45:09, skipping insertion in model container [2024-11-16 18:45:09,576 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:45:09" (1/1) ... [2024-11-16 18:45:09,596 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 18:45:09,755 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-49.i[916,929] [2024-11-16 18:45:09,815 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:45:09,830 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 18:45:09,841 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-49.i[916,929] [2024-11-16 18:45:09,892 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:45:09,916 INFO L204 MainTranslator]: Completed translation [2024-11-16 18:45:09,916 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:45:09 WrapperNode [2024-11-16 18:45:09,916 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 18:45:09,917 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 18:45:09,917 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 18:45:09,918 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 18:45:09,923 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:45:09" (1/1) ... [2024-11-16 18:45:09,944 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:45:09" (1/1) ... [2024-11-16 18:45:09,983 INFO L138 Inliner]: procedures = 34, calls = 192, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 641 [2024-11-16 18:45:09,983 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 18:45:09,984 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 18:45:09,984 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 18:45:09,984 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 18:45:09,992 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:45:09" (1/1) ... [2024-11-16 18:45:09,992 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:45:09" (1/1) ... [2024-11-16 18:45:09,998 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:45:09" (1/1) ... [2024-11-16 18:45:10,019 INFO L175 MemorySlicer]: Split 167 memory accesses to 2 slices as follows [2, 165]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 30 writes are split as follows [0, 30]. [2024-11-16 18:45:10,020 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:45:09" (1/1) ... [2024-11-16 18:45:10,020 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:45:09" (1/1) ... [2024-11-16 18:45:10,054 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:45:09" (1/1) ... [2024-11-16 18:45:10,059 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:45:09" (1/1) ... [2024-11-16 18:45:10,063 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:45:09" (1/1) ... [2024-11-16 18:45:10,065 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:45:09" (1/1) ... [2024-11-16 18:45:10,071 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 18:45:10,072 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 18:45:10,073 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 18:45:10,073 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 18:45:10,073 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:45:09" (1/1) ... [2024-11-16 18:45:10,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:45:10,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 18:45:10,100 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-16 18:45:10,104 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-16 18:45:10,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 18:45:10,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-16 18:45:10,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-16 18:45:10,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 18:45:10,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-16 18:45:10,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-16 18:45:10,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-16 18:45:10,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-16 18:45:10,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-16 18:45:10,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-16 18:45:10,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-16 18:45:10,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2024-11-16 18:45:10,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2024-11-16 18:45:10,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-16 18:45:10,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-16 18:45:10,145 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 18:45:10,145 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 18:45:10,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-16 18:45:10,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-16 18:45:10,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 18:45:10,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 18:45:10,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-16 18:45:10,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-16 18:45:10,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-16 18:45:10,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-16 18:45:10,259 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 18:45:10,260 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 18:45:10,768 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L108: havoc property_#t~mem105#1;havoc property_#t~ite157#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~ite155#1;havoc property_#t~mem148#1;havoc property_#t~mem113#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~ite112#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~ite120#1;havoc property_#t~mem114#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~ite119#1;havoc property_#t~mem117#1;havoc property_#t~mem118#1;havoc property_#t~ite147#1;havoc property_#t~mem126#1;havoc property_#t~mem121#1;havoc property_#t~mem122#1;havoc property_#t~ite125#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~ite133#1;havoc property_#t~mem127#1;havoc property_#t~mem128#1;havoc property_#t~mem129#1;havoc property_#t~ite132#1;havoc property_#t~mem130#1;havoc property_#t~mem131#1;havoc property_#t~mem139#1;havoc property_#t~mem134#1;havoc property_#t~mem135#1;havoc property_#t~ite138#1;havoc property_#t~mem136#1;havoc property_#t~mem137#1;havoc property_#t~ite146#1;havoc property_#t~mem140#1;havoc property_#t~mem141#1;havoc property_#t~mem142#1;havoc property_#t~ite145#1;havoc property_#t~mem143#1;havoc property_#t~mem144#1;havoc property_#t~mem149#1;havoc property_#t~ite154#1;havoc property_#t~mem151#1;havoc property_#t~mem150#1;havoc property_#t~mem153#1;havoc property_#t~mem152#1;havoc property_#t~mem156#1;havoc property_#t~mem162#1;havoc property_#t~mem158#1;havoc property_#t~ite161#1;havoc property_#t~mem159#1;havoc property_#t~mem160#1;havoc property_#t~short163#1;havoc property_#t~mem164#1;havoc property_#t~mem165#1;havoc property_#t~ite172#1;havoc property_#t~mem169#1;havoc property_#t~mem166#1;havoc property_#t~mem167#1;havoc property_#t~short168#1;havoc property_#t~mem171#1;havoc property_#t~mem170#1;havoc property_#t~short173#1;havoc property_#t~mem174#1;havoc property_#t~ite188#1;havoc property_#t~mem180#1;havoc property_#t~mem175#1;havoc property_#t~mem176#1;havoc property_#t~ite179#1;havoc property_#t~mem177#1;havoc property_#t~mem178#1;havoc property_#t~ite187#1;havoc property_#t~mem184#1;havoc property_#t~mem181#1;havoc property_#t~mem182#1;havoc property_#t~short183#1;havoc property_#t~mem186#1;havoc property_#t~mem185#1;havoc property_#t~short189#1; [2024-11-16 18:45:10,823 INFO L? ?]: Removed 212 outVars from TransFormulas that were not future-live. [2024-11-16 18:45:10,823 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 18:45:10,836 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 18:45:10,837 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 18:45:10,838 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:45:10 BoogieIcfgContainer [2024-11-16 18:45:10,838 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 18:45:10,840 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 18:45:10,840 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 18:45:10,842 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 18:45:10,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 06:45:09" (1/3) ... [2024-11-16 18:45:10,843 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61b6f5d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:45:10, skipping insertion in model container [2024-11-16 18:45:10,843 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:45:09" (2/3) ... [2024-11-16 18:45:10,844 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61b6f5d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:45:10, skipping insertion in model container [2024-11-16 18:45:10,844 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:45:10" (3/3) ... [2024-11-16 18:45:10,845 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-49.i [2024-11-16 18:45:10,857 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 18:45:10,858 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 18:45:10,907 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 18:45:10,912 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;@6bb5da75, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 18:45:10,912 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 18:45:10,915 INFO L276 IsEmpty]: Start isEmpty. Operand has 133 states, 116 states have (on average 1.4655172413793103) internal successors, (170), 117 states have internal predecessors, (170), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-16 18:45:10,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-16 18:45:10,925 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:45:10,926 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:45:10,926 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:45:10,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:45:10,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1981250334, now seen corresponding path program 1 times [2024-11-16 18:45:10,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:45:10,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1495255333] [2024-11-16 18:45:10,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:45:10,939 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-16 18:45:10,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:45:10,941 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-16 18:45:10,941 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-16 18:45:11,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:45:11,160 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 18:45:11,167 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:45:11,218 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2024-11-16 18:45:11,219 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:45:11,219 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:45:11,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1495255333] [2024-11-16 18:45:11,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1495255333] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:45:11,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:45:11,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 18:45:11,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243718272] [2024-11-16 18:45:11,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:45:11,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 18:45:11,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:45:11,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 18:45:11,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 18:45:11,250 INFO L87 Difference]: Start difference. First operand has 133 states, 116 states have (on average 1.4655172413793103) internal successors, (170), 117 states have internal predecessors, (170), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-16 18:45:11,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:45:11,274 INFO L93 Difference]: Finished difference Result 258 states and 403 transitions. [2024-11-16 18:45:11,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 18:45:11,276 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 117 [2024-11-16 18:45:11,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:45:11,281 INFO L225 Difference]: With dead ends: 258 [2024-11-16 18:45:11,281 INFO L226 Difference]: Without dead ends: 128 [2024-11-16 18:45:11,284 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 116 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-16 18:45:11,286 INFO L432 NwaCegarLoop]: 190 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, 190 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-16 18:45:11,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:45:11,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-16 18:45:11,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2024-11-16 18:45:11,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 112 states have (on average 1.4464285714285714) internal successors, (162), 112 states have internal predecessors, (162), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-16 18:45:11,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 190 transitions. [2024-11-16 18:45:11,316 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 190 transitions. Word has length 117 [2024-11-16 18:45:11,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:45:11,317 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 190 transitions. [2024-11-16 18:45:11,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-16 18:45:11,317 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 190 transitions. [2024-11-16 18:45:11,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-16 18:45:11,319 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:45:11,319 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:45:11,326 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-16 18:45:11,523 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-16 18:45:11,524 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:45:11,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:45:11,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1331786038, now seen corresponding path program 1 times [2024-11-16 18:45:11,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:45:11,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [992398517] [2024-11-16 18:45:11,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:45:11,525 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-16 18:45:11,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:45:11,528 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-16 18:45:11,529 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-16 18:45:11,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:45:11,747 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-16 18:45:11,753 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:45:11,843 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 12 treesize of output 8 [2024-11-16 18:45:11,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2024-11-16 18:45:11,926 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-16 18:45:11,927 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:45:11,927 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:45:11,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [992398517] [2024-11-16 18:45:11,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [992398517] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:45:11,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:45:11,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:45:11,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671058276] [2024-11-16 18:45:11,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:45:11,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:45:11,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:45:11,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:45:11,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:45:11,931 INFO L87 Difference]: Start difference. First operand 128 states and 190 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-16 18:45:12,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:45:12,485 INFO L93 Difference]: Finished difference Result 380 states and 567 transitions. [2024-11-16 18:45:12,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:45:12,486 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 117 [2024-11-16 18:45:12,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:45:12,488 INFO L225 Difference]: With dead ends: 380 [2024-11-16 18:45:12,488 INFO L226 Difference]: Without dead ends: 255 [2024-11-16 18:45:12,489 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 113 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-16 18:45:12,490 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 171 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 18:45:12,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 763 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 18:45:12,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-11-16 18:45:12,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 132. [2024-11-16 18:45:12,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 116 states have (on average 1.4396551724137931) internal successors, (167), 116 states have internal predecessors, (167), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-16 18:45:12,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 195 transitions. [2024-11-16 18:45:12,506 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 195 transitions. Word has length 117 [2024-11-16 18:45:12,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:45:12,507 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 195 transitions. [2024-11-16 18:45:12,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-16 18:45:12,508 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 195 transitions. [2024-11-16 18:45:12,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-16 18:45:12,511 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:45:12,511 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:45:12,518 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-16 18:45:12,711 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-16 18:45:12,712 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:45:12,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:45:12,713 INFO L85 PathProgramCache]: Analyzing trace with hash -46012947, now seen corresponding path program 1 times [2024-11-16 18:45:12,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:45:12,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1856416099] [2024-11-16 18:45:12,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:45:12,714 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-16 18:45:12,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:45:12,716 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-16 18:45:12,717 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-16 18:45:12,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:45:12,974 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-16 18:45:12,978 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:45:12,987 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-16 18:45:13,029 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 31 treesize of output 15 [2024-11-16 18:45:13,037 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 31 treesize of output 15 [2024-11-16 18:45:13,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-16 18:45:13,077 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-16 18:45:13,078 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:45:13,078 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:45:13,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1856416099] [2024-11-16 18:45:13,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1856416099] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:45:13,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:45:13,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 18:45:13,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984803876] [2024-11-16 18:45:13,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:45:13,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 18:45:13,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:45:13,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 18:45:13,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 18:45:13,082 INFO L87 Difference]: Start difference. First operand 132 states and 195 transitions. Second operand has 7 states, 6 states have (on average 9.166666666666666) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-16 18:45:13,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:45:13,792 INFO L93 Difference]: Finished difference Result 269 states and 394 transitions. [2024-11-16 18:45:13,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-16 18:45:13,794 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.166666666666666) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 119 [2024-11-16 18:45:13,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:45:13,797 INFO L225 Difference]: With dead ends: 269 [2024-11-16 18:45:13,797 INFO L226 Difference]: Without dead ends: 140 [2024-11-16 18:45:13,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-16 18:45:13,799 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 153 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 18:45:13,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 305 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 18:45:13,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-16 18:45:13,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 136. [2024-11-16 18:45:13,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 119 states have (on average 1.4201680672268908) internal successors, (169), 119 states have internal predecessors, (169), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-16 18:45:13,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 197 transitions. [2024-11-16 18:45:13,811 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 197 transitions. Word has length 119 [2024-11-16 18:45:13,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:45:13,811 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 197 transitions. [2024-11-16 18:45:13,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.166666666666666) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-16 18:45:13,811 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 197 transitions. [2024-11-16 18:45:13,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-16 18:45:13,813 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:45:13,813 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:45:13,820 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-16 18:45:14,013 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-16 18:45:14,014 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:45:14,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:45:14,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1896527055, now seen corresponding path program 1 times [2024-11-16 18:45:14,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:45:14,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [152611277] [2024-11-16 18:45:14,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:45:14,015 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-16 18:45:14,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:45:14,018 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-16 18:45:14,018 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-16 18:45:14,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:45:14,262 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-16 18:45:14,267 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:45:14,272 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 14 treesize of output 10 [2024-11-16 18:45:14,367 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 41 treesize of output 19 [2024-11-16 18:45:14,459 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 41 treesize of output 19 [2024-11-16 18:45:14,468 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 41 treesize of output 19 [2024-11-16 18:45:14,504 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 43 treesize of output 30 [2024-11-16 18:45:14,562 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:45:14,562 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 33 treesize of output 15 [2024-11-16 18:45:14,579 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 173 proven. 6 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2024-11-16 18:45:14,579 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 18:45:14,796 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 33 proven. 6 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-16 18:45:14,797 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:45:14,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [152611277] [2024-11-16 18:45:14,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [152611277] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 18:45:14,797 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 18:45:14,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2024-11-16 18:45:14,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120410545] [2024-11-16 18:45:14,797 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 18:45:14,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-16 18:45:14,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:45:14,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-16 18:45:14,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2024-11-16 18:45:14,799 INFO L87 Difference]: Start difference. First operand 136 states and 197 transitions. Second operand has 15 states, 13 states have (on average 6.384615384615385) internal successors, (83), 15 states have internal predecessors, (83), 6 states have call successors, (18), 3 states have call predecessors, (18), 5 states have return successors, (18), 4 states have call predecessors, (18), 6 states have call successors, (18) [2024-11-16 18:45:16,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:45:16,936 INFO L93 Difference]: Finished difference Result 422 states and 603 transitions. [2024-11-16 18:45:16,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-16 18:45:16,937 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 6.384615384615385) internal successors, (83), 15 states have internal predecessors, (83), 6 states have call successors, (18), 3 states have call predecessors, (18), 5 states have return successors, (18), 4 states have call predecessors, (18), 6 states have call successors, (18) Word has length 121 [2024-11-16 18:45:16,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:45:16,939 INFO L225 Difference]: With dead ends: 422 [2024-11-16 18:45:16,939 INFO L226 Difference]: Without dead ends: 289 [2024-11-16 18:45:16,943 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 226 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=285, Invalid=837, Unknown=0, NotChecked=0, Total=1122 [2024-11-16 18:45:16,944 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 857 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 1240 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 878 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 1356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 1240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-16 18:45:16,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [878 Valid, 521 Invalid, 1356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 1240 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-16 18:45:16,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2024-11-16 18:45:16,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 144. [2024-11-16 18:45:16,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 126 states have (on average 1.4126984126984128) internal successors, (178), 126 states have internal predecessors, (178), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-16 18:45:16,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 206 transitions. [2024-11-16 18:45:16,967 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 206 transitions. Word has length 121 [2024-11-16 18:45:16,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:45:16,969 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 206 transitions. [2024-11-16 18:45:16,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 6.384615384615385) internal successors, (83), 15 states have internal predecessors, (83), 6 states have call successors, (18), 3 states have call predecessors, (18), 5 states have return successors, (18), 4 states have call predecessors, (18), 6 states have call successors, (18) [2024-11-16 18:45:16,969 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 206 transitions. [2024-11-16 18:45:16,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-16 18:45:16,971 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:45:16,971 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:45:16,986 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 (5)] Ended with exit code 0 [2024-11-16 18:45:17,171 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-16 18:45:17,171 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:45:17,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:45:17,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1390968430, now seen corresponding path program 1 times [2024-11-16 18:45:17,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:45:17,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1073386583] [2024-11-16 18:45:17,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:45:17,173 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-16 18:45:17,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:45:17,175 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-16 18:45:17,175 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-16 18:45:17,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:45:17,414 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-16 18:45:17,420 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:45:17,466 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-16 18:45:17,668 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 75 treesize of output 44 [2024-11-16 18:45:17,866 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:45:17,867 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 90 treesize of output 47 [2024-11-16 18:45:18,020 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:45:18,021 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 90 treesize of output 47 [2024-11-16 18:45:18,188 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:45:18,188 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 90 treesize of output 47 [2024-11-16 18:45:18,322 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:45:18,322 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 85 treesize of output 57 [2024-11-16 18:45:18,536 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:45:18,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 95 treesize of output 70 [2024-11-16 18:45:18,868 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:45:18,869 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 110 treesize of output 73 [2024-11-16 18:45:18,893 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:45:18,893 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 110 treesize of output 73 [2024-11-16 18:45:18,968 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:45:18,968 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 110 treesize of output 73 [2024-11-16 18:45:19,080 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:45:19,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 174 treesize of output 66 [2024-11-16 18:45:19,131 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 244 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-16 18:45:19,131 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:45:19,131 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:45:19,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1073386583] [2024-11-16 18:45:19,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1073386583] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:45:19,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:45:19,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-16 18:45:19,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138653493] [2024-11-16 18:45:19,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:45:19,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-16 18:45:19,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:45:19,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-16 18:45:19,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-16 18:45:19,133 INFO L87 Difference]: Start difference. First operand 144 states and 206 transitions. Second operand has 12 states, 12 states have (on average 5.5) internal successors, (66), 11 states have internal predecessors, (66), 5 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2024-11-16 18:45:21,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:45:21,139 INFO L93 Difference]: Finished difference Result 429 states and 610 transitions. [2024-11-16 18:45:21,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-16 18:45:21,140 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.5) internal successors, (66), 11 states have internal predecessors, (66), 5 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 121 [2024-11-16 18:45:21,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:45:21,141 INFO L225 Difference]: With dead ends: 429 [2024-11-16 18:45:21,141 INFO L226 Difference]: Without dead ends: 288 [2024-11-16 18:45:21,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2024-11-16 18:45:21,142 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 525 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 1108 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 1128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-16 18:45:21,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 604 Invalid, 1128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1108 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-16 18:45:21,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-11-16 18:45:21,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 281. [2024-11-16 18:45:21,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 244 states have (on average 1.401639344262295) internal successors, (342), 245 states have internal predecessors, (342), 28 states have call successors, (28), 8 states have call predecessors, (28), 8 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-16 18:45:21,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 398 transitions. [2024-11-16 18:45:21,162 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 398 transitions. Word has length 121 [2024-11-16 18:45:21,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:45:21,162 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 398 transitions. [2024-11-16 18:45:21,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.5) internal successors, (66), 11 states have internal predecessors, (66), 5 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2024-11-16 18:45:21,163 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 398 transitions. [2024-11-16 18:45:21,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-16 18:45:21,164 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:45:21,164 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:45:21,172 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-16 18:45:21,364 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-16 18:45:21,364 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:45:21,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:45:21,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1596494734, now seen corresponding path program 1 times [2024-11-16 18:45:21,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:45:21,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [532891940] [2024-11-16 18:45:21,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:45:21,366 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-16 18:45:21,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:45:21,368 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-16 18:45:21,369 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-16 18:45:21,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:45:21,585 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-16 18:45:21,589 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:45:21,592 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-16 18:45:21,598 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 14 treesize of output 10 [2024-11-16 18:45:21,636 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 30 treesize of output 14 [2024-11-16 18:45:21,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2024-11-16 18:45:21,731 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:45:21,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 54 [2024-11-16 18:45:21,885 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:45:21,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 55 [2024-11-16 18:45:21,947 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:45:21,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 55 [2024-11-16 18:45:22,072 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:45:22,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 38 [2024-11-16 18:45:22,200 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-11-16 18:45:22,200 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:45:22,200 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:45:22,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [532891940] [2024-11-16 18:45:22,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [532891940] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:45:22,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:45:22,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-16 18:45:22,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236241510] [2024-11-16 18:45:22,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:45:22,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-16 18:45:22,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:45:22,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-16 18:45:22,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-16 18:45:22,202 INFO L87 Difference]: Start difference. First operand 281 states and 398 transitions. Second operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-16 18:45:25,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:45:25,566 INFO L93 Difference]: Finished difference Result 1015 states and 1457 transitions. [2024-11-16 18:45:25,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-16 18:45:25,566 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 121 [2024-11-16 18:45:25,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:45:25,570 INFO L225 Difference]: With dead ends: 1015 [2024-11-16 18:45:25,570 INFO L226 Difference]: Without dead ends: 737 [2024-11-16 18:45:25,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 107 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2024-11-16 18:45:25,571 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 568 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 1512 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 866 SdHoareTripleChecker+Invalid, 1573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-16 18:45:25,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 866 Invalid, 1573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1512 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-16 18:45:25,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2024-11-16 18:45:25,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 619. [2024-11-16 18:45:25,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 562 states have (on average 1.4519572953736655) internal successors, (816), 566 states have internal predecessors, (816), 44 states have call successors, (44), 12 states have call predecessors, (44), 12 states have return successors, (44), 40 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-16 18:45:25,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 904 transitions. [2024-11-16 18:45:25,613 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 904 transitions. Word has length 121 [2024-11-16 18:45:25,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:45:25,614 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 904 transitions. [2024-11-16 18:45:25,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-16 18:45:25,614 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 904 transitions. [2024-11-16 18:45:25,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-16 18:45:25,615 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:45:25,615 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:45:25,626 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 (7)] Ended with exit code 0 [2024-11-16 18:45:25,816 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-16 18:45:25,817 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:45:25,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:45:25,817 INFO L85 PathProgramCache]: Analyzing trace with hash -200456625, now seen corresponding path program 1 times [2024-11-16 18:45:25,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:45:25,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [880515592] [2024-11-16 18:45:25,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:45:25,818 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-16 18:45:25,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:45:25,821 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-16 18:45:25,821 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-16 18:45:26,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:45:26,044 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-16 18:45:26,047 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:45:26,051 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-16 18:45:26,065 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 31 treesize of output 15 [2024-11-16 18:45:26,069 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 31 treesize of output 15 [2024-11-16 18:45:26,078 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 31 treesize of output 15 [2024-11-16 18:45:26,084 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 27 treesize of output 15 [2024-11-16 18:45:26,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-16 18:45:26,103 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-16 18:45:26,104 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:45:26,104 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:45:26,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [880515592] [2024-11-16 18:45:26,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [880515592] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:45:26,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:45:26,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:45:26,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151103273] [2024-11-16 18:45:26,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:45:26,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:45:26,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:45:26,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:45:26,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:45:26,105 INFO L87 Difference]: Start difference. First operand 619 states and 904 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-16 18:45:26,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:45:26,647 INFO L93 Difference]: Finished difference Result 1465 states and 2140 transitions. [2024-11-16 18:45:26,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:45:26,648 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 121 [2024-11-16 18:45:26,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:45:26,652 INFO L225 Difference]: With dead ends: 1465 [2024-11-16 18:45:26,652 INFO L226 Difference]: Without dead ends: 849 [2024-11-16 18:45:26,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-16 18:45:26,654 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 144 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 18:45:26,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 327 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 18:45:26,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2024-11-16 18:45:26,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 629. [2024-11-16 18:45:26,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 629 states, 572 states have (on average 1.444055944055944) internal successors, (826), 576 states have internal predecessors, (826), 44 states have call successors, (44), 12 states have call predecessors, (44), 12 states have return successors, (44), 40 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-16 18:45:26,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 914 transitions. [2024-11-16 18:45:26,692 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 914 transitions. Word has length 121 [2024-11-16 18:45:26,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:45:26,692 INFO L471 AbstractCegarLoop]: Abstraction has 629 states and 914 transitions. [2024-11-16 18:45:26,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-16 18:45:26,692 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 914 transitions. [2024-11-16 18:45:26,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-16 18:45:26,693 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:45:26,694 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:45:26,705 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 (8)] Forceful destruction successful, exit code 0 [2024-11-16 18:45:26,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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-16 18:45:26,895 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:45:26,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:45:26,896 INFO L85 PathProgramCache]: Analyzing trace with hash 752022863, now seen corresponding path program 1 times [2024-11-16 18:45:26,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:45:26,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [91652039] [2024-11-16 18:45:26,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:45:26,896 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-16 18:45:26,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:45:26,897 INFO L229 MonitoredProcess]: Starting monitored process 9 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-16 18:45:26,898 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 (9)] Waiting until timeout for monitored process [2024-11-16 18:45:27,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:45:27,111 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-16 18:45:27,115 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:45:27,120 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-16 18:45:27,122 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 14 treesize of output 10 [2024-11-16 18:45:27,152 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 25 treesize of output 24 [2024-11-16 18:45:27,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 55 [2024-11-16 18:45:27,313 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:45:27,313 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 86 treesize of output 67 [2024-11-16 18:45:27,448 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:45:27,448 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 99 treesize of output 74 [2024-11-16 18:45:27,537 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:45:27,538 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 94 treesize of output 79 [2024-11-16 18:45:27,649 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:45:27,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 101 treesize of output 53 [2024-11-16 18:45:27,776 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2024-11-16 18:45:27,777 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:45:27,777 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:45:27,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [91652039] [2024-11-16 18:45:27,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [91652039] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:45:27,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:45:27,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-16 18:45:27,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914484381] [2024-11-16 18:45:27,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:45:27,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-16 18:45:27,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:45:27,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-16 18:45:27,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-11-16 18:45:27,779 INFO L87 Difference]: Start difference. First operand 629 states and 914 transitions. Second operand has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-16 18:45:33,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:45:33,127 INFO L93 Difference]: Finished difference Result 1685 states and 2446 transitions. [2024-11-16 18:45:33,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-16 18:45:33,128 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 121 [2024-11-16 18:45:33,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:45:33,131 INFO L225 Difference]: With dead ends: 1685 [2024-11-16 18:45:33,132 INFO L226 Difference]: Without dead ends: 1059 [2024-11-16 18:45:33,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2024-11-16 18:45:33,134 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 522 mSDsluCounter, 1266 mSDsCounter, 0 mSdLazyCounter, 2388 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 1460 SdHoareTripleChecker+Invalid, 2429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 2388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2024-11-16 18:45:33,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 1460 Invalid, 2429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 2388 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2024-11-16 18:45:33,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2024-11-16 18:45:33,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 631. [2024-11-16 18:45:33,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 574 states have (on average 1.4459930313588851) internal successors, (830), 578 states have internal predecessors, (830), 44 states have call successors, (44), 12 states have call predecessors, (44), 12 states have return successors, (44), 40 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-16 18:45:33,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 918 transitions. [2024-11-16 18:45:33,168 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 918 transitions. Word has length 121 [2024-11-16 18:45:33,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:45:33,169 INFO L471 AbstractCegarLoop]: Abstraction has 631 states and 918 transitions. [2024-11-16 18:45:33,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-16 18:45:33,169 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 918 transitions. [2024-11-16 18:45:33,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-16 18:45:33,170 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:45:33,170 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:45:33,180 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 (9)] Ended with exit code 0 [2024-11-16 18:45:33,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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-16 18:45:33,371 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:45:33,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:45:33,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1529487981, now seen corresponding path program 1 times [2024-11-16 18:45:33,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:45:33,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1583758772] [2024-11-16 18:45:33,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:45:33,372 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-16 18:45:33,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:45:33,374 INFO L229 MonitoredProcess]: Starting monitored process 10 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-16 18:45:33,375 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 (10)] Waiting until timeout for monitored process [2024-11-16 18:45:33,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:45:33,618 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-16 18:45:33,621 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:45:33,630 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-16 18:45:33,642 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 32 treesize of output 16 [2024-11-16 18:45:33,645 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 32 treesize of output 16 [2024-11-16 18:45:33,652 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 32 treesize of output 16 [2024-11-16 18:45:33,656 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 28 treesize of output 16 [2024-11-16 18:45:33,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-16 18:45:34,453 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-16 18:45:34,453 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:45:34,453 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:45:34,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1583758772] [2024-11-16 18:45:34,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1583758772] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:45:34,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:45:34,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:45:34,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574381713] [2024-11-16 18:45:34,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:45:34,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:45:34,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:45:34,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:45:34,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:45:34,454 INFO L87 Difference]: Start difference. First operand 631 states and 918 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-16 18:45:36,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-16 18:45:39,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-16 18:45:43,177 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-16 18:45:44,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-16 18:45:46,303 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-16 18:45:47,681 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-16 18:45:49,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-16 18:45:51,319 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-16 18:45:53,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-16 18:45:53,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:45:53,370 INFO L93 Difference]: Finished difference Result 1272 states and 1843 transitions. [2024-11-16 18:45:53,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:45:53,371 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 121 [2024-11-16 18:45:53,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:45:53,373 INFO L225 Difference]: With dead ends: 1272 [2024-11-16 18:45:53,373 INFO L226 Difference]: Without dead ends: 644 [2024-11-16 18:45:53,374 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-16 18:45:53,374 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 142 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 10 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.9s IncrementalHoareTripleChecker+Time [2024-11-16 18:45:53,375 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 663 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 507 Invalid, 9 Unknown, 0 Unchecked, 18.9s Time] [2024-11-16 18:45:53,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2024-11-16 18:45:53,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 531. [2024-11-16 18:45:53,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 492 states have (on average 1.4593495934959348) internal successors, (718), 493 states have internal predecessors, (718), 28 states have call successors, (28), 10 states have call predecessors, (28), 10 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-16 18:45:53,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 774 transitions. [2024-11-16 18:45:53,405 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 774 transitions. Word has length 121 [2024-11-16 18:45:53,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:45:53,406 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 774 transitions. [2024-11-16 18:45:53,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-16 18:45:53,406 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 774 transitions. [2024-11-16 18:45:53,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-16 18:45:53,408 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:45:53,408 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:45:53,417 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 (10)] Ended with exit code 0 [2024-11-16 18:45:53,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /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-16 18:45:53,613 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:45:53,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:45:53,613 INFO L85 PathProgramCache]: Analyzing trace with hash -267463378, now seen corresponding path program 1 times [2024-11-16 18:45:53,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:45:53,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [200666063] [2024-11-16 18:45:53,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:45:53,613 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-16 18:45:53,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:45:53,615 INFO L229 MonitoredProcess]: Starting monitored process 11 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-16 18:45:53,615 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 (11)] Waiting until timeout for monitored process [2024-11-16 18:45:53,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:45:53,848 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-16 18:45:53,851 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:45:53,857 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-16 18:45:53,860 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 14 treesize of output 10 [2024-11-16 18:45:53,889 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 25 treesize of output 24 [2024-11-16 18:45:53,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 55 [2024-11-16 18:45:54,020 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:45:54,020 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 86 treesize of output 67 [2024-11-16 18:45:54,108 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:45:54,108 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 86 treesize of output 67 [2024-11-16 18:45:54,138 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:45:54,138 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 82 treesize of output 67 [2024-11-16 18:45:54,241 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:45:54,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 88 treesize of output 40 [2024-11-16 18:45:54,310 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2024-11-16 18:45:54,310 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:45:54,310 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:45:54,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [200666063] [2024-11-16 18:45:54,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [200666063] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:45:54,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:45:54,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-16 18:45:54,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636355641] [2024-11-16 18:45:54,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:45:54,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-16 18:45:54,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:45:54,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-16 18:45:54,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-11-16 18:45:54,311 INFO L87 Difference]: Start difference. First operand 531 states and 774 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-16 18:45:57,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:45:57,676 INFO L93 Difference]: Finished difference Result 1289 states and 1878 transitions. [2024-11-16 18:45:57,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 18:45:57,680 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 121 [2024-11-16 18:45:57,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:45:57,683 INFO L225 Difference]: With dead ends: 1289 [2024-11-16 18:45:57,683 INFO L226 Difference]: Without dead ends: 761 [2024-11-16 18:45:57,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 109 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2024-11-16 18:45:57,686 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 435 mSDsluCounter, 887 mSDsCounter, 0 mSdLazyCounter, 1943 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 1036 SdHoareTripleChecker+Invalid, 2005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-16 18:45:57,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 1036 Invalid, 2005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1943 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-16 18:45:57,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2024-11-16 18:45:57,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 644. [2024-11-16 18:45:57,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 605 states have (on average 1.4760330578512397) internal successors, (893), 606 states have internal predecessors, (893), 28 states have call successors, (28), 10 states have call predecessors, (28), 10 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-16 18:45:57,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 949 transitions. [2024-11-16 18:45:57,719 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 949 transitions. Word has length 121 [2024-11-16 18:45:57,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:45:57,720 INFO L471 AbstractCegarLoop]: Abstraction has 644 states and 949 transitions. [2024-11-16 18:45:57,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-16 18:45:57,720 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 949 transitions. [2024-11-16 18:45:57,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-16 18:45:57,722 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:45:57,722 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:45:57,733 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 (11)] Forceful destruction successful, exit code 0 [2024-11-16 18:45:57,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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-16 18:45:57,923 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:45:57,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:45:57,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1068156019, now seen corresponding path program 1 times [2024-11-16 18:45:57,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:45:57,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1518838105] [2024-11-16 18:45:57,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:45:57,924 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-16 18:45:57,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:45:57,925 INFO L229 MonitoredProcess]: Starting monitored process 12 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-16 18:45:57,926 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 (12)] Waiting until timeout for monitored process [2024-11-16 18:45:58,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:45:58,088 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 18:45:58,090 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:45:58,097 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-16 18:45:58,097 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:45:58,098 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:45:58,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1518838105] [2024-11-16 18:45:58,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1518838105] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:45:58,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:45:58,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 18:45:58,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260062085] [2024-11-16 18:45:58,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:45:58,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 18:45:58,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:45:58,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 18:45:58,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 18:45:58,099 INFO L87 Difference]: Start difference. First operand 644 states and 949 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-16 18:45:58,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:45:58,145 INFO L93 Difference]: Finished difference Result 1285 states and 1895 transitions. [2024-11-16 18:45:58,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 18:45:58,146 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 121 [2024-11-16 18:45:58,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:45:58,148 INFO L225 Difference]: With dead ends: 1285 [2024-11-16 18:45:58,148 INFO L226 Difference]: Without dead ends: 644 [2024-11-16 18:45:58,148 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 118 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-16 18:45:58,149 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 0 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:45:58,149 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 553 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:45:58,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2024-11-16 18:45:58,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 644. [2024-11-16 18:45:58,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 605 states have (on average 1.4743801652892563) internal successors, (892), 606 states have internal predecessors, (892), 28 states have call successors, (28), 10 states have call predecessors, (28), 10 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-16 18:45:58,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 948 transitions. [2024-11-16 18:45:58,177 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 948 transitions. Word has length 121 [2024-11-16 18:45:58,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:45:58,177 INFO L471 AbstractCegarLoop]: Abstraction has 644 states and 948 transitions. [2024-11-16 18:45:58,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-16 18:45:58,177 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 948 transitions. [2024-11-16 18:45:58,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-16 18:45:58,179 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:45:58,179 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:45:58,190 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 (12)] Forceful destruction successful, exit code 0 [2024-11-16 18:45:58,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /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-16 18:45:58,379 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:45:58,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:45:58,380 INFO L85 PathProgramCache]: Analyzing trace with hash 809398576, now seen corresponding path program 1 times [2024-11-16 18:45:58,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:45:58,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [93224971] [2024-11-16 18:45:58,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:45:58,380 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-16 18:45:58,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:45:58,383 INFO L229 MonitoredProcess]: Starting monitored process 13 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-16 18:45:58,383 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 (13)] Waiting until timeout for monitored process [2024-11-16 18:45:58,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:45:58,614 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-16 18:45:58,619 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:45:58,633 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-16 18:45:58,790 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 80 treesize of output 34 [2024-11-16 18:45:58,884 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 80 treesize of output 34 [2024-11-16 18:45:58,969 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 75 treesize of output 44 [2024-11-16 18:45:59,109 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:45:59,110 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 85 treesize of output 57 [2024-11-16 18:45:59,294 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:45:59,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 95 treesize of output 70 [2024-11-16 18:45:59,545 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:45:59,545 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 105 treesize of output 83 [2024-11-16 18:45:59,854 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:45:59,854 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 115 treesize of output 96 [2024-11-16 18:46:00,239 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:46:00,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 130 treesize of output 99 [2024-11-16 18:46:00,267 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:46:00,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 130 treesize of output 99 [2024-11-16 18:46:00,358 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:46:00,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 130 treesize of output 99 [2024-11-16 18:46:00,382 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:46:00,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 138 treesize of output 54 [2024-11-16 18:46:00,428 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 320 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-16 18:46:00,428 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:46:00,429 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:46:00,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [93224971] [2024-11-16 18:46:00,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [93224971] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:46:00,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:46:00,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-16 18:46:00,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130020035] [2024-11-16 18:46:00,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:46:00,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-16 18:46:00,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:46:00,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-16 18:46:00,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-16 18:46:00,430 INFO L87 Difference]: Start difference. First operand 644 states and 948 transitions. Second operand has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 12 states have internal predecessors, (71), 6 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2024-11-16 18:46:02,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:46:02,176 INFO L93 Difference]: Finished difference Result 1772 states and 2576 transitions. [2024-11-16 18:46:02,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-16 18:46:02,177 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 12 states have internal predecessors, (71), 6 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) Word has length 123 [2024-11-16 18:46:02,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:46:02,180 INFO L225 Difference]: With dead ends: 1772 [2024-11-16 18:46:02,180 INFO L226 Difference]: Without dead ends: 1131 [2024-11-16 18:46:02,181 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-11-16 18:46:02,181 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 437 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-16 18:46:02,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 545 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 926 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-16 18:46:02,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2024-11-16 18:46:02,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 852. [2024-11-16 18:46:02,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 852 states, 771 states have (on average 1.4254215304798963) internal successors, (1099), 773 states have internal predecessors, (1099), 56 states have call successors, (56), 24 states have call predecessors, (56), 24 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-16 18:46:02,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1211 transitions. [2024-11-16 18:46:02,241 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1211 transitions. Word has length 123 [2024-11-16 18:46:02,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:46:02,241 INFO L471 AbstractCegarLoop]: Abstraction has 852 states and 1211 transitions. [2024-11-16 18:46:02,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 12 states have internal predecessors, (71), 6 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2024-11-16 18:46:02,241 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1211 transitions. [2024-11-16 18:46:02,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-16 18:46:02,243 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:46:02,243 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:46:02,255 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 (13)] Forceful destruction successful, exit code 0 [2024-11-16 18:46:02,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /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-16 18:46:02,444 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:46:02,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:46:02,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1258868273, now seen corresponding path program 1 times [2024-11-16 18:46:02,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:46:02,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [505739958] [2024-11-16 18:46:02,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:46:02,445 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:46:02,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:46:02,446 INFO L229 MonitoredProcess]: Starting monitored process 14 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-16 18:46:02,446 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 (14)] Waiting until timeout for monitored process [2024-11-16 18:46:02,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:02,664 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-16 18:46:02,667 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:46:02,672 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-16 18:46:02,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2024-11-16 18:46:02,786 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:46:02,786 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 41 treesize of output 28 [2024-11-16 18:46:02,793 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:46:02,793 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 49 treesize of output 25 [2024-11-16 18:46:02,802 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 123 proven. 6 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-11-16 18:46:02,802 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 18:46:02,901 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 33 proven. 6 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-16 18:46:02,902 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:46:02,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [505739958] [2024-11-16 18:46:02,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [505739958] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 18:46:02,902 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 18:46:02,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2024-11-16 18:46:02,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479009658] [2024-11-16 18:46:02,902 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 18:46:02,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-16 18:46:02,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:46:02,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-16 18:46:02,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-16 18:46:02,903 INFO L87 Difference]: Start difference. First operand 852 states and 1211 transitions. Second operand has 11 states, 9 states have (on average 8.11111111111111) internal successors, (73), 11 states have internal predecessors, (73), 5 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (17), 3 states have call predecessors, (17), 5 states have call successors, (17) [2024-11-16 18:46:03,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:46:03,605 INFO L93 Difference]: Finished difference Result 1733 states and 2451 transitions. [2024-11-16 18:46:03,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-16 18:46:03,606 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 8.11111111111111) internal successors, (73), 11 states have internal predecessors, (73), 5 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (17), 3 states have call predecessors, (17), 5 states have call successors, (17) Word has length 123 [2024-11-16 18:46:03,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:46:03,609 INFO L225 Difference]: With dead ends: 1733 [2024-11-16 18:46:03,609 INFO L226 Difference]: Without dead ends: 884 [2024-11-16 18:46:03,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 234 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2024-11-16 18:46:03,610 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 414 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 18:46:03,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 299 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 643 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 18:46:03,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2024-11-16 18:46:03,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 852. [2024-11-16 18:46:03,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 852 states, 771 states have (on average 1.4150453955901428) internal successors, (1091), 773 states have internal predecessors, (1091), 56 states have call successors, (56), 24 states have call predecessors, (56), 24 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-16 18:46:03,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1203 transitions. [2024-11-16 18:46:03,672 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1203 transitions. Word has length 123 [2024-11-16 18:46:03,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:46:03,673 INFO L471 AbstractCegarLoop]: Abstraction has 852 states and 1203 transitions. [2024-11-16 18:46:03,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 8.11111111111111) internal successors, (73), 11 states have internal predecessors, (73), 5 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (17), 3 states have call predecessors, (17), 5 states have call successors, (17) [2024-11-16 18:46:03,673 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1203 transitions. [2024-11-16 18:46:03,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-16 18:46:03,674 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:46:03,675 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:46:03,682 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 (14)] Forceful destruction successful, exit code 0 [2024-11-16 18:46:03,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /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-16 18:46:03,879 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:46:03,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:46:03,879 INFO L85 PathProgramCache]: Analyzing trace with hash 14103792, now seen corresponding path program 1 times [2024-11-16 18:46:03,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:46:03,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [893361343] [2024-11-16 18:46:03,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:46:03,880 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-16 18:46:03,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:46:03,881 INFO L229 MonitoredProcess]: Starting monitored process 15 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-16 18:46:03,881 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 (15)] Waiting until timeout for monitored process [2024-11-16 18:46:04,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:04,113 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-16 18:46:04,117 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:46:04,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-16 18:46:04,121 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 14 treesize of output 10 [2024-11-16 18:46:04,145 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 25 treesize of output 24 [2024-11-16 18:46:04,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 50 [2024-11-16 18:46:04,302 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:46:04,303 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 74 treesize of output 61 [2024-11-16 18:46:04,357 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:46:04,357 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 74 treesize of output 61 [2024-11-16 18:46:04,397 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:46:04,398 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 70 treesize of output 61 [2024-11-16 18:46:04,500 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:46:04,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 35 [2024-11-16 18:46:04,575 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2024-11-16 18:46:04,575 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:46:04,575 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:46:04,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [893361343] [2024-11-16 18:46:04,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [893361343] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:46:04,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:46:04,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-16 18:46:04,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961031031] [2024-11-16 18:46:04,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:46:04,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-16 18:46:04,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:46:04,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-16 18:46:04,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-16 18:46:04,576 INFO L87 Difference]: Start difference. First operand 852 states and 1203 transitions. Second operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-16 18:46:07,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:46:07,690 INFO L93 Difference]: Finished difference Result 2001 states and 2814 transitions. [2024-11-16 18:46:07,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 18:46:07,690 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 123 [2024-11-16 18:46:07,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:46:07,694 INFO L225 Difference]: With dead ends: 2001 [2024-11-16 18:46:07,694 INFO L226 Difference]: Without dead ends: 1152 [2024-11-16 18:46:07,695 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 110 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-16 18:46:07,695 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 433 mSDsluCounter, 776 mSDsCounter, 0 mSdLazyCounter, 1682 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 1746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-16 18:46:07,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 924 Invalid, 1746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1682 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-16 18:46:07,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1152 states. [2024-11-16 18:46:07,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1152 to 844. [2024-11-16 18:46:07,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 844 states, 763 states have (on average 1.4115334207077326) internal successors, (1077), 765 states have internal predecessors, (1077), 56 states have call successors, (56), 24 states have call predecessors, (56), 24 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-16 18:46:07,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1189 transitions. [2024-11-16 18:46:07,764 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1189 transitions. Word has length 123 [2024-11-16 18:46:07,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:46:07,764 INFO L471 AbstractCegarLoop]: Abstraction has 844 states and 1189 transitions. [2024-11-16 18:46:07,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-16 18:46:07,765 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1189 transitions. [2024-11-16 18:46:07,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-16 18:46:07,766 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:46:07,766 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:46:07,777 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 (15)] Forceful destruction successful, exit code 0 [2024-11-16 18:46:07,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /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-16 18:46:07,967 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:46:07,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:46:07,967 INFO L85 PathProgramCache]: Analyzing trace with hash -829935029, now seen corresponding path program 1 times [2024-11-16 18:46:07,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:46:07,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [725136480] [2024-11-16 18:46:07,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:46:07,968 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-16 18:46:07,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:46:07,969 INFO L229 MonitoredProcess]: Starting monitored process 16 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-16 18:46:07,970 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 (16)] Waiting until timeout for monitored process [2024-11-16 18:46:08,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:08,191 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-16 18:46:08,194 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:46:08,197 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 14 treesize of output 10 [2024-11-16 18:46:08,272 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 41 treesize of output 19 [2024-11-16 18:46:08,338 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 41 treesize of output 19 [2024-11-16 18:46:08,356 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 41 treesize of output 19 [2024-11-16 18:46:08,386 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 43 treesize of output 30 [2024-11-16 18:46:08,427 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:46:08,428 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 38 treesize of output 29 [2024-11-16 18:46:08,454 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:46:08,455 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 33 treesize of output 15 [2024-11-16 18:46:08,470 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 173 proven. 6 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2024-11-16 18:46:08,471 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 18:46:08,640 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 33 proven. 6 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-16 18:46:08,640 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:46:08,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [725136480] [2024-11-16 18:46:08,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [725136480] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 18:46:08,641 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 18:46:08,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2024-11-16 18:46:08,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963567835] [2024-11-16 18:46:08,641 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 18:46:08,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-16 18:46:08,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:46:08,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-16 18:46:08,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2024-11-16 18:46:08,642 INFO L87 Difference]: Start difference. First operand 844 states and 1189 transitions. Second operand has 15 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 15 states have internal predecessors, (87), 6 states have call successors, (18), 3 states have call predecessors, (18), 5 states have return successors, (18), 4 states have call predecessors, (18), 6 states have call successors, (18) [2024-11-16 18:46:10,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:46:10,403 INFO L93 Difference]: Finished difference Result 2465 states and 3431 transitions. [2024-11-16 18:46:10,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-16 18:46:10,404 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 15 states have internal predecessors, (87), 6 states have call successors, (18), 3 states have call predecessors, (18), 5 states have return successors, (18), 4 states have call predecessors, (18), 6 states have call successors, (18) Word has length 123 [2024-11-16 18:46:10,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:46:10,408 INFO L225 Difference]: With dead ends: 2465 [2024-11-16 18:46:10,408 INFO L226 Difference]: Without dead ends: 1624 [2024-11-16 18:46:10,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 229 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=285, Invalid=837, Unknown=0, NotChecked=0, Total=1122 [2024-11-16 18:46:10,409 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 870 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 1140 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 891 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 1278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 1140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-16 18:46:10,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [891 Valid, 455 Invalid, 1278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 1140 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-16 18:46:10,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1624 states. [2024-11-16 18:46:10,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1624 to 997. [2024-11-16 18:46:10,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 997 states, 916 states have (on average 1.4312227074235808) internal successors, (1311), 918 states have internal predecessors, (1311), 56 states have call successors, (56), 24 states have call predecessors, (56), 24 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-16 18:46:10,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1423 transitions. [2024-11-16 18:46:10,479 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1423 transitions. Word has length 123 [2024-11-16 18:46:10,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:46:10,479 INFO L471 AbstractCegarLoop]: Abstraction has 997 states and 1423 transitions. [2024-11-16 18:46:10,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 15 states have internal predecessors, (87), 6 states have call successors, (18), 3 states have call predecessors, (18), 5 states have return successors, (18), 4 states have call predecessors, (18), 6 states have call successors, (18) [2024-11-16 18:46:10,479 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1423 transitions. [2024-11-16 18:46:10,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-16 18:46:10,481 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:46:10,481 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:46:10,489 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 (16)] Ended with exit code 0 [2024-11-16 18:46:10,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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-16 18:46:10,682 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:46:10,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:46:10,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1335493654, now seen corresponding path program 1 times [2024-11-16 18:46:10,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:46:10,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [202234628] [2024-11-16 18:46:10,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:46:10,683 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-16 18:46:10,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:46:10,684 INFO L229 MonitoredProcess]: Starting monitored process 17 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-16 18:46:10,684 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 (17)] Waiting until timeout for monitored process [2024-11-16 18:46:10,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:10,908 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-16 18:46:10,912 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:46:10,937 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 19 treesize of output 1 [2024-11-16 18:46:11,093 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 80 treesize of output 34 [2024-11-16 18:46:11,174 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 80 treesize of output 34 [2024-11-16 18:46:11,263 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 80 treesize of output 34 [2024-11-16 18:46:11,362 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 75 treesize of output 44 [2024-11-16 18:46:11,545 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:46:11,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 57 [2024-11-16 18:46:11,761 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:46:11,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 95 treesize of output 70 [2024-11-16 18:46:12,079 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:46:12,080 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 110 treesize of output 73 [2024-11-16 18:46:12,103 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:46:12,104 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 110 treesize of output 73 [2024-11-16 18:46:12,166 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:46:12,166 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 110 treesize of output 73 [2024-11-16 18:46:12,198 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:46:12,198 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 106 treesize of output 73 [2024-11-16 18:46:12,293 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:46:12,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 174 treesize of output 66 [2024-11-16 18:46:12,341 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 268 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-11-16 18:46:12,342 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:46:12,342 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:46:12,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [202234628] [2024-11-16 18:46:12,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [202234628] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:46:12,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:46:12,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-16 18:46:12,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816531725] [2024-11-16 18:46:12,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:46:12,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-16 18:46:12,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:46:12,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-16 18:46:12,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-16 18:46:12,343 INFO L87 Difference]: Start difference. First operand 997 states and 1423 transitions. Second operand has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 states have internal predecessors, (68), 5 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2024-11-16 18:46:14,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:46:14,076 INFO L93 Difference]: Finished difference Result 1985 states and 2832 transitions. [2024-11-16 18:46:14,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-16 18:46:14,077 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 states have internal predecessors, (68), 5 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 123 [2024-11-16 18:46:14,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:46:14,079 INFO L225 Difference]: With dead ends: 1985 [2024-11-16 18:46:14,079 INFO L226 Difference]: Without dead ends: 991 [2024-11-16 18:46:14,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2024-11-16 18:46:14,081 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 395 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 1047 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 1058 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-16 18:46:14,081 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 576 Invalid, 1058 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1047 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-16 18:46:14,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2024-11-16 18:46:14,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 908. [2024-11-16 18:46:14,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 827 states have (on average 1.4171704957678355) internal successors, (1172), 829 states have internal predecessors, (1172), 56 states have call successors, (56), 24 states have call predecessors, (56), 24 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-16 18:46:14,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1284 transitions. [2024-11-16 18:46:14,159 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1284 transitions. Word has length 123 [2024-11-16 18:46:14,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:46:14,159 INFO L471 AbstractCegarLoop]: Abstraction has 908 states and 1284 transitions. [2024-11-16 18:46:14,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 states have internal predecessors, (68), 5 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2024-11-16 18:46:14,159 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1284 transitions. [2024-11-16 18:46:14,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-16 18:46:14,161 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:46:14,161 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:46:14,170 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 (17)] Ended with exit code 0 [2024-11-16 18:46:14,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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-16 18:46:14,361 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:46:14,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:46:14,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1936585260, now seen corresponding path program 1 times [2024-11-16 18:46:14,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:46:14,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2033624266] [2024-11-16 18:46:14,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:46:14,362 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-16 18:46:14,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:46:14,363 INFO L229 MonitoredProcess]: Starting monitored process 18 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-16 18:46:14,364 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 (18)] Waiting until timeout for monitored process [2024-11-16 18:46:14,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:14,607 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-16 18:46:14,611 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:46:14,613 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-16 18:46:14,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2024-11-16 18:46:14,715 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:46:14,715 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 41 treesize of output 28 [2024-11-16 18:46:14,729 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:46:14,729 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 85 treesize of output 60 [2024-11-16 18:46:14,778 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:46:14,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 41 [2024-11-16 18:46:14,793 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:46:14,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 41 [2024-11-16 18:46:14,876 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:46:14,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 174 treesize of output 96 [2024-11-16 18:46:14,911 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 123 proven. 6 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-11-16 18:46:14,911 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 18:46:15,136 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-16 18:46:15,136 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:46:15,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2033624266] [2024-11-16 18:46:15,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2033624266] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-16 18:46:15,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 18:46:15,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 13 [2024-11-16 18:46:15,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863816674] [2024-11-16 18:46:15,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:46:15,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 18:46:15,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:46:15,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 18:46:15,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-11-16 18:46:15,137 INFO L87 Difference]: Start difference. First operand 908 states and 1284 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-16 18:46:15,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:46:15,774 INFO L93 Difference]: Finished difference Result 2183 states and 3067 transitions. [2024-11-16 18:46:15,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 18:46:15,774 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2024-11-16 18:46:15,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:46:15,777 INFO L225 Difference]: With dead ends: 2183 [2024-11-16 18:46:15,777 INFO L226 Difference]: Without dead ends: 1278 [2024-11-16 18:46:15,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2024-11-16 18:46:15,779 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 143 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 18:46:15,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 647 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 18:46:15,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1278 states. [2024-11-16 18:46:15,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1278 to 1067. [2024-11-16 18:46:15,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1067 states, 986 states have (on average 1.4300202839756593) internal successors, (1410), 988 states have internal predecessors, (1410), 56 states have call successors, (56), 24 states have call predecessors, (56), 24 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-16 18:46:15,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1067 states to 1067 states and 1522 transitions. [2024-11-16 18:46:15,862 INFO L78 Accepts]: Start accepts. Automaton has 1067 states and 1522 transitions. Word has length 123 [2024-11-16 18:46:15,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:46:15,862 INFO L471 AbstractCegarLoop]: Abstraction has 1067 states and 1522 transitions. [2024-11-16 18:46:15,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-16 18:46:15,862 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 1522 transitions. [2024-11-16 18:46:15,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-16 18:46:15,864 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:46:15,864 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:46:15,884 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 (18)] Ended with exit code 0 [2024-11-16 18:46:16,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /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-16 18:46:16,065 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:46:16,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:46:16,065 INFO L85 PathProgramCache]: Analyzing trace with hash -945743887, now seen corresponding path program 1 times [2024-11-16 18:46:16,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:46:16,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2133441733] [2024-11-16 18:46:16,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:46:16,066 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-16 18:46:16,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:46:16,067 INFO L229 MonitoredProcess]: Starting monitored process 19 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-16 18:46:16,067 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 (19)] Waiting until timeout for monitored process [2024-11-16 18:46:16,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:16,302 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-16 18:46:16,306 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:46:16,308 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-16 18:46:16,310 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 14 treesize of output 10 [2024-11-16 18:46:16,334 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 30 treesize of output 14 [2024-11-16 18:46:16,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2024-11-16 18:46:16,475 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:46:16,476 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 46 treesize of output 42 [2024-11-16 18:46:16,584 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:46:16,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 40 [2024-11-16 18:46:16,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 59 [2024-11-16 18:46:16,856 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:46:16,857 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 103 treesize of output 81 [2024-11-16 18:46:17,265 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 127 treesize of output 101 [2024-11-16 18:46:17,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:46:17,272 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:46:17,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 101 treesize of output 159 [2024-11-16 18:46:17,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 81 [2024-11-16 18:46:17,660 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:46:17,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 235 treesize of output 178 [2024-11-16 18:46:18,178 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:46:18,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 242 treesize of output 134 [2024-11-16 18:46:18,582 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 277 proven. 15 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-11-16 18:46:18,583 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 18:46:19,061 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-16 18:46:19,061 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:46:19,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2133441733] [2024-11-16 18:46:19,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2133441733] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-16 18:46:19,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 18:46:19,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [21] total 29 [2024-11-16 18:46:19,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803465297] [2024-11-16 18:46:19,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:46:19,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-16 18:46:19,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:46:19,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-16 18:46:19,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=657, Unknown=0, NotChecked=0, Total=812 [2024-11-16 18:46:19,064 INFO L87 Difference]: Start difference. First operand 1067 states and 1522 transitions. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-16 18:46:21,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:46:21,733 INFO L93 Difference]: Finished difference Result 2451 states and 3447 transitions. [2024-11-16 18:46:21,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-16 18:46:21,734 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2024-11-16 18:46:21,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:46:21,738 INFO L225 Difference]: With dead ends: 2451 [2024-11-16 18:46:21,738 INFO L226 Difference]: Without dead ends: 1387 [2024-11-16 18:46:21,739 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 216 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=226, Invalid=964, Unknown=0, NotChecked=0, Total=1190 [2024-11-16 18:46:21,739 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 525 mSDsluCounter, 1169 mSDsCounter, 0 mSdLazyCounter, 1546 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 1371 SdHoareTripleChecker+Invalid, 1628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-16 18:46:21,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 1371 Invalid, 1628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1546 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-16 18:46:21,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1387 states. [2024-11-16 18:46:21,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1387 to 1173. [2024-11-16 18:46:21,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1173 states, 1082 states have (on average 1.421441774491682) internal successors, (1538), 1088 states have internal predecessors, (1538), 62 states have call successors, (62), 28 states have call predecessors, (62), 28 states have return successors, (62), 56 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-16 18:46:21,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 1662 transitions. [2024-11-16 18:46:21,828 INFO L78 Accepts]: Start accepts. Automaton has 1173 states and 1662 transitions. Word has length 123 [2024-11-16 18:46:21,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:46:21,829 INFO L471 AbstractCegarLoop]: Abstraction has 1173 states and 1662 transitions. [2024-11-16 18:46:21,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-16 18:46:21,829 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1662 transitions. [2024-11-16 18:46:21,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-16 18:46:21,831 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:46:21,831 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:46:21,840 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 (19)] Forceful destruction successful, exit code 0 [2024-11-16 18:46:22,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /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-16 18:46:22,032 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:46:22,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:46:22,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1751827760, now seen corresponding path program 1 times [2024-11-16 18:46:22,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:46:22,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [724049984] [2024-11-16 18:46:22,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:46:22,033 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-16 18:46:22,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:46:22,035 INFO L229 MonitoredProcess]: Starting monitored process 20 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-16 18:46:22,036 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 (20)] Waiting until timeout for monitored process [2024-11-16 18:46:22,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:22,327 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-16 18:46:22,334 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:46:22,338 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-16 18:46:22,340 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 19 treesize of output 1 [2024-11-16 18:46:22,343 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 14 treesize of output 10 [2024-11-16 18:46:22,402 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:46:22,402 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 46 treesize of output 42 [2024-11-16 18:46:22,438 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:46:22,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 45 [2024-11-16 18:46:22,471 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:46:22,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 45 [2024-11-16 18:46:22,491 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:46:22,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 45 [2024-11-16 18:46:22,560 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:46:22,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 27 [2024-11-16 18:46:22,607 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2024-11-16 18:46:22,607 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:46:22,607 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:46:22,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [724049984] [2024-11-16 18:46:22,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [724049984] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:46:22,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:46:22,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 18:46:22,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464155254] [2024-11-16 18:46:22,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:46:22,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 18:46:22,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:46:22,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 18:46:22,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-16 18:46:22,609 INFO L87 Difference]: Start difference. First operand 1173 states and 1662 transitions. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-16 18:46:24,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:46:24,966 INFO L93 Difference]: Finished difference Result 2550 states and 3585 transitions. [2024-11-16 18:46:24,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 18:46:24,967 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 123 [2024-11-16 18:46:24,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:46:24,971 INFO L225 Difference]: With dead ends: 2550 [2024-11-16 18:46:24,971 INFO L226 Difference]: Without dead ends: 1380 [2024-11-16 18:46:24,972 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-11-16 18:46:24,972 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 298 mSDsluCounter, 776 mSDsCounter, 0 mSdLazyCounter, 1708 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 1735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-16 18:46:24,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 924 Invalid, 1735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1708 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-16 18:46:24,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2024-11-16 18:46:25,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 1171. [2024-11-16 18:46:25,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1171 states, 1080 states have (on average 1.4222222222222223) internal successors, (1536), 1086 states have internal predecessors, (1536), 62 states have call successors, (62), 28 states have call predecessors, (62), 28 states have return successors, (62), 56 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-16 18:46:25,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1171 states to 1171 states and 1660 transitions. [2024-11-16 18:46:25,074 INFO L78 Accepts]: Start accepts. Automaton has 1171 states and 1660 transitions. Word has length 123 [2024-11-16 18:46:25,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:46:25,075 INFO L471 AbstractCegarLoop]: Abstraction has 1171 states and 1660 transitions. [2024-11-16 18:46:25,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-16 18:46:25,075 INFO L276 IsEmpty]: Start isEmpty. Operand 1171 states and 1660 transitions. [2024-11-16 18:46:25,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-16 18:46:25,077 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:46:25,077 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:46:25,087 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 (20)] Ended with exit code 0 [2024-11-16 18:46:25,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /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-16 18:46:25,278 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:46:25,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:46:25,279 INFO L85 PathProgramCache]: Analyzing trace with hash 2095880881, now seen corresponding path program 1 times [2024-11-16 18:46:25,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:46:25,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1695602457] [2024-11-16 18:46:25,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:46:25,279 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-16 18:46:25,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:46:25,280 INFO L229 MonitoredProcess]: Starting monitored process 21 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-16 18:46:25,281 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 (21)] Waiting until timeout for monitored process [2024-11-16 18:46:25,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:25,473 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 18:46:25,475 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:46:25,483 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-16 18:46:25,483 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:46:25,483 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:46:25,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1695602457] [2024-11-16 18:46:25,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1695602457] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:46:25,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:46:25,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 18:46:25,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878369520] [2024-11-16 18:46:25,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:46:25,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 18:46:25,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:46:25,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 18:46:25,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 18:46:25,484 INFO L87 Difference]: Start difference. First operand 1171 states and 1660 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-16 18:46:25,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:46:25,596 INFO L93 Difference]: Finished difference Result 2339 states and 3317 transitions. [2024-11-16 18:46:25,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 18:46:25,597 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2024-11-16 18:46:25,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:46:25,600 INFO L225 Difference]: With dead ends: 2339 [2024-11-16 18:46:25,601 INFO L226 Difference]: Without dead ends: 1171 [2024-11-16 18:46:25,602 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 120 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-16 18:46:25,603 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 0 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:46:25,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 551 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:46:25,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2024-11-16 18:46:25,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 1171. [2024-11-16 18:46:25,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1171 states, 1080 states have (on average 1.4185185185185185) internal successors, (1532), 1086 states have internal predecessors, (1532), 62 states have call successors, (62), 28 states have call predecessors, (62), 28 states have return successors, (62), 56 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-16 18:46:25,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1171 states to 1171 states and 1656 transitions. [2024-11-16 18:46:25,703 INFO L78 Accepts]: Start accepts. Automaton has 1171 states and 1656 transitions. Word has length 123 [2024-11-16 18:46:25,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:46:25,703 INFO L471 AbstractCegarLoop]: Abstraction has 1171 states and 1656 transitions. [2024-11-16 18:46:25,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-16 18:46:25,703 INFO L276 IsEmpty]: Start isEmpty. Operand 1171 states and 1656 transitions. [2024-11-16 18:46:25,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-16 18:46:25,705 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:46:25,705 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:46:25,722 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 (21)] Ended with exit code 0 [2024-11-16 18:46:25,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /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-16 18:46:25,906 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:46:25,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:46:25,906 INFO L85 PathProgramCache]: Analyzing trace with hash 250710510, now seen corresponding path program 1 times [2024-11-16 18:46:25,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:46:25,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [560294930] [2024-11-16 18:46:25,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:46:25,907 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-16 18:46:25,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:46:25,908 INFO L229 MonitoredProcess]: Starting monitored process 22 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-16 18:46:25,908 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 (22)] Waiting until timeout for monitored process [2024-11-16 18:46:26,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:26,161 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-16 18:46:26,166 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:46:26,168 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-16 18:46:26,169 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 19 treesize of output 1 [2024-11-16 18:46:26,171 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 14 treesize of output 10 [2024-11-16 18:46:26,195 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 25 treesize of output 24 [2024-11-16 18:46:26,248 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:46:26,249 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 35 treesize of output 37 [2024-11-16 18:46:26,331 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:46:26,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 40 [2024-11-16 18:46:26,408 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:46:26,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 50 [2024-11-16 18:46:26,516 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:46:26,516 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 55 treesize of output 63 [2024-11-16 18:46:26,694 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:46:26,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 70 treesize of output 66 [2024-11-16 18:46:26,709 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:46:26,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 70 treesize of output 66 [2024-11-16 18:46:26,748 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:46:26,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 70 treesize of output 66 [2024-11-16 18:46:26,893 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:46:26,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 95 treesize of output 86 [2024-11-16 18:46:26,915 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:46:26,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 107 treesize of output 41 [2024-11-16 18:46:26,943 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 320 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-16 18:46:26,943 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:46:26,944 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:46:26,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [560294930] [2024-11-16 18:46:26,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [560294930] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:46:26,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:46:26,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 18:46:26,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592195101] [2024-11-16 18:46:26,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:46:26,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 18:46:26,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:46:26,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 18:46:26,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2024-11-16 18:46:26,952 INFO L87 Difference]: Start difference. First operand 1171 states and 1656 transitions. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 6 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2024-11-16 18:46:28,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:46:28,653 INFO L93 Difference]: Finished difference Result 2694 states and 3827 transitions. [2024-11-16 18:46:28,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 18:46:28,653 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 6 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) Word has length 125 [2024-11-16 18:46:28,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:46:28,657 INFO L225 Difference]: With dead ends: 2694 [2024-11-16 18:46:28,657 INFO L226 Difference]: Without dead ends: 1526 [2024-11-16 18:46:28,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-11-16 18:46:28,659 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 383 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-16 18:46:28,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 352 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-16 18:46:28,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1526 states. [2024-11-16 18:46:28,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1526 to 1171. [2024-11-16 18:46:28,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1171 states, 1080 states have (on average 1.4055555555555554) internal successors, (1518), 1086 states have internal predecessors, (1518), 62 states have call successors, (62), 28 states have call predecessors, (62), 28 states have return successors, (62), 56 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-16 18:46:28,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1171 states to 1171 states and 1642 transitions. [2024-11-16 18:46:28,772 INFO L78 Accepts]: Start accepts. Automaton has 1171 states and 1642 transitions. Word has length 125 [2024-11-16 18:46:28,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:46:28,772 INFO L471 AbstractCegarLoop]: Abstraction has 1171 states and 1642 transitions. [2024-11-16 18:46:28,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 6 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2024-11-16 18:46:28,773 INFO L276 IsEmpty]: Start isEmpty. Operand 1171 states and 1642 transitions. [2024-11-16 18:46:28,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-16 18:46:28,774 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:46:28,774 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:46:28,783 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 (22)] Forceful destruction successful, exit code 0 [2024-11-16 18:46:28,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /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-16 18:46:28,978 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:46:28,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:46:28,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1878374868, now seen corresponding path program 1 times [2024-11-16 18:46:28,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:46:28,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1891567566] [2024-11-16 18:46:28,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:46:28,979 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-16 18:46:28,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:46:28,980 INFO L229 MonitoredProcess]: Starting monitored process 23 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-16 18:46:28,982 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 (23)] Waiting until timeout for monitored process [2024-11-16 18:46:29,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:29,216 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-16 18:46:29,220 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:46:29,239 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-16 18:46:29,406 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 80 treesize of output 34 [2024-11-16 18:46:29,485 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 75 treesize of output 44 [2024-11-16 18:46:29,621 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:46:29,621 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 85 treesize of output 57 [2024-11-16 18:46:29,797 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:46:29,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 95 treesize of output 70 [2024-11-16 18:46:30,016 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:46:30,016 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 105 treesize of output 83 [2024-11-16 18:46:30,284 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:46:30,285 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 115 treesize of output 96 [2024-11-16 18:46:30,599 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:46:30,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 125 treesize of output 109 [2024-11-16 18:46:31,017 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:46:31,018 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 140 treesize of output 112 [2024-11-16 18:46:31,053 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:46:31,054 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 140 treesize of output 112 [2024-11-16 18:46:31,171 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:46:31,171 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 140 treesize of output 112 [2024-11-16 18:46:31,222 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:46:31,222 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 136 treesize of output 112 [2024-11-16 18:46:31,253 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:46:31,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 148 treesize of output 58 [2024-11-16 18:46:31,303 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 336 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-16 18:46:31,303 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:46:31,303 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:46:31,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1891567566] [2024-11-16 18:46:31,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1891567566] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:46:31,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:46:31,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-16 18:46:31,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442918419] [2024-11-16 18:46:31,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:46:31,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-16 18:46:31,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:46:31,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-16 18:46:31,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2024-11-16 18:46:31,305 INFO L87 Difference]: Start difference. First operand 1171 states and 1642 transitions. Second operand has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 13 states have internal predecessors, (76), 7 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14)