./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-65.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-65.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 2dc4b4561b119f2d441fb605148029621181083992b9a4c5c6ca30ee08fd9eac --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 18:47:13,415 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 18:47:13,491 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 18:47:13,497 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 18:47:13,505 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 18:47:13,536 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 18:47:13,536 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 18:47:13,537 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 18:47:13,538 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 18:47:13,539 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 18:47:13,539 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 18:47:13,539 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 18:47:13,540 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 18:47:13,542 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 18:47:13,542 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 18:47:13,543 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 18:47:13,543 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 18:47:13,543 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 18:47:13,543 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 18:47:13,544 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 18:47:13,544 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 18:47:13,547 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 18:47:13,548 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 18:47:13,548 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 18:47:13,548 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 18:47:13,548 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 18:47:13,548 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 18:47:13,548 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 18:47:13,549 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 18:47:13,549 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 18:47:13,549 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 18:47:13,549 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 18:47:13,549 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:47:13,550 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 18:47:13,550 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 18:47:13,550 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 18:47:13,550 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 18:47:13,551 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 18:47:13,551 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 18:47:13,551 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 18:47:13,553 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 18:47:13,553 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 18:47:13,553 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 -> 2dc4b4561b119f2d441fb605148029621181083992b9a4c5c6ca30ee08fd9eac [2024-11-16 18:47:13,779 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 18:47:13,799 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 18:47:13,802 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 18:47:13,802 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 18:47:13,803 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 18:47:13,804 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-65.i [2024-11-16 18:47:15,181 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 18:47:15,440 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 18:47:15,441 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-65.i [2024-11-16 18:47:15,452 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64a2023e8/436ca54d88774118ae1b6a6f05719192/FLAG175c490ae [2024-11-16 18:47:15,470 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64a2023e8/436ca54d88774118ae1b6a6f05719192 [2024-11-16 18:47:15,474 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 18:47:15,475 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 18:47:15,478 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 18:47:15,478 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 18:47:15,484 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 18:47:15,485 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:47:15" (1/1) ... [2024-11-16 18:47:15,486 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f421ebb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:47:15, skipping insertion in model container [2024-11-16 18:47:15,486 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:47:15" (1/1) ... [2024-11-16 18:47:15,516 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 18:47:15,708 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-65.i[916,929] [2024-11-16 18:47:15,762 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:47:15,771 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 18:47:15,785 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-65.i[916,929] [2024-11-16 18:47:15,815 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:47:15,845 INFO L204 MainTranslator]: Completed translation [2024-11-16 18:47:15,848 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:47:15 WrapperNode [2024-11-16 18:47:15,848 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 18:47:15,850 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 18:47:15,850 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 18:47:15,850 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 18:47:15,858 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:47:15" (1/1) ... [2024-11-16 18:47:15,875 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:47:15" (1/1) ... [2024-11-16 18:47:15,925 INFO L138 Inliner]: procedures = 30, calls = 146, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 481 [2024-11-16 18:47:15,929 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 18:47:15,930 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 18:47:15,930 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 18:47:15,930 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 18:47:15,941 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:47:15" (1/1) ... [2024-11-16 18:47:15,941 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:47:15" (1/1) ... [2024-11-16 18:47:15,947 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:47:15" (1/1) ... [2024-11-16 18:47:15,955 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-16 18:47:15,955 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:47:15" (1/1) ... [2024-11-16 18:47:15,956 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:47:15" (1/1) ... [2024-11-16 18:47:15,972 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:47:15" (1/1) ... [2024-11-16 18:47:15,973 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:47:15" (1/1) ... [2024-11-16 18:47:15,975 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:47:15" (1/1) ... [2024-11-16 18:47:15,977 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:47:15" (1/1) ... [2024-11-16 18:47:15,982 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 18:47:15,983 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 18:47:15,983 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 18:47:15,983 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 18:47:15,984 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:47:15" (1/1) ... [2024-11-16 18:47:15,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:47:16,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 18:47:16,043 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:47:16,046 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:47:16,093 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 18:47:16,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-16 18:47:16,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-16 18:47:16,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-16 18:47:16,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-16 18:47:16,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-16 18:47:16,095 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-16 18:47:16,095 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 18:47:16,096 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 18:47:16,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-16 18:47:16,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 18:47:16,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 18:47:16,231 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 18:47:16,233 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 18:47:16,734 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L107: havoc property_#t~ite98#1;havoc property_#t~mem86#1;havoc property_#t~ite92#1;havoc property_#t~mem91#1;havoc property_#t~mem87#1;havoc property_#t~ite90#1;havoc property_#t~mem88#1;havoc property_#t~mem89#1;havoc property_#t~mem97#1;havoc property_#t~mem93#1;havoc property_#t~ite96#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~ite107#1;havoc property_#t~mem106#1;havoc property_#t~mem101#1;havoc property_#t~ite103#1;havoc property_#t~mem102#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~short108#1;havoc property_#t~mem109#1;havoc property_#t~ite126#1;havoc property_#t~mem112#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~ite118#1;havoc property_#t~mem117#1;havoc property_#t~mem113#1;havoc property_#t~ite115#1;havoc property_#t~mem114#1;havoc property_#t~mem116#1;havoc property_#t~mem119#1;havoc property_#t~mem120#1;havoc property_#t~ite125#1;havoc property_#t~mem124#1;havoc property_#t~mem123#1;havoc property_#t~mem121#1;havoc property_#t~mem122#1;havoc property_#t~short127#1;havoc property_#t~mem129#1;havoc property_#t~mem128#1;havoc property_#t~short130#1;havoc property_#t~mem132#1;havoc property_#t~mem131#1;havoc property_#t~short133#1;havoc property_#t~mem135#1;havoc property_#t~mem134#1;havoc property_#t~short136#1; [2024-11-16 18:47:16,820 INFO L? ?]: Removed 117 outVars from TransFormulas that were not future-live. [2024-11-16 18:47:16,820 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 18:47:16,857 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 18:47:16,858 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 18:47:16,859 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:47:16 BoogieIcfgContainer [2024-11-16 18:47:16,859 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 18:47:16,862 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 18:47:16,863 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 18:47:16,866 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 18:47:16,867 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 06:47:15" (1/3) ... [2024-11-16 18:47:16,868 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ffab62d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:47:16, skipping insertion in model container [2024-11-16 18:47:16,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:47:15" (2/3) ... [2024-11-16 18:47:16,869 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ffab62d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:47:16, skipping insertion in model container [2024-11-16 18:47:16,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:47:16" (3/3) ... [2024-11-16 18:47:16,871 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-65.i [2024-11-16 18:47:16,890 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 18:47:16,891 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 18:47:16,959 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 18:47:16,966 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;@5c59e0cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 18:47:16,967 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 18:47:16,972 INFO L276 IsEmpty]: Start isEmpty. Operand has 116 states, 102 states have (on average 1.4411764705882353) internal successors, (147), 103 states have internal predecessors, (147), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-16 18:47:16,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-16 18:47:16,985 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:47:16,986 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:16,986 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:47:16,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:47:16,991 INFO L85 PathProgramCache]: Analyzing trace with hash 698350304, now seen corresponding path program 1 times [2024-11-16 18:47:16,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:47:16,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393051058] [2024-11-16 18:47:16,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:47:16,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:47:17,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:17,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:47:17,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:17,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:47:17,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:17,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-16 18:47:17,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:17,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:47:17,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:17,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 18:47:17,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:17,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:47:17,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:17,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:47:17,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:17,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:47:17,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:17,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 18:47:17,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:17,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 18:47:17,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:17,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-16 18:47:17,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:17,407 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-16 18:47:17,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:47:17,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393051058] [2024-11-16 18:47:17,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393051058] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:47:17,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:47:17,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 18:47:17,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326656732] [2024-11-16 18:47:17,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:47:17,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 18:47:17,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:47:17,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 18:47:17,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 18:47:17,449 INFO L87 Difference]: Start difference. First operand has 116 states, 102 states have (on average 1.4411764705882353) internal successors, (147), 103 states have internal predecessors, (147), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-16 18:47:17,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:47:17,483 INFO L93 Difference]: Finished difference Result 224 states and 342 transitions. [2024-11-16 18:47:17,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 18:47:17,485 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 114 [2024-11-16 18:47:17,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:47:17,493 INFO L225 Difference]: With dead ends: 224 [2024-11-16 18:47:17,493 INFO L226 Difference]: Without dead ends: 111 [2024-11-16 18:47:17,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 35 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:47:17,500 INFO L432 NwaCegarLoop]: 159 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, 159 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:47:17,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:47:17,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-16 18:47:17,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-16 18:47:17,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 98 states have (on average 1.3979591836734695) internal successors, (137), 98 states have internal predecessors, (137), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-16 18:47:17,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 159 transitions. [2024-11-16 18:47:17,540 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 159 transitions. Word has length 114 [2024-11-16 18:47:17,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:47:17,541 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 159 transitions. [2024-11-16 18:47:17,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-16 18:47:17,541 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 159 transitions. [2024-11-16 18:47:17,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-16 18:47:17,544 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:47:17,544 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:17,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 18:47:17,544 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:47:17,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:47:17,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1064153117, now seen corresponding path program 1 times [2024-11-16 18:47:17,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:47:17,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401110155] [2024-11-16 18:47:17,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:47:17,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:47:17,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:17,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:47:17,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:17,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:47:17,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:17,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-16 18:47:17,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:17,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:47:17,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:17,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 18:47:17,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:17,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:47:17,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:17,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:47:17,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:17,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:47:17,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:17,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 18:47:17,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:17,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 18:47:17,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:17,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-16 18:47:17,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:17,902 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-16 18:47:17,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:47:17,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401110155] [2024-11-16 18:47:17,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401110155] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:47:17,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:47:17,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 18:47:17,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12730708] [2024-11-16 18:47:17,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:47:17,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 18:47:17,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:47:17,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 18:47:17,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 18:47:17,911 INFO L87 Difference]: Start difference. First operand 111 states and 159 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-16 18:47:17,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:47:17,976 INFO L93 Difference]: Finished difference Result 221 states and 318 transitions. [2024-11-16 18:47:17,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 18:47:17,977 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 114 [2024-11-16 18:47:17,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:47:17,979 INFO L225 Difference]: With dead ends: 221 [2024-11-16 18:47:17,981 INFO L226 Difference]: Without dead ends: 113 [2024-11-16 18:47:17,982 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 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:47:17,984 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:47:17,985 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 460 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:47:17,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-16 18:47:17,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-11-16 18:47:17,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 100 states have (on average 1.39) internal successors, (139), 100 states have internal predecessors, (139), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-16 18:47:17,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 161 transitions. [2024-11-16 18:47:18,001 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 161 transitions. Word has length 114 [2024-11-16 18:47:18,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:47:18,003 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 161 transitions. [2024-11-16 18:47:18,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-16 18:47:18,003 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 161 transitions. [2024-11-16 18:47:18,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-16 18:47:18,008 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:47:18,008 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:18,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 18:47:18,009 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:47:18,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:47:18,010 INFO L85 PathProgramCache]: Analyzing trace with hash -535787516, now seen corresponding path program 1 times [2024-11-16 18:47:18,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:47:18,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333772713] [2024-11-16 18:47:18,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:47:18,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:47:18,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:18,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:47:18,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:18,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:47:18,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:18,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-16 18:47:18,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:18,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:47:18,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:18,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 18:47:18,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:18,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:47:18,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:18,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:47:18,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:18,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:47:18,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:18,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 18:47:18,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:18,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 18:47:18,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:18,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-16 18:47:18,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:18,388 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-16 18:47:18,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:47:18,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333772713] [2024-11-16 18:47:18,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333772713] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:47:18,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:47:18,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:47:18,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143582814] [2024-11-16 18:47:18,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:47:18,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:47:18,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:47:18,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:47:18,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:47:18,391 INFO L87 Difference]: Start difference. First operand 113 states and 161 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:47:18,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:47:18,451 INFO L93 Difference]: Finished difference Result 226 states and 323 transitions. [2024-11-16 18:47:18,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:47:18,452 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 114 [2024-11-16 18:47:18,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:47:18,454 INFO L225 Difference]: With dead ends: 226 [2024-11-16 18:47:18,454 INFO L226 Difference]: Without dead ends: 116 [2024-11-16 18:47:18,455 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:47:18,456 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 0 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:47:18,456 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 609 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:47:18,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-16 18:47:18,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-11-16 18:47:18,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 103 states have (on average 1.3786407766990292) internal successors, (142), 103 states have internal predecessors, (142), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-16 18:47:18,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 164 transitions. [2024-11-16 18:47:18,468 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 164 transitions. Word has length 114 [2024-11-16 18:47:18,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:47:18,469 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 164 transitions. [2024-11-16 18:47:18,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:47:18,469 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 164 transitions. [2024-11-16 18:47:18,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-16 18:47:18,471 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:47:18,471 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:18,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 18:47:18,472 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:47:18,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:47:18,472 INFO L85 PathProgramCache]: Analyzing trace with hash 257080220, now seen corresponding path program 1 times [2024-11-16 18:47:18,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:47:18,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450097383] [2024-11-16 18:47:18,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:47:18,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:47:18,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:18,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:47:18,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:18,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:47:18,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:18,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-16 18:47:18,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:18,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:47:18,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:18,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 18:47:18,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:18,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:47:18,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:18,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:47:18,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:18,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:47:18,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:18,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 18:47:18,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:18,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 18:47:18,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:18,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-16 18:47:18,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:18,656 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-16 18:47:18,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:47:18,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450097383] [2024-11-16 18:47:18,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450097383] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:47:18,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:47:18,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 18:47:18,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599948649] [2024-11-16 18:47:18,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:47:18,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 18:47:18,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:47:18,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 18:47:18,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 18:47:18,661 INFO L87 Difference]: Start difference. First operand 116 states and 164 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:47:18,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:47:18,693 INFO L93 Difference]: Finished difference Result 232 states and 329 transitions. [2024-11-16 18:47:18,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 18:47:18,694 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 114 [2024-11-16 18:47:18,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:47:18,696 INFO L225 Difference]: With dead ends: 232 [2024-11-16 18:47:18,696 INFO L226 Difference]: Without dead ends: 119 [2024-11-16 18:47:18,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 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:47:18,697 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 1 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:47:18,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 457 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:47:18,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-16 18:47:18,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2024-11-16 18:47:18,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 105 states have (on average 1.3714285714285714) internal successors, (144), 105 states have internal predecessors, (144), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-16 18:47:18,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 166 transitions. [2024-11-16 18:47:18,705 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 166 transitions. Word has length 114 [2024-11-16 18:47:18,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:47:18,706 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 166 transitions. [2024-11-16 18:47:18,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:47:18,706 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 166 transitions. [2024-11-16 18:47:18,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-16 18:47:18,708 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:47:18,708 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:18,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 18:47:18,708 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:47:18,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:47:18,709 INFO L85 PathProgramCache]: Analyzing trace with hash 60566715, now seen corresponding path program 1 times [2024-11-16 18:47:18,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:47:18,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884449665] [2024-11-16 18:47:18,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:47:18,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:47:18,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:18,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:47:18,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:18,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:47:18,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:18,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-16 18:47:18,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:18,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:47:18,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:18,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 18:47:18,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:18,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:47:18,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:18,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:47:18,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:18,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:47:18,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:18,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 18:47:18,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:18,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 18:47:18,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:18,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-16 18:47:18,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:18,887 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-16 18:47:18,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:47:18,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884449665] [2024-11-16 18:47:18,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884449665] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:47:18,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:47:18,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 18:47:18,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249596599] [2024-11-16 18:47:18,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:47:18,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 18:47:18,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:47:18,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 18:47:18,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 18:47:18,889 INFO L87 Difference]: Start difference. First operand 118 states and 166 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:47:18,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:47:18,919 INFO L93 Difference]: Finished difference Result 236 states and 333 transitions. [2024-11-16 18:47:18,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 18:47:18,921 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 114 [2024-11-16 18:47:18,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:47:18,924 INFO L225 Difference]: With dead ends: 236 [2024-11-16 18:47:18,924 INFO L226 Difference]: Without dead ends: 121 [2024-11-16 18:47:18,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 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:47:18,925 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 1 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:47:18,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 458 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:47:18,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-16 18:47:18,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2024-11-16 18:47:18,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 107 states have (on average 1.3644859813084111) internal successors, (146), 107 states have internal predecessors, (146), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-16 18:47:18,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 168 transitions. [2024-11-16 18:47:18,940 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 168 transitions. Word has length 114 [2024-11-16 18:47:18,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:47:18,941 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 168 transitions. [2024-11-16 18:47:18,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:47:18,942 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 168 transitions. [2024-11-16 18:47:18,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-16 18:47:18,943 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:47:18,945 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:18,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 18:47:18,945 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:47:18,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:47:18,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1803377050, now seen corresponding path program 1 times [2024-11-16 18:47:18,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:47:18,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163194771] [2024-11-16 18:47:18,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:47:18,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:47:19,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:20,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:47:20,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:20,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:47:20,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:20,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-16 18:47:20,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:20,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:47:20,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:20,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 18:47:20,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:20,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:47:20,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:20,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:47:20,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:20,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:47:20,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:20,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 18:47:20,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:20,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 18:47:20,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:20,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-16 18:47:20,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:20,151 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-16 18:47:20,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:47:20,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163194771] [2024-11-16 18:47:20,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163194771] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:47:20,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:47:20,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 18:47:20,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052108690] [2024-11-16 18:47:20,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:47:20,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 18:47:20,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:47:20,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 18:47:20,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 18:47:20,157 INFO L87 Difference]: Start difference. First operand 120 states and 168 transitions. Second operand has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-16 18:47:20,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:47:20,669 INFO L93 Difference]: Finished difference Result 291 states and 404 transitions. [2024-11-16 18:47:20,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 18:47:20,670 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 114 [2024-11-16 18:47:20,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:47:20,672 INFO L225 Difference]: With dead ends: 291 [2024-11-16 18:47:20,672 INFO L226 Difference]: Without dead ends: 174 [2024-11-16 18:47:20,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 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:47:20,673 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 59 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 18:47:20,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 514 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 18:47:20,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-16 18:47:20,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 122. [2024-11-16 18:47:20,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 109 states have (on average 1.3577981651376148) internal successors, (148), 109 states have internal predecessors, (148), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-16 18:47:20,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 170 transitions. [2024-11-16 18:47:20,693 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 170 transitions. Word has length 114 [2024-11-16 18:47:20,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:47:20,693 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 170 transitions. [2024-11-16 18:47:20,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-16 18:47:20,693 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 170 transitions. [2024-11-16 18:47:20,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-16 18:47:20,695 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:47:20,695 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:20,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 18:47:20,697 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:47:20,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:47:20,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1461557915, now seen corresponding path program 1 times [2024-11-16 18:47:20,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:47:20,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494264921] [2024-11-16 18:47:20,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:47:20,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:47:20,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 18:47:20,767 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 18:47:20,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 18:47:20,854 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 18:47:20,855 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 18:47:20,856 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 18:47:20,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 18:47:20,860 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:47:20,931 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 18:47:20,934 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 06:47:20 BoogieIcfgContainer [2024-11-16 18:47:20,934 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 18:47:20,935 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 18:47:20,935 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 18:47:20,935 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 18:47:20,936 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:47:16" (3/4) ... [2024-11-16 18:47:20,938 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 18:47:20,939 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 18:47:20,940 INFO L158 Benchmark]: Toolchain (without parser) took 5464.40ms. Allocated memory was 155.2MB in the beginning and 243.3MB in the end (delta: 88.1MB). Free memory was 126.2MB in the beginning and 115.6MB in the end (delta: 10.6MB). Peak memory consumption was 98.1MB. Max. memory is 16.1GB. [2024-11-16 18:47:20,942 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 125.8MB. Free memory is still 89.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 18:47:20,943 INFO L158 Benchmark]: CACSL2BoogieTranslator took 371.19ms. Allocated memory is still 155.2MB. Free memory was 126.2MB in the beginning and 108.1MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-16 18:47:20,943 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.93ms. Allocated memory is still 155.2MB. Free memory was 108.1MB in the beginning and 104.7MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 18:47:20,945 INFO L158 Benchmark]: Boogie Preprocessor took 52.17ms. Allocated memory is still 155.2MB. Free memory was 104.7MB in the beginning and 101.2MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 18:47:20,945 INFO L158 Benchmark]: IcfgBuilder took 876.56ms. Allocated memory is still 155.2MB. Free memory was 101.2MB in the beginning and 119.6MB in the end (delta: -18.4MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-11-16 18:47:20,945 INFO L158 Benchmark]: TraceAbstraction took 4072.87ms. Allocated memory was 155.2MB in the beginning and 243.3MB in the end (delta: 88.1MB). Free memory was 118.8MB in the beginning and 116.6MB in the end (delta: 2.1MB). Peak memory consumption was 91.2MB. Max. memory is 16.1GB. [2024-11-16 18:47:20,946 INFO L158 Benchmark]: Witness Printer took 4.25ms. Allocated memory is still 243.3MB. Free memory was 116.6MB in the beginning and 115.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 18:47:20,947 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.09ms. Allocated memory is still 125.8MB. Free memory is still 89.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 371.19ms. Allocated memory is still 155.2MB. Free memory was 126.2MB in the beginning and 108.1MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.93ms. Allocated memory is still 155.2MB. Free memory was 108.1MB in the beginning and 104.7MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.17ms. Allocated memory is still 155.2MB. Free memory was 104.7MB in the beginning and 101.2MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 876.56ms. Allocated memory is still 155.2MB. Free memory was 101.2MB in the beginning and 119.6MB in the end (delta: -18.4MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 4072.87ms. Allocated memory was 155.2MB in the beginning and 243.3MB in the end (delta: 88.1MB). Free memory was 118.8MB in the beginning and 116.6MB in the end (delta: 2.1MB). Peak memory consumption was 91.2MB. Max. memory is 16.1GB. * Witness Printer took 4.25ms. Allocated memory is still 243.3MB. Free memory was 116.6MB in the beginning and 115.6MB 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 107, overapproximation of someBinaryArithmeticDOUBLEoperation at line 75, overapproximation of someBinaryDOUBLEComparisonOperation at line 107, overapproximation of someUnaryFLOAToperation at line 107. Possible FailurePath: [L38] unsigned char isInitial = 0; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 1000000000.1, 1, 8.2, -32, 100.5, 25.25, 63.6, 0.0, 0.8, -8, 8, 2, 50, 0 }; [L55] double last_1_WrapperStruct00_var_1_9 = 100.5; VAL [WrapperStruct00={4:0}, isInitial=0, last_1_WrapperStruct00_var_1_9=201/2] [L111] isInitial = 1 [L112] FCALL initially() [L113] COND TRUE 1 [L114] CALL updateLastVariables() [L104] EXPR WrapperStruct00.var_1_9 [L104] last_1_WrapperStruct00_var_1_9 = WrapperStruct00.var_1_9 [L114] RET updateLastVariables() [L115] CALL updateVariables() [L83] WrapperStruct00.var_1_3 = __VERIFIER_nondet_uchar() [L84] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L84] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L84] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L85] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L85] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L85] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L86] WrapperStruct00.var_1_4 = __VERIFIER_nondet_float() [L87] EXPR WrapperStruct00.var_1_4 [L87] EXPR WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F [L87] EXPR WrapperStruct00.var_1_4 [L87] EXPR WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L87] EXPR (WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L87] CALL assume_abort_if_not((WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L87] RET assume_abort_if_not((WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L88] WrapperStruct00.var_1_12 = __VERIFIER_nondet_double() [L89] EXPR WrapperStruct00.var_1_12 [L89] EXPR WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F [L89] EXPR WrapperStruct00.var_1_12 [L89] EXPR WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L89] EXPR (WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L89] CALL assume_abort_if_not((WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L89] RET assume_abort_if_not((WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L90] WrapperStruct00.var_1_13 = __VERIFIER_nondet_double() [L91] EXPR WrapperStruct00.var_1_13 [L91] EXPR WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F [L91] EXPR WrapperStruct00.var_1_13 [L91] EXPR WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L91] EXPR (WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L91] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L91] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L92] WrapperStruct00.var_1_14 = __VERIFIER_nondet_double() [L93] EXPR WrapperStruct00.var_1_14 [L93] EXPR WrapperStruct00.var_1_14 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 <= -1.0e-20F [L93] EXPR WrapperStruct00.var_1_14 [L93] EXPR WrapperStruct00.var_1_14 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L93] EXPR (WrapperStruct00.var_1_14 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L93] CALL assume_abort_if_not((WrapperStruct00.var_1_14 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L93] RET assume_abort_if_not((WrapperStruct00.var_1_14 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L94] WrapperStruct00.var_1_15 = __VERIFIER_nondet_double() [L95] EXPR WrapperStruct00.var_1_15 [L95] EXPR WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F [L95] EXPR WrapperStruct00.var_1_15 [L95] EXPR WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L95] EXPR (WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L95] CALL assume_abort_if_not((WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L95] RET assume_abort_if_not((WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L96] WrapperStruct00.var_1_17 = __VERIFIER_nondet_char() [L97] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_17 >= -127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_17 >= -127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L98] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_17 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_17 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L99] WrapperStruct00.var_1_19 = __VERIFIER_nondet_ushort() [L100] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L101] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_19 <= 65534) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_19 <= 65534) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L115] RET updateVariables() [L116] CALL step() [L59] COND TRUE 0.625f > last_1_WrapperStruct00_var_1_9 [L60] WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L60] COND FALSE !(WrapperStruct00.var_1_3) [L66] EXPR WrapperStruct00.var_1_17 [L66] WrapperStruct00.var_1_16 = WrapperStruct00.var_1_17 [L67] EXPR WrapperStruct00.var_1_19 [L67] WrapperStruct00.var_1_18 = WrapperStruct00.var_1_19 [L68] EXPR WrapperStruct00.var_1_19 [L68] WrapperStruct00.var_1_20 = WrapperStruct00.var_1_19 [L69] WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L69] COND FALSE !(WrapperStruct00.var_1_3) [L74] EXPR WrapperStruct00.var_1_1 [L74] EXPR WrapperStruct00.var_1_1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L74] COND TRUE WrapperStruct00.var_1_1 <= WrapperStruct00.var_1_1 [L75] EXPR WrapperStruct00.var_1_13 [L75] EXPR WrapperStruct00.var_1_14 [L75] EXPR WrapperStruct00.var_1_15 [L75] WrapperStruct00.var_1_9 = (WrapperStruct00.var_1_13 - (WrapperStruct00.var_1_14 - WrapperStruct00.var_1_15)) [L78] EXPR WrapperStruct00.var_1_4 [L78] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L78] COND FALSE !(WrapperStruct00.var_1_4 > WrapperStruct00.var_1_9) [L116] RET step() [L117] CALL, EXPR property() [L107] EXPR (0.625f > last_1_WrapperStruct00_var_1_9) ? (WrapperStruct00.var_1_3 ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : 1) : (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) [L107] EXPR WrapperStruct00.var_1_1 [L107] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L107] EXPR ((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4) [L107] EXPR WrapperStruct00.var_1_4 [L107] EXPR ((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L107] EXPR (0.625f > last_1_WrapperStruct00_var_1_9) ? (WrapperStruct00.var_1_3 ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : 1) : (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L107] EXPR ((0.625f > last_1_WrapperStruct00_var_1_9) ? (WrapperStruct00.var_1_3 ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : 1) : (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4)))))) && ((WrapperStruct00.var_1_4 > WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_5 == ((signed long int) (((((WrapperStruct00.var_1_20) > (-64)) ? (WrapperStruct00.var_1_20) : (-64))) + ((WrapperStruct00.var_1_20 + -2) + WrapperStruct00.var_1_18)))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L107] EXPR (((0.625f > last_1_WrapperStruct00_var_1_9) ? (WrapperStruct00.var_1_3 ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : 1) : (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4)))))) && ((WrapperStruct00.var_1_4 > WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_5 == ((signed long int) (((((WrapperStruct00.var_1_20) > (-64)) ? (WrapperStruct00.var_1_20) : (-64))) + ((WrapperStruct00.var_1_20 + -2) + WrapperStruct00.var_1_18)))) : 1)) && (WrapperStruct00.var_1_3 ? ((WrapperStruct00.var_1_20 >= ((WrapperStruct00.var_1_18 - WrapperStruct00.var_1_20) * 64)) ? (WrapperStruct00.var_1_9 == ((double) (((((WrapperStruct00.var_1_12) < (50.5)) ? (WrapperStruct00.var_1_12) : (50.5))) - WrapperStruct00.var_1_13))) : 1) : ((WrapperStruct00.var_1_1 <= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_9 == ((double) (WrapperStruct00.var_1_13 - (WrapperStruct00.var_1_14 - WrapperStruct00.var_1_15)))) : 1)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L107] EXPR ((((0.625f > last_1_WrapperStruct00_var_1_9) ? (WrapperStruct00.var_1_3 ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : 1) : (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4)))))) && ((WrapperStruct00.var_1_4 > WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_5 == ((signed long int) (((((WrapperStruct00.var_1_20) > (-64)) ? (WrapperStruct00.var_1_20) : (-64))) + ((WrapperStruct00.var_1_20 + -2) + WrapperStruct00.var_1_18)))) : 1)) && (WrapperStruct00.var_1_3 ? ((WrapperStruct00.var_1_20 >= ((WrapperStruct00.var_1_18 - WrapperStruct00.var_1_20) * 64)) ? (WrapperStruct00.var_1_9 == ((double) (((((WrapperStruct00.var_1_12) < (50.5)) ? (WrapperStruct00.var_1_12) : (50.5))) - WrapperStruct00.var_1_13))) : 1) : ((WrapperStruct00.var_1_1 <= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_9 == ((double) (WrapperStruct00.var_1_13 - (WrapperStruct00.var_1_14 - WrapperStruct00.var_1_15)))) : 1))) && (WrapperStruct00.var_1_16 == ((signed char) WrapperStruct00.var_1_17)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L107] EXPR (((((0.625f > last_1_WrapperStruct00_var_1_9) ? (WrapperStruct00.var_1_3 ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : 1) : (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4)))))) && ((WrapperStruct00.var_1_4 > WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_5 == ((signed long int) (((((WrapperStruct00.var_1_20) > (-64)) ? (WrapperStruct00.var_1_20) : (-64))) + ((WrapperStruct00.var_1_20 + -2) + WrapperStruct00.var_1_18)))) : 1)) && (WrapperStruct00.var_1_3 ? ((WrapperStruct00.var_1_20 >= ((WrapperStruct00.var_1_18 - WrapperStruct00.var_1_20) * 64)) ? (WrapperStruct00.var_1_9 == ((double) (((((WrapperStruct00.var_1_12) < (50.5)) ? (WrapperStruct00.var_1_12) : (50.5))) - WrapperStruct00.var_1_13))) : 1) : ((WrapperStruct00.var_1_1 <= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_9 == ((double) (WrapperStruct00.var_1_13 - (WrapperStruct00.var_1_14 - WrapperStruct00.var_1_15)))) : 1))) && (WrapperStruct00.var_1_16 == ((signed char) WrapperStruct00.var_1_17))) && (WrapperStruct00.var_1_18 == ((unsigned short int) WrapperStruct00.var_1_19)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L107] EXPR ((((((0.625f > last_1_WrapperStruct00_var_1_9) ? (WrapperStruct00.var_1_3 ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : 1) : (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4)))))) && ((WrapperStruct00.var_1_4 > WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_5 == ((signed long int) (((((WrapperStruct00.var_1_20) > (-64)) ? (WrapperStruct00.var_1_20) : (-64))) + ((WrapperStruct00.var_1_20 + -2) + WrapperStruct00.var_1_18)))) : 1)) && (WrapperStruct00.var_1_3 ? ((WrapperStruct00.var_1_20 >= ((WrapperStruct00.var_1_18 - WrapperStruct00.var_1_20) * 64)) ? (WrapperStruct00.var_1_9 == ((double) (((((WrapperStruct00.var_1_12) < (50.5)) ? (WrapperStruct00.var_1_12) : (50.5))) - WrapperStruct00.var_1_13))) : 1) : ((WrapperStruct00.var_1_1 <= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_9 == ((double) (WrapperStruct00.var_1_13 - (WrapperStruct00.var_1_14 - WrapperStruct00.var_1_15)))) : 1))) && (WrapperStruct00.var_1_16 == ((signed char) WrapperStruct00.var_1_17))) && (WrapperStruct00.var_1_18 == ((unsigned short int) WrapperStruct00.var_1_19))) && (WrapperStruct00.var_1_20 == ((unsigned short int) WrapperStruct00.var_1_19)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L107-L108] return ((((((0.625f > last_1_WrapperStruct00_var_1_9) ? (WrapperStruct00.var_1_3 ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : 1) : (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4)))))) && ((WrapperStruct00.var_1_4 > WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_5 == ((signed long int) (((((WrapperStruct00.var_1_20) > (-64)) ? (WrapperStruct00.var_1_20) : (-64))) + ((WrapperStruct00.var_1_20 + -2) + WrapperStruct00.var_1_18)))) : 1)) && (WrapperStruct00.var_1_3 ? ((WrapperStruct00.var_1_20 >= ((WrapperStruct00.var_1_18 - WrapperStruct00.var_1_20) * 64)) ? (WrapperStruct00.var_1_9 == ((double) (((((WrapperStruct00.var_1_12) < (50.5)) ? (WrapperStruct00.var_1_12) : (50.5))) - WrapperStruct00.var_1_13))) : 1) : ((WrapperStruct00.var_1_1 <= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_9 == ((double) (WrapperStruct00.var_1_13 - (WrapperStruct00.var_1_14 - WrapperStruct00.var_1_15)))) : 1))) && (WrapperStruct00.var_1_16 == ((signed char) WrapperStruct00.var_1_17))) && (WrapperStruct00.var_1_18 == ((unsigned short int) WrapperStruct00.var_1_19))) && (WrapperStruct00.var_1_20 == ((unsigned short int) WrapperStruct00.var_1_19)) ; [L117] RET, EXPR property() [L117] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_9=201/2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 116 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.9s, OverallIterations: 7, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 62 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 61 mSDsluCounter, 2657 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1744 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 364 IncrementalHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 913 mSDtfsCounter, 364 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 179 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=122occurred in iteration=6, InterpolantAutomatonStates: 25, 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, 6 MinimizatonAttempts, 54 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 798 NumberOfCodeBlocks, 798 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 678 ConstructedInterpolants, 0 QuantifiedInterpolants, 724 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 1320/1320 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:47:20,984 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-65.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 2dc4b4561b119f2d441fb605148029621181083992b9a4c5c6ca30ee08fd9eac --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 18:47:23,214 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 18:47:23,293 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 18:47:23,299 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 18:47:23,300 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 18:47:23,331 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 18:47:23,331 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 18:47:23,332 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 18:47:23,332 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 18:47:23,336 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 18:47:23,336 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 18:47:23,336 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 18:47:23,337 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 18:47:23,337 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 18:47:23,337 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 18:47:23,338 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 18:47:23,339 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 18:47:23,339 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 18:47:23,339 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 18:47:23,340 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 18:47:23,340 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 18:47:23,340 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 18:47:23,341 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 18:47:23,341 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 18:47:23,342 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 18:47:23,342 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 18:47:23,342 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 18:47:23,342 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 18:47:23,342 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 18:47:23,343 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 18:47:23,343 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 18:47:23,343 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 18:47:23,343 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 18:47:23,343 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 18:47:23,343 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:47:23,344 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 18:47:23,344 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 18:47:23,345 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 18:47:23,345 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 18:47:23,346 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 18:47:23,346 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 18:47:23,346 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 18:47:23,346 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 18:47:23,346 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 18:47:23,347 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 -> 2dc4b4561b119f2d441fb605148029621181083992b9a4c5c6ca30ee08fd9eac [2024-11-16 18:47:23,699 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 18:47:23,725 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 18:47:23,728 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 18:47:23,729 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 18:47:23,730 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 18:47:23,731 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-65.i [2024-11-16 18:47:25,259 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 18:47:25,488 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 18:47:25,489 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-65.i [2024-11-16 18:47:25,503 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f4da3a91/92e67f4527cb4469b8dee7b9ce7b967f/FLAG0df7830d6 [2024-11-16 18:47:25,850 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f4da3a91/92e67f4527cb4469b8dee7b9ce7b967f [2024-11-16 18:47:25,852 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 18:47:25,854 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 18:47:25,856 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 18:47:25,857 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 18:47:25,861 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 18:47:25,862 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:47:25" (1/1) ... [2024-11-16 18:47:25,863 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5edcbc09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:47:25, skipping insertion in model container [2024-11-16 18:47:25,865 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:47:25" (1/1) ... [2024-11-16 18:47:25,893 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 18:47:26,079 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-65.i[916,929] [2024-11-16 18:47:26,155 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:47:26,169 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 18:47:26,180 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-65.i[916,929] [2024-11-16 18:47:26,233 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:47:26,261 INFO L204 MainTranslator]: Completed translation [2024-11-16 18:47:26,262 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:47:26 WrapperNode [2024-11-16 18:47:26,262 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 18:47:26,263 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 18:47:26,263 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 18:47:26,263 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 18:47:26,269 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:47:26" (1/1) ... [2024-11-16 18:47:26,296 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:47:26" (1/1) ... [2024-11-16 18:47:26,342 INFO L138 Inliner]: procedures = 40, calls = 146, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 479 [2024-11-16 18:47:26,344 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 18:47:26,345 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 18:47:26,345 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 18:47:26,345 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 18:47:26,355 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:47:26" (1/1) ... [2024-11-16 18:47:26,356 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:47:26" (1/1) ... [2024-11-16 18:47:26,367 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:47:26" (1/1) ... [2024-11-16 18:47:26,404 INFO L175 MemorySlicer]: Split 124 memory accesses to 2 slices as follows [2, 122]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 31 writes are split as follows [0, 31]. [2024-11-16 18:47:26,404 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:47:26" (1/1) ... [2024-11-16 18:47:26,405 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:47:26" (1/1) ... [2024-11-16 18:47:26,434 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:47:26" (1/1) ... [2024-11-16 18:47:26,435 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:47:26" (1/1) ... [2024-11-16 18:47:26,441 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:47:26" (1/1) ... [2024-11-16 18:47:26,448 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:47:26" (1/1) ... [2024-11-16 18:47:26,457 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 18:47:26,458 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 18:47:26,458 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 18:47:26,458 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 18:47:26,459 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:47:26" (1/1) ... [2024-11-16 18:47:26,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:47:26,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 18:47:26,491 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:47:26,498 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:47:26,541 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 18:47:26,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-16 18:47:26,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-16 18:47:26,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2024-11-16 18:47:26,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2024-11-16 18:47:26,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-16 18:47:26,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-16 18:47:26,544 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-16 18:47:26,544 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-16 18:47:26,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 18:47:26,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-16 18:47:26,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-16 18:47:26,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-16 18:47:26,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-16 18:47:26,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-16 18:47:26,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-16 18:47:26,546 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-16 18:47:26,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-16 18:47:26,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-16 18:47:26,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-16 18:47:26,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-16 18:47:26,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2024-11-16 18:47:26,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2024-11-16 18:47:26,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-16 18:47:26,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-16 18:47:26,548 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 18:47:26,548 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 18:47:26,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-16 18:47:26,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-16 18:47:26,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 18:47:26,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 18:47:26,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-16 18:47:26,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-16 18:47:26,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-16 18:47:26,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-16 18:47:26,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-16 18:47:26,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-16 18:47:26,712 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 18:47:26,714 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 18:47:31,432 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L107: havoc property_#t~ite98#1;havoc property_#t~mem86#1;havoc property_#t~ite92#1;havoc property_#t~mem91#1;havoc property_#t~mem87#1;havoc property_#t~ite90#1;havoc property_#t~mem88#1;havoc property_#t~mem89#1;havoc property_#t~mem97#1;havoc property_#t~mem93#1;havoc property_#t~ite96#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~ite107#1;havoc property_#t~mem106#1;havoc property_#t~mem101#1;havoc property_#t~ite103#1;havoc property_#t~mem102#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~short108#1;havoc property_#t~mem109#1;havoc property_#t~ite126#1;havoc property_#t~mem112#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~ite118#1;havoc property_#t~mem117#1;havoc property_#t~mem113#1;havoc property_#t~ite115#1;havoc property_#t~mem114#1;havoc property_#t~mem116#1;havoc property_#t~mem119#1;havoc property_#t~mem120#1;havoc property_#t~ite125#1;havoc property_#t~mem124#1;havoc property_#t~mem123#1;havoc property_#t~mem121#1;havoc property_#t~mem122#1;havoc property_#t~short127#1;havoc property_#t~mem129#1;havoc property_#t~mem128#1;havoc property_#t~short130#1;havoc property_#t~mem132#1;havoc property_#t~mem131#1;havoc property_#t~short133#1;havoc property_#t~mem135#1;havoc property_#t~mem134#1;havoc property_#t~short136#1; [2024-11-16 18:47:31,507 INFO L? ?]: Removed 120 outVars from TransFormulas that were not future-live. [2024-11-16 18:47:31,508 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 18:47:31,525 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 18:47:31,526 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 18:47:31,526 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:47:31 BoogieIcfgContainer [2024-11-16 18:47:31,527 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 18:47:31,529 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 18:47:31,530 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 18:47:31,533 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 18:47:31,533 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 06:47:25" (1/3) ... [2024-11-16 18:47:31,534 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3097c5d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:47:31, skipping insertion in model container [2024-11-16 18:47:31,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:47:26" (2/3) ... [2024-11-16 18:47:31,535 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3097c5d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:47:31, skipping insertion in model container [2024-11-16 18:47:31,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:47:31" (3/3) ... [2024-11-16 18:47:31,536 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-65.i [2024-11-16 18:47:31,552 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 18:47:31,552 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 18:47:31,620 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 18:47:31,627 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;@744ee59d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 18:47:31,627 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 18:47:31,632 INFO L276 IsEmpty]: Start isEmpty. Operand has 116 states, 102 states have (on average 1.4411764705882353) internal successors, (147), 103 states have internal predecessors, (147), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-16 18:47:31,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-16 18:47:31,645 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:47:31,646 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:31,646 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:47:31,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:47:31,652 INFO L85 PathProgramCache]: Analyzing trace with hash 614205013, now seen corresponding path program 1 times [2024-11-16 18:47:31,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:47:31,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1120415919] [2024-11-16 18:47:31,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:47:31,667 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:47:31,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:47:31,670 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:47:31,672 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:47:32,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:32,046 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 18:47:32,054 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:47:32,086 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-11-16 18:47:32,086 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:47:32,087 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:47:32,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1120415919] [2024-11-16 18:47:32,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1120415919] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:47:32,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:47:32,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 18:47:32,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701826720] [2024-11-16 18:47:32,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:47:32,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 18:47:32,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:47:32,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 18:47:32,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 18:47:32,124 INFO L87 Difference]: Start difference. First operand has 116 states, 102 states have (on average 1.4411764705882353) internal successors, (147), 103 states have internal predecessors, (147), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-16 18:47:32,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:47:32,160 INFO L93 Difference]: Finished difference Result 224 states and 342 transitions. [2024-11-16 18:47:32,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 18:47:32,162 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 114 [2024-11-16 18:47:32,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:47:32,171 INFO L225 Difference]: With dead ends: 224 [2024-11-16 18:47:32,172 INFO L226 Difference]: Without dead ends: 111 [2024-11-16 18:47:32,178 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 113 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:47:32,181 INFO L432 NwaCegarLoop]: 159 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, 159 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:47:32,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:47:32,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-16 18:47:32,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-16 18:47:32,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 98 states have (on average 1.3979591836734695) internal successors, (137), 98 states have internal predecessors, (137), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-16 18:47:32,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 159 transitions. [2024-11-16 18:47:32,232 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 159 transitions. Word has length 114 [2024-11-16 18:47:32,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:47:32,233 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 159 transitions. [2024-11-16 18:47:32,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-16 18:47:32,234 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 159 transitions. [2024-11-16 18:47:32,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-16 18:47:32,236 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:47:32,236 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:32,250 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 (2)] Forceful destruction successful, exit code 0 [2024-11-16 18:47:32,437 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:47:32,438 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:47:32,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:47:32,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1148298408, now seen corresponding path program 1 times [2024-11-16 18:47:32,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:47:32,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [518770324] [2024-11-16 18:47:32,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:47:32,440 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:47:32,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:47:32,460 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:47:32,461 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:47:32,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:32,848 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 18:47:32,855 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:47:32,914 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-11-16 18:47:32,914 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:47:32,914 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:47:32,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [518770324] [2024-11-16 18:47:32,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [518770324] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:47:32,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:47:32,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 18:47:32,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032773767] [2024-11-16 18:47:32,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:47:32,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 18:47:32,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:47:32,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 18:47:32,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 18:47:32,918 INFO L87 Difference]: Start difference. First operand 111 states and 159 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-16 18:47:33,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:47:33,007 INFO L93 Difference]: Finished difference Result 221 states and 318 transitions. [2024-11-16 18:47:33,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 18:47:33,008 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 114 [2024-11-16 18:47:33,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:47:33,009 INFO L225 Difference]: With dead ends: 221 [2024-11-16 18:47:33,010 INFO L226 Difference]: Without dead ends: 113 [2024-11-16 18:47:33,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 111 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:47:33,011 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 18:47:33,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 460 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 18:47:33,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-16 18:47:33,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-11-16 18:47:33,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 100 states have (on average 1.39) internal successors, (139), 100 states have internal predecessors, (139), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-16 18:47:33,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 161 transitions. [2024-11-16 18:47:33,027 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 161 transitions. Word has length 114 [2024-11-16 18:47:33,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:47:33,032 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 161 transitions. [2024-11-16 18:47:33,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-16 18:47:33,032 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 161 transitions. [2024-11-16 18:47:33,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-16 18:47:33,034 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:47:33,034 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:33,048 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:47:33,236 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:47:33,237 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:47:33,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:47:33,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1567815239, now seen corresponding path program 1 times [2024-11-16 18:47:33,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:47:33,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [150661963] [2024-11-16 18:47:33,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:47:33,239 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:47:33,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:47:33,240 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:47:33,241 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:47:33,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:33,613 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-16 18:47:33,621 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:47:33,742 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:47:33,917 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-16 18:47:33,918 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:47:33,919 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:47:33,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [150661963] [2024-11-16 18:47:33,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [150661963] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:47:33,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:47:33,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:47:33,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372719206] [2024-11-16 18:47:33,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:47:33,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:47:33,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:47:33,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:47:33,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:47:33,923 INFO L87 Difference]: Start difference. First operand 113 states and 161 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:47:35,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 18:47:43,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-16 18:47:46,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-16 18:47:46,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:47:46,720 INFO L93 Difference]: Finished difference Result 267 states and 378 transitions. [2024-11-16 18:47:46,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:47:46,721 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 114 [2024-11-16 18:47:46,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:47:46,723 INFO L225 Difference]: With dead ends: 267 [2024-11-16 18:47:46,723 INFO L226 Difference]: Without dead ends: 157 [2024-11-16 18:47:46,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-16 18:47:46,725 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 58 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.7s IncrementalHoareTripleChecker+Time [2024-11-16 18:47:46,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 427 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 12.7s Time] [2024-11-16 18:47:46,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-16 18:47:46,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 120. [2024-11-16 18:47:46,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 107 states have (on average 1.3831775700934579) internal successors, (148), 107 states have internal predecessors, (148), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-16 18:47:46,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 170 transitions. [2024-11-16 18:47:46,735 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 170 transitions. Word has length 114 [2024-11-16 18:47:46,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:47:46,736 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 170 transitions. [2024-11-16 18:47:46,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:47:46,736 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 170 transitions. [2024-11-16 18:47:46,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-16 18:47:46,738 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:47:46,738 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:46,750 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:47:46,939 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:47:46,939 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:47:46,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:47:46,940 INFO L85 PathProgramCache]: Analyzing trace with hash -774947503, now seen corresponding path program 1 times [2024-11-16 18:47:46,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:47:46,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [834684679] [2024-11-16 18:47:46,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:47:46,942 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:47:46,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:47:46,944 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:47:46,946 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:47:47,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:47,283 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 18:47:47,287 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:47:47,343 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-16 18:47:47,344 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:47:47,344 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:47:47,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [834684679] [2024-11-16 18:47:47,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [834684679] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:47:47,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:47:47,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 18:47:47,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170388965] [2024-11-16 18:47:47,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:47:47,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 18:47:47,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:47:47,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 18:47:47,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 18:47:47,349 INFO L87 Difference]: Start difference. First operand 120 states and 170 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:47:50,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 18:47:54,370 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 18:47:54,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:47:54,689 INFO L93 Difference]: Finished difference Result 286 states and 404 transitions. [2024-11-16 18:47:54,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 18:47:54,691 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 114 [2024-11-16 18:47:54,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:47:54,692 INFO L225 Difference]: With dead ends: 286 [2024-11-16 18:47:54,692 INFO L226 Difference]: Without dead ends: 169 [2024-11-16 18:47:54,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 18:47:54,695 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 61 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2024-11-16 18:47:54,696 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 250 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 7.3s Time] [2024-11-16 18:47:54,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-16 18:47:54,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 138. [2024-11-16 18:47:54,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 125 states have (on average 1.376) internal successors, (172), 125 states have internal predecessors, (172), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-16 18:47:54,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 194 transitions. [2024-11-16 18:47:54,706 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 194 transitions. Word has length 114 [2024-11-16 18:47:54,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:47:54,707 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 194 transitions. [2024-11-16 18:47:54,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:47:54,708 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 194 transitions. [2024-11-16 18:47:54,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-16 18:47:54,709 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:47:54,710 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:54,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 (5)] Ended with exit code 0 [2024-11-16 18:47:54,910 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:47:54,911 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:47:54,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:47:54,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1909634374, now seen corresponding path program 1 times [2024-11-16 18:47:54,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:47:54,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2077922137] [2024-11-16 18:47:54,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:47:54,913 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:47:54,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:47:54,916 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:47:54,922 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:47:55,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:55,335 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-16 18:47:55,338 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:47:55,374 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-16 18:47:55,375 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:47:55,375 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:47:55,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2077922137] [2024-11-16 18:47:55,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2077922137] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:47:55,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:47:55,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:47:55,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779934003] [2024-11-16 18:47:55,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:47:55,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:47:55,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:47:55,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:47:55,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:47:55,377 INFO L87 Difference]: Start difference. First operand 138 states and 194 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:47:55,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:47:55,433 INFO L93 Difference]: Finished difference Result 276 states and 389 transitions. [2024-11-16 18:47:55,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:47:55,433 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 114 [2024-11-16 18:47:55,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:47:55,435 INFO L225 Difference]: With dead ends: 276 [2024-11-16 18:47:55,435 INFO L226 Difference]: Without dead ends: 141 [2024-11-16 18:47:55,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:47:55,437 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 0 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:47:55,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 609 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:47:55,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-16 18:47:55,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2024-11-16 18:47:55,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 128 states have (on average 1.3671875) internal successors, (175), 128 states have internal predecessors, (175), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-16 18:47:55,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 197 transitions. [2024-11-16 18:47:55,456 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 197 transitions. Word has length 114 [2024-11-16 18:47:55,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:47:55,456 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 197 transitions. [2024-11-16 18:47:55,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:47:55,457 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 197 transitions. [2024-11-16 18:47:55,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-16 18:47:55,460 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:47:55,464 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:55,481 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:47:55,665 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:47:55,665 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:47:55,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:47:55,666 INFO L85 PathProgramCache]: Analyzing trace with hash -284851426, now seen corresponding path program 1 times [2024-11-16 18:47:55,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:47:55,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1453245886] [2024-11-16 18:47:55,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:47:55,667 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:47:55,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:47:55,668 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:47:55,669 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:47:55,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:55,990 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-16 18:47:55,993 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:47:56,019 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-16 18:47:56,019 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:47:56,019 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:47:56,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1453245886] [2024-11-16 18:47:56,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1453245886] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:47:56,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:47:56,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:47:56,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509076733] [2024-11-16 18:47:56,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:47:56,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:47:56,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:47:56,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:47:56,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:47:56,021 INFO L87 Difference]: Start difference. First operand 141 states and 197 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:47:56,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:47:56,075 INFO L93 Difference]: Finished difference Result 284 states and 398 transitions. [2024-11-16 18:47:56,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:47:56,076 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 115 [2024-11-16 18:47:56,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:47:56,077 INFO L225 Difference]: With dead ends: 284 [2024-11-16 18:47:56,077 INFO L226 Difference]: Without dead ends: 146 [2024-11-16 18:47:56,078 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:47:56,078 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 1 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:47:56,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 600 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:47:56,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-16 18:47:56,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2024-11-16 18:47:56,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 132 states have (on average 1.356060606060606) internal successors, (179), 132 states have internal predecessors, (179), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-16 18:47:56,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 201 transitions. [2024-11-16 18:47:56,086 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 201 transitions. Word has length 115 [2024-11-16 18:47:56,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:47:56,087 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 201 transitions. [2024-11-16 18:47:56,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:47:56,087 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 201 transitions. [2024-11-16 18:47:56,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-16 18:47:56,102 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:47:56,103 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:56,119 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:47:56,303 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:47:56,303 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:47:56,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:47:56,304 INFO L85 PathProgramCache]: Analyzing trace with hash -481364931, now seen corresponding path program 1 times [2024-11-16 18:47:56,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:47:56,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1719981191] [2024-11-16 18:47:56,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:47:56,305 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:47:56,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:47:56,308 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:47:56,308 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:47:56,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:56,644 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-16 18:47:56,647 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:47:56,698 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-16 18:47:56,698 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:47:56,698 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:47:56,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1719981191] [2024-11-16 18:47:56,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1719981191] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:47:56,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:47:56,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 18:47:56,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159573973] [2024-11-16 18:47:56,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:47:56,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 18:47:56,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:47:56,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 18:47:56,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 18:47:56,700 INFO L87 Difference]: Start difference. First operand 145 states and 201 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:47:56,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:47:56,789 INFO L93 Difference]: Finished difference Result 290 states and 403 transitions. [2024-11-16 18:47:56,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 18:47:56,790 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 115 [2024-11-16 18:47:56,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:47:56,791 INFO L225 Difference]: With dead ends: 290 [2024-11-16 18:47:56,792 INFO L226 Difference]: Without dead ends: 148 [2024-11-16 18:47:56,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 18:47:56,793 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 18:47:56,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 740 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 18:47:56,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-16 18:47:56,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2024-11-16 18:47:56,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 134 states have (on average 1.3507462686567164) internal successors, (181), 134 states have internal predecessors, (181), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-16 18:47:56,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 203 transitions. [2024-11-16 18:47:56,804 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 203 transitions. Word has length 115 [2024-11-16 18:47:56,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:47:56,805 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 203 transitions. [2024-11-16 18:47:56,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:47:56,805 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 203 transitions. [2024-11-16 18:47:56,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-16 18:47:56,806 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:47:56,807 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:56,819 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:47:57,007 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:47:57,008 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:47:57,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:47:57,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1261445404, now seen corresponding path program 1 times [2024-11-16 18:47:57,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:47:57,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [54032882] [2024-11-16 18:47:57,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:47:57,009 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:47:57,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:47:57,010 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:47:57,011 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:47:57,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:57,342 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 18:47:57,344 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:47:57,413 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-16 18:47:57,414 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:47:57,414 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:47:57,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [54032882] [2024-11-16 18:47:57,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [54032882] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:47:57,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:47:57,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 18:47:57,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603525574] [2024-11-16 18:47:57,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:47:57,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 18:47:57,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:47:57,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 18:47:57,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 18:47:57,416 INFO L87 Difference]: Start difference. First operand 147 states and 203 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:47:57,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:47:57,513 INFO L93 Difference]: Finished difference Result 294 states and 407 transitions. [2024-11-16 18:47:57,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 18:47:57,513 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 115 [2024-11-16 18:47:57,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:47:57,515 INFO L225 Difference]: With dead ends: 294 [2024-11-16 18:47:57,515 INFO L226 Difference]: Without dead ends: 150 [2024-11-16 18:47:57,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 18:47:57,518 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 1 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 18:47:57,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 881 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 18:47:57,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-16 18:47:57,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2024-11-16 18:47:57,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 136 states have (on average 1.3455882352941178) internal successors, (183), 136 states have internal predecessors, (183), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-16 18:47:57,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 205 transitions. [2024-11-16 18:47:57,530 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 205 transitions. Word has length 115 [2024-11-16 18:47:57,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:47:57,530 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 205 transitions. [2024-11-16 18:47:57,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:47:57,531 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 205 transitions. [2024-11-16 18:47:57,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-16 18:47:57,534 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:47:57,535 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:57,546 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:47:57,735 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:47:57,736 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:47:57,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:47:57,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1290074555, now seen corresponding path program 1 times [2024-11-16 18:47:57,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:47:57,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [349373973] [2024-11-16 18:47:57,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:47:57,737 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:47:57,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:47:57,740 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:47:57,741 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:47:58,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:58,041 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-16 18:47:58,045 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:47:58,219 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:47:58,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2024-11-16 18:47:58,263 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-16 18:47:58,263 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:47:58,263 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:47:58,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [349373973] [2024-11-16 18:47:58,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [349373973] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:47:58,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:47:58,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:47:58,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234183117] [2024-11-16 18:47:58,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:47:58,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 18:47:58,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:47:58,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 18:47:58,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 18:47:58,269 INFO L87 Difference]: Start difference. First operand 149 states and 205 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-16 18:48:01,655 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 18:48:04,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:48:04,491 INFO L93 Difference]: Finished difference Result 296 states and 408 transitions. [2024-11-16 18:48:04,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 18:48:04,492 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 115 [2024-11-16 18:48:04,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:48:04,493 INFO L225 Difference]: With dead ends: 296 [2024-11-16 18:48:04,493 INFO L226 Difference]: Without dead ends: 150 [2024-11-16 18:48:04,493 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-16 18:48:04,494 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 138 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2024-11-16 18:48:04,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 391 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2024-11-16 18:48:04,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-16 18:48:04,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2024-11-16 18:48:04,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 136 states have (on average 1.338235294117647) internal successors, (182), 136 states have internal predecessors, (182), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-16 18:48:04,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 204 transitions. [2024-11-16 18:48:04,499 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 204 transitions. Word has length 115 [2024-11-16 18:48:04,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:48:04,500 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 204 transitions. [2024-11-16 18:48:04,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-16 18:48:04,500 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 204 transitions. [2024-11-16 18:48:04,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-16 18:48:04,501 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:48:04,501 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:04,514 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:48:04,702 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:48:04,702 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:48:04,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:48:04,703 INFO L85 PathProgramCache]: Analyzing trace with hash -898330691, now seen corresponding path program 1 times [2024-11-16 18:48:04,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:48:04,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [981394400] [2024-11-16 18:48:04,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:48:04,703 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:48:04,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:48:04,705 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:48:04,706 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:48:05,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:48:05,022 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-16 18:48:05,025 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:48:05,161 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:48:05,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2024-11-16 18:48:05,194 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-11-16 18:48:05,195 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:48:05,195 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:48:05,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [981394400] [2024-11-16 18:48:05,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [981394400] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:48:05,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:48:05,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:48:05,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314065427] [2024-11-16 18:48:05,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:48:05,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 18:48:05,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:48:05,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 18:48:05,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 18:48:05,197 INFO L87 Difference]: Start difference. First operand 149 states and 204 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-16 18:48:06,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 18:48:08,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:48:08,994 INFO L93 Difference]: Finished difference Result 295 states and 405 transitions. [2024-11-16 18:48:08,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 18:48:08,995 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 117 [2024-11-16 18:48:08,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:48:08,996 INFO L225 Difference]: With dead ends: 295 [2024-11-16 18:48:08,996 INFO L226 Difference]: Without dead ends: 149 [2024-11-16 18:48:08,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-16 18:48:08,997 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 130 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-16 18:48:08,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 387 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-16 18:48:08,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-16 18:48:09,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 147. [2024-11-16 18:48:09,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 134 states have (on average 1.335820895522388) internal successors, (179), 134 states have internal predecessors, (179), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-16 18:48:09,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 201 transitions. [2024-11-16 18:48:09,003 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 201 transitions. Word has length 117 [2024-11-16 18:48:09,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:48:09,003 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 201 transitions. [2024-11-16 18:48:09,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-16 18:48:09,004 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 201 transitions. [2024-11-16 18:48:09,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-16 18:48:09,005 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:48:09,005 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:09,019 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:48:09,205 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:48:09,206 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:48:09,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:48:09,206 INFO L85 PathProgramCache]: Analyzing trace with hash 151739452, now seen corresponding path program 1 times [2024-11-16 18:48:09,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:48:09,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [70600535] [2024-11-16 18:48:09,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:48:09,207 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:48:09,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:48:09,208 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:48:09,209 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:48:09,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:48:09,506 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-16 18:48:09,509 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:48:09,719 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:48:09,719 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 172 treesize of output 64 [2024-11-16 18:48:09,805 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 120 proven. 16 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-16 18:48:09,805 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 18:48:10,133 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:48:10,133 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 110 treesize of output 1 [2024-11-16 18:48:10,156 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-16 18:48:10,157 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:48:10,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [70600535] [2024-11-16 18:48:10,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [70600535] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 18:48:10,157 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 18:48:10,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2024-11-16 18:48:10,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047260059] [2024-11-16 18:48:10,157 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 18:48:10,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-16 18:48:10,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:48:10,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-16 18:48:10,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-16 18:48:10,159 INFO L87 Difference]: Start difference. First operand 147 states and 201 transitions. Second operand has 12 states, 11 states have (on average 9.090909090909092) internal successors, (100), 12 states have internal predecessors, (100), 4 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2024-11-16 18:48:11,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 18:48:16,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:48:16,024 INFO L93 Difference]: Finished difference Result 304 states and 414 transitions. [2024-11-16 18:48:16,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-16 18:48:16,025 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 9.090909090909092) internal successors, (100), 12 states have internal predecessors, (100), 4 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) Word has length 119 [2024-11-16 18:48:16,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:48:16,026 INFO L225 Difference]: With dead ends: 304 [2024-11-16 18:48:16,026 INFO L226 Difference]: Without dead ends: 149 [2024-11-16 18:48:16,026 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2024-11-16 18:48:16,027 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 137 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2024-11-16 18:48:16,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 524 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2024-11-16 18:48:16,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-16 18:48:16,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 147. [2024-11-16 18:48:16,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 134 states have (on average 1.3208955223880596) internal successors, (177), 134 states have internal predecessors, (177), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-16 18:48:16,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 199 transitions. [2024-11-16 18:48:16,033 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 199 transitions. Word has length 119 [2024-11-16 18:48:16,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:48:16,033 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 199 transitions. [2024-11-16 18:48:16,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 9.090909090909092) internal successors, (100), 12 states have internal predecessors, (100), 4 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2024-11-16 18:48:16,033 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 199 transitions. [2024-11-16 18:48:16,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-16 18:48:16,034 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:48:16,035 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:16,049 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 (12)] Ended with exit code 0 [2024-11-16 18:48:16,235 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:48:16,235 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:48:16,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:48:16,236 INFO L85 PathProgramCache]: Analyzing trace with hash 680658491, now seen corresponding path program 1 times [2024-11-16 18:48:16,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:48:16,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [993242161] [2024-11-16 18:48:16,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:48:16,236 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:48:16,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:48:16,238 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:48:16,239 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:48:16,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:48:16,560 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-16 18:48:16,562 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:48:16,754 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:48:16,754 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 175 treesize of output 67 [2024-11-16 18:48:16,793 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-16 18:48:16,794 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:48:16,794 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:48:16,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [993242161] [2024-11-16 18:48:16,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [993242161] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:48:16,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:48:16,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:48:16,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475814731] [2024-11-16 18:48:16,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:48:16,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 18:48:16,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:48:16,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 18:48:16,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 18:48:16,796 INFO L87 Difference]: Start difference. First operand 147 states and 199 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-16 18:48:18,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 18:48:20,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:48:20,309 INFO L93 Difference]: Finished difference Result 292 states and 396 transitions. [2024-11-16 18:48:20,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 18:48:20,310 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 119 [2024-11-16 18:48:20,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:48:20,311 INFO L225 Difference]: With dead ends: 292 [2024-11-16 18:48:20,311 INFO L226 Difference]: Without dead ends: 148 [2024-11-16 18:48:20,311 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-16 18:48:20,312 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 117 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-16 18:48:20,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 375 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-16 18:48:20,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-16 18:48:20,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2024-11-16 18:48:20,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 134 states have (on average 1.3134328358208955) internal successors, (176), 134 states have internal predecessors, (176), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-16 18:48:20,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 198 transitions. [2024-11-16 18:48:20,317 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 198 transitions. Word has length 119 [2024-11-16 18:48:20,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:48:20,318 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 198 transitions. [2024-11-16 18:48:20,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-16 18:48:20,318 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 198 transitions. [2024-11-16 18:48:20,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-16 18:48:20,319 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:48:20,319 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:20,332 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:48:20,520 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:48:20,520 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:48:20,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:48:20,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1293915587, now seen corresponding path program 1 times [2024-11-16 18:48:20,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:48:20,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [243387971] [2024-11-16 18:48:20,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:48:20,521 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:48:20,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:48:20,523 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:48:20,523 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:48:20,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:48:20,868 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-16 18:48:20,871 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:48:21,091 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:48:21,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2024-11-16 18:48:21,117 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-16 18:48:21,118 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:48:21,118 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:48:21,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [243387971] [2024-11-16 18:48:21,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [243387971] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:48:21,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:48:21,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:48:21,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983061647] [2024-11-16 18:48:21,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:48:21,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 18:48:21,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:48:21,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 18:48:21,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 18:48:21,120 INFO L87 Difference]: Start difference. First operand 147 states and 198 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 5 states have internal predecessors, (72), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-16 18:48:23,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 18:48:24,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:48:24,931 INFO L93 Difference]: Finished difference Result 292 states and 394 transitions. [2024-11-16 18:48:24,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 18:48:24,932 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 5 states have internal predecessors, (72), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 121 [2024-11-16 18:48:24,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:48:24,933 INFO L225 Difference]: With dead ends: 292 [2024-11-16 18:48:24,933 INFO L226 Difference]: Without dead ends: 148 [2024-11-16 18:48:24,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-16 18:48:24,934 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 109 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-16 18:48:24,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 369 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-16 18:48:24,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-16 18:48:24,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2024-11-16 18:48:24,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 134 states have (on average 1.3059701492537314) internal successors, (175), 134 states have internal predecessors, (175), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-16 18:48:24,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 197 transitions. [2024-11-16 18:48:24,940 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 197 transitions. Word has length 121 [2024-11-16 18:48:24,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:48:24,940 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 197 transitions. [2024-11-16 18:48:24,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 5 states have internal predecessors, (72), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-16 18:48:24,940 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 197 transitions. [2024-11-16 18:48:24,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-16 18:48:24,941 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:48:24,941 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:24,954 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:48:25,142 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:48:25,142 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:48:25,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:48:25,143 INFO L85 PathProgramCache]: Analyzing trace with hash 244245179, now seen corresponding path program 1 times [2024-11-16 18:48:25,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:48:25,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [615450990] [2024-11-16 18:48:25,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:48:25,143 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:48:25,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:48:25,144 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:48:25,146 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:48:25,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:48:25,662 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-16 18:48:25,666 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:48:25,682 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:48:25,692 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 25 treesize of output 10 [2024-11-16 18:48:28,077 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_skolemized_q#valueAsBitvector_121| (_ BitVec 64))) (= ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_121|) (select (select |c_#memory_int#1| |c_~#WrapperStruct00~0.base|) (bvadd (_ bv21 32) |c_~#WrapperStruct00~0.offset|)))) is different from true [2024-11-16 18:48:28,153 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 14 [2024-11-16 18:48:28,222 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 34 [2024-11-16 18:48:32,079 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#1| |c_~#WrapperStruct00~0.base|))) (and (exists ((|v_skolemized_q#valueAsBitvector_122| (_ BitVec 64))) (and (= (select .cse0 (bvadd (_ bv37 32) |c_~#WrapperStruct00~0.offset|)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_122|)) (= (select .cse0 (bvadd (_ bv41 32) |c_~#WrapperStruct00~0.offset|)) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_122|)))) (exists ((|v_skolemized_q#valueAsBitvector_121| (_ BitVec 64))) (= ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_121|) (select .cse0 (bvadd (_ bv21 32) |c_~#WrapperStruct00~0.offset|)))))) is different from true [2024-11-16 18:48:32,264 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:48:32,265 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 40 [2024-11-16 18:48:32,489 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:48:32,490 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:48:32,790 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:48:32,791 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 60 treesize of output 53 [2024-11-16 18:48:33,353 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:48:33,354 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 131 treesize of output 101 [2024-11-16 18:48:33,529 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:48:33,530 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 159 treesize of output 116 [2024-11-16 18:48:34,178 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:48:34,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 182 treesize of output 68 [2024-11-16 18:48:34,366 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 80 not checked. [2024-11-16 18:48:34,366 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 18:48:34,860 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-16 18:48:34,860 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:48:34,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [615450990] [2024-11-16 18:48:34,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [615450990] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-16 18:48:34,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 18:48:34,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [13] total 18 [2024-11-16 18:48:34,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896972306] [2024-11-16 18:48:34,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:48:34,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 18:48:34,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:48:34,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 18:48:34,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=198, Unknown=2, NotChecked=58, Total=306 [2024-11-16 18:48:34,862 INFO L87 Difference]: Start difference. First operand 147 states and 197 transitions. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:48:37,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 18:48:43,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.58s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 18:48:45,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []