./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-8.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-8.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 2adf86622f346d8406b4270c76c12e01b0cd0b4263eaaf0f4abdb5436079ce86 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 10:02:04,653 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 10:02:04,716 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 10:02:04,722 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 10:02:04,724 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 10:02:04,745 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 10:02:04,747 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 10:02:04,747 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 10:02:04,748 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 10:02:04,751 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 10:02:04,751 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 10:02:04,751 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 10:02:04,752 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 10:02:04,752 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 10:02:04,752 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 10:02:04,752 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 10:02:04,754 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 10:02:04,754 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 10:02:04,754 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 10:02:04,754 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 10:02:04,754 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 10:02:04,755 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 10:02:04,755 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 10:02:04,755 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 10:02:04,756 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 10:02:04,756 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 10:02:04,757 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 10:02:04,757 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 10:02:04,757 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 10:02:04,757 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 10:02:04,758 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 10:02:04,758 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 10:02:04,758 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:02:04,759 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 10:02:04,759 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 10:02:04,759 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 10:02:04,759 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 10:02:04,759 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 10:02:04,759 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 10:02:04,760 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 10:02:04,760 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 10:02:04,760 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 10:02:04,760 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 -> 2adf86622f346d8406b4270c76c12e01b0cd0b4263eaaf0f4abdb5436079ce86 [2024-11-10 10:02:04,988 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 10:02:05,009 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 10:02:05,012 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 10:02:05,013 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 10:02:05,013 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 10:02:05,014 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-8.i [2024-11-10 10:02:06,386 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 10:02:06,563 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 10:02:06,565 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-8.i [2024-11-10 10:02:06,576 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0139ac0e1/950af2bba5fa4f8692fcd741631250fd/FLAG8d497d11d [2024-11-10 10:02:06,589 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0139ac0e1/950af2bba5fa4f8692fcd741631250fd [2024-11-10 10:02:06,591 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 10:02:06,592 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 10:02:06,594 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 10:02:06,595 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 10:02:06,599 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 10:02:06,600 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:02:06" (1/1) ... [2024-11-10 10:02:06,601 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2137deda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:02:06, skipping insertion in model container [2024-11-10 10:02:06,601 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:02:06" (1/1) ... [2024-11-10 10:02:06,621 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 10:02:06,771 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-sp_file-8.i[916,929] [2024-11-10 10:02:06,848 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:02:06,860 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 10:02:06,873 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-sp_file-8.i[916,929] [2024-11-10 10:02:06,957 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:02:07,020 INFO L204 MainTranslator]: Completed translation [2024-11-10 10:02:07,021 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:02:07 WrapperNode [2024-11-10 10:02:07,021 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 10:02:07,024 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 10:02:07,024 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 10:02:07,024 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 10:02:07,030 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:02:07" (1/1) ... [2024-11-10 10:02:07,043 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:02:07" (1/1) ... [2024-11-10 10:02:07,092 INFO L138 Inliner]: procedures = 30, calls = 152, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 457 [2024-11-10 10:02:07,092 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 10:02:07,093 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 10:02:07,094 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 10:02:07,094 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 10:02:07,102 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:02:07" (1/1) ... [2024-11-10 10:02:07,103 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:02:07" (1/1) ... [2024-11-10 10:02:07,107 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:02:07" (1/1) ... [2024-11-10 10:02:07,121 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-10 10:02:07,122 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:02:07" (1/1) ... [2024-11-10 10:02:07,122 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:02:07" (1/1) ... [2024-11-10 10:02:07,139 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:02:07" (1/1) ... [2024-11-10 10:02:07,144 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:02:07" (1/1) ... [2024-11-10 10:02:07,146 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:02:07" (1/1) ... [2024-11-10 10:02:07,152 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:02:07" (1/1) ... [2024-11-10 10:02:07,156 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 10:02:07,160 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 10:02:07,160 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 10:02:07,160 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 10:02:07,161 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:02:07" (1/1) ... [2024-11-10 10:02:07,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:02:07,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:02:07,200 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 10:02:07,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 10:02:07,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 10:02:07,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-10 10:02:07,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-10 10:02:07,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-10 10:02:07,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-10 10:02:07,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-10 10:02:07,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-10 10:02:07,243 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 10:02:07,243 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 10:02:07,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-10 10:02:07,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 10:02:07,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 10:02:07,358 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 10:02:07,360 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 10:02:07,808 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L129: havoc property_#t~mem81#1;havoc property_#t~mem80#1;havoc property_#t~ite90#1;havoc property_#t~mem87#1;havoc property_#t~mem85#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~short84#1;havoc property_#t~short86#1;havoc property_#t~mem89#1;havoc property_#t~mem88#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~ite104#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~ite101#1;havoc property_#t~mem98#1;havoc property_#t~mem97#1;havoc property_#t~mem100#1;havoc property_#t~mem99#1;havoc property_#t~mem103#1;havoc property_#t~mem102#1;havoc property_#t~short105#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~ite117#1;havoc property_#t~mem112#1;havoc property_#t~mem111#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~mem110#1;havoc property_#t~mem116#1;havoc property_#t~mem115#1;havoc property_#t~mem113#1;havoc property_#t~mem114#1;havoc property_#t~short118#1;havoc property_#t~mem120#1;havoc property_#t~mem119#1;havoc property_#t~short121#1;havoc property_#t~mem123#1;havoc property_#t~mem122#1;havoc property_#t~short124#1;havoc property_#t~mem126#1;havoc property_#t~mem125#1;havoc property_#t~short127#1; [2024-11-10 10:02:07,851 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2024-11-10 10:02:07,851 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 10:02:07,869 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 10:02:07,869 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 10:02:07,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:02:07 BoogieIcfgContainer [2024-11-10 10:02:07,869 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 10:02:07,871 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 10:02:07,871 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 10:02:07,876 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 10:02:07,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 10:02:06" (1/3) ... [2024-11-10 10:02:07,877 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@106eaf37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:02:07, skipping insertion in model container [2024-11-10 10:02:07,878 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:02:07" (2/3) ... [2024-11-10 10:02:07,878 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@106eaf37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:02:07, skipping insertion in model container [2024-11-10 10:02:07,878 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:02:07" (3/3) ... [2024-11-10 10:02:07,879 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-8.i [2024-11-10 10:02:07,895 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 10:02:07,895 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 10:02:07,968 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 10:02:07,981 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;@10648917, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 10:02:07,981 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 10:02:07,992 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 86 states have (on average 1.3953488372093024) internal successors, (120), 87 states have internal predecessors, (120), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-10 10:02:08,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-10 10:02:08,006 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:02:08,007 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:02:08,008 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:02:08,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:02:08,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1450291173, now seen corresponding path program 1 times [2024-11-10 10:02:08,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:02:08,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777899670] [2024-11-10 10:02:08,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:02:08,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:02:08,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:08,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 10:02:08,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:08,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 10:02:08,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:08,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 10:02:08,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:08,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 10:02:08,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:08,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 10:02:08,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:08,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 10:02:08,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:08,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 10:02:08,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:08,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 10:02:08,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:08,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 10:02:08,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:08,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 10:02:08,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:08,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 10:02:08,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:08,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 10:02:08,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:08,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 10:02:08,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:08,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 10:02:08,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:08,424 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 10:02:08,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:02:08,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777899670] [2024-11-10 10:02:08,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777899670] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:02:08,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:02:08,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 10:02:08,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461782524] [2024-11-10 10:02:08,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:02:08,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 10:02:08,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:02:08,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 10:02:08,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 10:02:08,457 INFO L87 Difference]: Start difference. First operand has 103 states, 86 states have (on average 1.3953488372093024) internal successors, (120), 87 states have internal predecessors, (120), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-10 10:02:08,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:02:08,487 INFO L93 Difference]: Finished difference Result 198 states and 303 transitions. [2024-11-10 10:02:08,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 10:02:08,490 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 125 [2024-11-10 10:02:08,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:02:08,497 INFO L225 Difference]: With dead ends: 198 [2024-11-10 10:02:08,497 INFO L226 Difference]: Without dead ends: 98 [2024-11-10 10:02:08,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 10:02:08,504 INFO L432 NwaCegarLoop]: 140 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, 140 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 10:02:08,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 10:02:08,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-10 10:02:08,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-10 10:02:08,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 82 states have (on average 1.3658536585365855) internal successors, (112), 82 states have internal predecessors, (112), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-10 10:02:08,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 140 transitions. [2024-11-10 10:02:08,542 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 140 transitions. Word has length 125 [2024-11-10 10:02:08,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:02:08,542 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 140 transitions. [2024-11-10 10:02:08,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-10 10:02:08,543 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 140 transitions. [2024-11-10 10:02:08,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-10 10:02:08,545 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:02:08,545 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:02:08,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 10:02:08,546 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:02:08,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:02:08,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1180383215, now seen corresponding path program 1 times [2024-11-10 10:02:08,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:02:08,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011725930] [2024-11-10 10:02:08,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:02:08,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:02:08,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:08,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 10:02:08,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:08,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 10:02:08,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:08,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 10:02:08,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:08,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 10:02:08,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:08,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 10:02:08,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:08,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 10:02:08,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:08,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 10:02:08,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:08,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 10:02:08,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:08,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 10:02:08,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:08,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 10:02:08,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:08,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 10:02:08,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:08,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 10:02:08,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:08,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 10:02:08,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:08,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 10:02:08,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:08,929 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 10:02:08,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:02:08,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011725930] [2024-11-10 10:02:08,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011725930] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:02:08,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:02:08,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 10:02:08,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455915343] [2024-11-10 10:02:08,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:02:08,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 10:02:08,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:02:08,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 10:02:08,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:02:08,935 INFO L87 Difference]: Start difference. First operand 98 states and 140 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 10:02:08,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:02:08,975 INFO L93 Difference]: Finished difference Result 196 states and 281 transitions. [2024-11-10 10:02:08,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 10:02:08,975 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 125 [2024-11-10 10:02:08,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:02:08,977 INFO L225 Difference]: With dead ends: 196 [2024-11-10 10:02:08,977 INFO L226 Difference]: Without dead ends: 101 [2024-11-10 10:02:08,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:02:08,978 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 1 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 10:02:08,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 400 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 10:02:08,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-10 10:02:08,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2024-11-10 10:02:08,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 84 states have (on average 1.3571428571428572) internal successors, (114), 84 states have internal predecessors, (114), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-10 10:02:08,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 142 transitions. [2024-11-10 10:02:08,998 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 142 transitions. Word has length 125 [2024-11-10 10:02:08,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:02:08,999 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 142 transitions. [2024-11-10 10:02:09,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 10:02:09,000 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 142 transitions. [2024-11-10 10:02:09,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-10 10:02:09,005 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:02:09,005 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:02:09,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 10:02:09,005 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:02:09,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:02:09,006 INFO L85 PathProgramCache]: Analyzing trace with hash 983869710, now seen corresponding path program 1 times [2024-11-10 10:02:09,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:02:09,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803861708] [2024-11-10 10:02:09,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:02:09,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:02:09,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:09,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 10:02:09,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:09,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 10:02:09,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:09,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 10:02:09,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:09,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 10:02:09,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:09,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 10:02:09,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:09,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 10:02:09,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:09,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 10:02:09,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:09,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 10:02:09,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:09,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 10:02:09,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:09,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 10:02:09,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:09,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 10:02:09,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:09,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 10:02:09,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:09,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 10:02:09,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:09,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 10:02:09,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:09,251 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 10:02:09,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:02:09,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803861708] [2024-11-10 10:02:09,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803861708] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:02:09,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:02:09,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 10:02:09,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068157122] [2024-11-10 10:02:09,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:02:09,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 10:02:09,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:02:09,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 10:02:09,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:02:09,256 INFO L87 Difference]: Start difference. First operand 100 states and 142 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 10:02:09,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:02:09,293 INFO L93 Difference]: Finished difference Result 200 states and 285 transitions. [2024-11-10 10:02:09,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 10:02:09,294 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 125 [2024-11-10 10:02:09,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:02:09,295 INFO L225 Difference]: With dead ends: 200 [2024-11-10 10:02:09,295 INFO L226 Difference]: Without dead ends: 103 [2024-11-10 10:02:09,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:02:09,299 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 1 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 401 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-10 10:02:09,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 401 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 10:02:09,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-10 10:02:09,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2024-11-10 10:02:09,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 86 states have (on average 1.3488372093023255) internal successors, (116), 86 states have internal predecessors, (116), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-10 10:02:09,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 144 transitions. [2024-11-10 10:02:09,311 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 144 transitions. Word has length 125 [2024-11-10 10:02:09,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:02:09,311 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 144 transitions. [2024-11-10 10:02:09,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 10:02:09,312 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 144 transitions. [2024-11-10 10:02:09,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-10 10:02:09,319 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:02:09,320 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:02:09,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 10:02:09,320 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:02:09,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:02:09,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1568287251, now seen corresponding path program 1 times [2024-11-10 10:02:09,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:02:09,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376850675] [2024-11-10 10:02:09,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:02:09,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:02:09,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:09,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 10:02:09,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:09,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 10:02:09,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:09,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 10:02:09,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:09,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 10:02:09,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:09,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 10:02:09,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:09,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 10:02:09,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:09,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 10:02:09,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:09,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 10:02:09,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:09,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 10:02:09,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:09,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 10:02:09,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:09,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 10:02:09,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:09,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 10:02:09,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:09,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 10:02:09,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:09,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 10:02:09,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:09,892 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 10:02:09,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:02:09,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376850675] [2024-11-10 10:02:09,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376850675] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:02:09,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:02:09,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 10:02:09,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105600907] [2024-11-10 10:02:09,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:02:09,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 10:02:09,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:02:09,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 10:02:09,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 10:02:09,896 INFO L87 Difference]: Start difference. First operand 102 states and 144 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 10:02:10,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:02:10,093 INFO L93 Difference]: Finished difference Result 204 states and 288 transitions. [2024-11-10 10:02:10,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 10:02:10,094 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 125 [2024-11-10 10:02:10,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:02:10,096 INFO L225 Difference]: With dead ends: 204 [2024-11-10 10:02:10,096 INFO L226 Difference]: Without dead ends: 105 [2024-11-10 10:02:10,097 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 10:02:10,100 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 97 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 10:02:10,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 312 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 10:02:10,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-10 10:02:10,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 102. [2024-11-10 10:02:10,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 86 states have (on average 1.3372093023255813) internal successors, (115), 86 states have internal predecessors, (115), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-10 10:02:10,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 143 transitions. [2024-11-10 10:02:10,113 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 143 transitions. Word has length 125 [2024-11-10 10:02:10,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:02:10,114 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 143 transitions. [2024-11-10 10:02:10,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 10:02:10,114 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 143 transitions. [2024-11-10 10:02:10,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-10 10:02:10,118 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:02:10,119 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:02:10,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 10:02:10,119 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:02:10,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:02:10,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1977111476, now seen corresponding path program 1 times [2024-11-10 10:02:10,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:02:10,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718690401] [2024-11-10 10:02:10,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:02:10,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:02:10,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:12,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 10:02:12,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:12,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 10:02:12,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:12,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 10:02:12,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:12,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 10:02:12,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:12,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 10:02:12,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:12,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 10:02:12,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:12,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 10:02:12,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:12,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 10:02:12,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:12,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 10:02:13,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:13,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 10:02:13,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:13,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 10:02:13,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:13,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 10:02:13,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:13,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 10:02:13,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:13,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 10:02:13,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:13,056 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 10:02:13,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:02:13,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718690401] [2024-11-10 10:02:13,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718690401] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:02:13,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:02:13,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-10 10:02:13,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816712214] [2024-11-10 10:02:13,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:02:13,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 10:02:13,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:02:13,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 10:02:13,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-11-10 10:02:13,061 INFO L87 Difference]: Start difference. First operand 102 states and 143 transitions. Second operand has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 12 states have internal predecessors, (58), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2024-11-10 10:02:13,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:02:13,573 INFO L93 Difference]: Finished difference Result 239 states and 333 transitions. [2024-11-10 10:02:13,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 10:02:13,573 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 12 states have internal predecessors, (58), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 125 [2024-11-10 10:02:13,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:02:13,574 INFO L225 Difference]: With dead ends: 239 [2024-11-10 10:02:13,574 INFO L226 Difference]: Without dead ends: 140 [2024-11-10 10:02:13,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2024-11-10 10:02:13,576 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 348 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 10:02:13,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 416 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 10:02:13,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-10 10:02:13,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 106. [2024-11-10 10:02:13,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 90 states have (on average 1.3333333333333333) internal successors, (120), 90 states have internal predecessors, (120), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-10 10:02:13,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 148 transitions. [2024-11-10 10:02:13,596 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 148 transitions. Word has length 125 [2024-11-10 10:02:13,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:02:13,596 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 148 transitions. [2024-11-10 10:02:13,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 12 states have internal predecessors, (58), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2024-11-10 10:02:13,596 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 148 transitions. [2024-11-10 10:02:13,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-10 10:02:13,597 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:02:13,597 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:02:13,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 10:02:13,598 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:02:13,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:02:13,598 INFO L85 PathProgramCache]: Analyzing trace with hash -322667022, now seen corresponding path program 1 times [2024-11-10 10:02:13,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:02:13,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350150495] [2024-11-10 10:02:13,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:02:13,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:02:13,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:14,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 10:02:14,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:14,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 10:02:14,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:14,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 10:02:14,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:14,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 10:02:14,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:14,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 10:02:14,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:14,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 10:02:14,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:14,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 10:02:14,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:14,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 10:02:14,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:14,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 10:02:14,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:14,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 10:02:14,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:14,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 10:02:14,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:14,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 10:02:14,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:14,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 10:02:14,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:14,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 10:02:14,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:14,844 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 10:02:14,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:02:14,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350150495] [2024-11-10 10:02:14,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350150495] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:02:14,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:02:14,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 10:02:14,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167511111] [2024-11-10 10:02:14,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:02:14,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 10:02:14,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:02:14,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 10:02:14,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-10 10:02:14,846 INFO L87 Difference]: Start difference. First operand 106 states and 148 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 10:02:15,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:02:15,826 INFO L93 Difference]: Finished difference Result 246 states and 340 transitions. [2024-11-10 10:02:15,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 10:02:15,827 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 127 [2024-11-10 10:02:15,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:02:15,828 INFO L225 Difference]: With dead ends: 246 [2024-11-10 10:02:15,828 INFO L226 Difference]: Without dead ends: 143 [2024-11-10 10:02:15,829 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2024-11-10 10:02:15,830 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 234 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 10:02:15,831 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 577 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 10:02:15,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-10 10:02:15,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 106. [2024-11-10 10:02:15,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 90 states have (on average 1.3222222222222222) internal successors, (119), 90 states have internal predecessors, (119), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-10 10:02:15,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 147 transitions. [2024-11-10 10:02:15,856 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 147 transitions. Word has length 127 [2024-11-10 10:02:15,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:02:15,857 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 147 transitions. [2024-11-10 10:02:15,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 10:02:15,858 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 147 transitions. [2024-11-10 10:02:15,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-10 10:02:15,859 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:02:15,860 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:02:15,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 10:02:15,860 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:02:15,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:02:15,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1749567406, now seen corresponding path program 1 times [2024-11-10 10:02:15,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:02:15,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282591902] [2024-11-10 10:02:15,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:02:15,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:02:15,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:16,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 10:02:16,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:16,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 10:02:16,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:16,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 10:02:16,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:16,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 10:02:16,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:16,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 10:02:16,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:16,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 10:02:16,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:16,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 10:02:16,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:16,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 10:02:16,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:16,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 10:02:16,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:16,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 10:02:16,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:16,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 10:02:16,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:16,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 10:02:16,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:16,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 10:02:16,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:16,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 10:02:16,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:16,599 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 10:02:16,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:02:16,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282591902] [2024-11-10 10:02:16,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282591902] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:02:16,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:02:16,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 10:02:16,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105230141] [2024-11-10 10:02:16,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:02:16,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 10:02:16,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:02:16,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 10:02:16,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-10 10:02:16,603 INFO L87 Difference]: Start difference. First operand 106 states and 147 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 10:02:17,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:02:17,030 INFO L93 Difference]: Finished difference Result 237 states and 326 transitions. [2024-11-10 10:02:17,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 10:02:17,032 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 127 [2024-11-10 10:02:17,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:02:17,033 INFO L225 Difference]: With dead ends: 237 [2024-11-10 10:02:17,033 INFO L226 Difference]: Without dead ends: 134 [2024-11-10 10:02:17,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-10 10:02:17,033 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 241 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 10:02:17,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 424 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 10:02:17,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-10 10:02:17,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 106. [2024-11-10 10:02:17,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 90 states have (on average 1.3111111111111111) internal successors, (118), 90 states have internal predecessors, (118), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-10 10:02:17,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 146 transitions. [2024-11-10 10:02:17,056 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 146 transitions. Word has length 127 [2024-11-10 10:02:17,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:02:17,056 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 146 transitions. [2024-11-10 10:02:17,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 10:02:17,057 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 146 transitions. [2024-11-10 10:02:17,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-10 10:02:17,058 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:02:17,059 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:02:17,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 10:02:17,060 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:02:17,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:02:17,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1728705870, now seen corresponding path program 1 times [2024-11-10 10:02:17,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:02:17,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322911559] [2024-11-10 10:02:17,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:02:17,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:02:17,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:18,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 10:02:18,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:18,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 10:02:18,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:18,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 10:02:18,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:18,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 10:02:18,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:18,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 10:02:18,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:18,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 10:02:18,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:18,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 10:02:18,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:18,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 10:02:18,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:18,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 10:02:18,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:18,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 10:02:18,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:18,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 10:02:18,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:18,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 10:02:18,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:18,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 10:02:18,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:18,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 10:02:18,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:18,711 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 10:02:18,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:02:18,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322911559] [2024-11-10 10:02:18,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322911559] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:02:18,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:02:18,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-10 10:02:18,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520533927] [2024-11-10 10:02:18,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:02:18,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 10:02:18,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:02:18,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 10:02:18,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-11-10 10:02:18,713 INFO L87 Difference]: Start difference. First operand 106 states and 146 transitions. Second operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 10:02:19,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:02:19,946 INFO L93 Difference]: Finished difference Result 243 states and 331 transitions. [2024-11-10 10:02:19,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 10:02:19,948 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 127 [2024-11-10 10:02:19,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:02:19,949 INFO L225 Difference]: With dead ends: 243 [2024-11-10 10:02:19,949 INFO L226 Difference]: Without dead ends: 140 [2024-11-10 10:02:19,950 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2024-11-10 10:02:19,950 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 403 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 10:02:19,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 790 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 10:02:19,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-10 10:02:19,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 110. [2024-11-10 10:02:19,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 94 states have (on average 1.3085106382978724) internal successors, (123), 94 states have internal predecessors, (123), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-10 10:02:19,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 151 transitions. [2024-11-10 10:02:19,972 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 151 transitions. Word has length 127 [2024-11-10 10:02:19,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:02:19,973 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 151 transitions. [2024-11-10 10:02:19,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 10:02:19,973 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 151 transitions. [2024-11-10 10:02:19,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-10 10:02:19,974 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:02:19,974 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:02:19,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 10:02:19,975 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:02:19,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:02:19,975 INFO L85 PathProgramCache]: Analyzing trace with hash -966346632, now seen corresponding path program 1 times [2024-11-10 10:02:19,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:02:19,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622407194] [2024-11-10 10:02:19,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:02:19,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:02:20,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:20,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 10:02:20,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:20,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 10:02:20,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:20,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 10:02:20,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:20,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 10:02:20,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:20,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 10:02:20,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:20,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 10:02:20,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:20,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 10:02:20,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:20,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 10:02:20,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:20,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 10:02:20,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:20,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 10:02:20,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:20,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 10:02:20,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:20,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 10:02:20,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:20,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 10:02:20,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:20,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 10:02:20,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:20,403 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 10:02:20,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:02:20,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622407194] [2024-11-10 10:02:20,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622407194] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:02:20,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:02:20,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 10:02:20,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859681770] [2024-11-10 10:02:20,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:02:20,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 10:02:20,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:02:20,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 10:02:20,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 10:02:20,405 INFO L87 Difference]: Start difference. First operand 110 states and 151 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 10:02:20,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:02:20,578 INFO L93 Difference]: Finished difference Result 257 states and 350 transitions. [2024-11-10 10:02:20,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 10:02:20,578 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 129 [2024-11-10 10:02:20,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:02:20,579 INFO L225 Difference]: With dead ends: 257 [2024-11-10 10:02:20,579 INFO L226 Difference]: Without dead ends: 150 [2024-11-10 10:02:20,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-10 10:02:20,580 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 45 mSDsluCounter, 828 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 982 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 10:02:20,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 982 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 10:02:20,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-10 10:02:20,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 117. [2024-11-10 10:02:20,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 101 states have (on average 1.297029702970297) internal successors, (131), 101 states have internal predecessors, (131), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-10 10:02:20,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 159 transitions. [2024-11-10 10:02:20,591 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 159 transitions. Word has length 129 [2024-11-10 10:02:20,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:02:20,591 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 159 transitions. [2024-11-10 10:02:20,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 10:02:20,591 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 159 transitions. [2024-11-10 10:02:20,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-10 10:02:20,592 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:02:20,592 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:02:20,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 10:02:20,593 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:02:20,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:02:20,593 INFO L85 PathProgramCache]: Analyzing trace with hash 440695344, now seen corresponding path program 1 times [2024-11-10 10:02:20,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:02:20,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097992261] [2024-11-10 10:02:20,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:02:20,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:02:20,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:23,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 10:02:23,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:23,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 10:02:23,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:23,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 10:02:23,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:23,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 10:02:23,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:23,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 10:02:23,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:23,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 10:02:23,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:23,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 10:02:23,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:23,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 10:02:23,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:23,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 10:02:23,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:23,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 10:02:23,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:23,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 10:02:23,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:23,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 10:02:23,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:23,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 10:02:23,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:23,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 10:02:23,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:23,226 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-10 10:02:23,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:02:23,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097992261] [2024-11-10 10:02:23,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097992261] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:02:23,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:02:23,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-11-10 10:02:23,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392806628] [2024-11-10 10:02:23,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:02:23,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-10 10:02:23,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:02:23,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-10 10:02:23,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2024-11-10 10:02:23,229 INFO L87 Difference]: Start difference. First operand 117 states and 159 transitions. Second operand has 20 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 20 states have internal predecessors, (65), 3 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-10 10:02:26,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:02:26,365 INFO L93 Difference]: Finished difference Result 290 states and 398 transitions. [2024-11-10 10:02:26,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-10 10:02:26,366 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 20 states have internal predecessors, (65), 3 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 129 [2024-11-10 10:02:26,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:02:26,367 INFO L225 Difference]: With dead ends: 290 [2024-11-10 10:02:26,367 INFO L226 Difference]: Without dead ends: 176 [2024-11-10 10:02:26,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=201, Invalid=1281, Unknown=0, NotChecked=0, Total=1482 [2024-11-10 10:02:26,368 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 427 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 1228 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 1334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 1228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-10 10:02:26,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 801 Invalid, 1334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 1228 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-10 10:02:26,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-10 10:02:26,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 168. [2024-11-10 10:02:26,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 139 states have (on average 1.3021582733812949) internal successors, (181), 140 states have internal predecessors, (181), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 10:02:26,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 233 transitions. [2024-11-10 10:02:26,387 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 233 transitions. Word has length 129 [2024-11-10 10:02:26,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:02:26,387 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 233 transitions. [2024-11-10 10:02:26,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 20 states have internal predecessors, (65), 3 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-10 10:02:26,388 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 233 transitions. [2024-11-10 10:02:26,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-10 10:02:26,388 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:02:26,388 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:02:26,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 10:02:26,389 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:02:26,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:02:26,389 INFO L85 PathProgramCache]: Analyzing trace with hash -69838833, now seen corresponding path program 1 times [2024-11-10 10:02:26,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:02:26,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892491811] [2024-11-10 10:02:26,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:02:26,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:02:26,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:27,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 10:02:27,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:27,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 10:02:27,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:27,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 10:02:27,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:27,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 10:02:27,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:27,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 10:02:27,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:27,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 10:02:27,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:27,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 10:02:27,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:27,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 10:02:27,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:27,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 10:02:27,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:27,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 10:02:27,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:27,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 10:02:27,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:27,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 10:02:27,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:27,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 10:02:27,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:27,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 10:02:27,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:27,990 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 10:02:27,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:02:27,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892491811] [2024-11-10 10:02:27,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892491811] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:02:27,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:02:27,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-10 10:02:27,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605084617] [2024-11-10 10:02:27,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:02:27,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 10:02:27,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:02:27,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 10:02:27,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-11-10 10:02:27,992 INFO L87 Difference]: Start difference. First operand 168 states and 233 transitions. Second operand has 14 states, 13 states have (on average 4.769230769230769) internal successors, (62), 14 states have internal predecessors, (62), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-10 10:02:29,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:02:29,062 INFO L93 Difference]: Finished difference Result 282 states and 389 transitions. [2024-11-10 10:02:29,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 10:02:29,062 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.769230769230769) internal successors, (62), 14 states have internal predecessors, (62), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 129 [2024-11-10 10:02:29,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:02:29,064 INFO L225 Difference]: With dead ends: 282 [2024-11-10 10:02:29,065 INFO L226 Difference]: Without dead ends: 167 [2024-11-10 10:02:29,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2024-11-10 10:02:29,066 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 155 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 10:02:29,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 504 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 10:02:29,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-10 10:02:29,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2024-11-10 10:02:29,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 138 states have (on average 1.2971014492753623) internal successors, (179), 139 states have internal predecessors, (179), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 10:02:29,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 231 transitions. [2024-11-10 10:02:29,086 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 231 transitions. Word has length 129 [2024-11-10 10:02:29,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:02:29,087 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 231 transitions. [2024-11-10 10:02:29,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.769230769230769) internal successors, (62), 14 states have internal predecessors, (62), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-10 10:02:29,087 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 231 transitions. [2024-11-10 10:02:29,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-10 10:02:29,088 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:02:29,088 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:02:29,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 10:02:29,088 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:02:29,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:02:29,089 INFO L85 PathProgramCache]: Analyzing trace with hash 427629974, now seen corresponding path program 1 times [2024-11-10 10:02:29,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:02:29,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682547497] [2024-11-10 10:02:29,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:02:29,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:02:29,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:29,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 10:02:29,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:29,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 10:02:29,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:29,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 10:02:29,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:29,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 10:02:29,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:29,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 10:02:29,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:29,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 10:02:29,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:29,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 10:02:29,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:29,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 10:02:29,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:29,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 10:02:29,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:29,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 10:02:29,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:29,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 10:02:29,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:29,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 10:02:29,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:29,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 10:02:29,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:29,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 10:02:29,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:29,859 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 10:02:29,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:02:29,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682547497] [2024-11-10 10:02:29,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682547497] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:02:29,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:02:29,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 10:02:29,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589492644] [2024-11-10 10:02:29,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:02:29,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 10:02:29,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:02:29,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 10:02:29,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-10 10:02:29,862 INFO L87 Difference]: Start difference. First operand 167 states and 231 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 10:02:30,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:02:30,392 INFO L93 Difference]: Finished difference Result 281 states and 386 transitions. [2024-11-10 10:02:30,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 10:02:30,393 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 129 [2024-11-10 10:02:30,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:02:30,394 INFO L225 Difference]: With dead ends: 281 [2024-11-10 10:02:30,394 INFO L226 Difference]: Without dead ends: 167 [2024-11-10 10:02:30,394 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2024-11-10 10:02:30,395 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 137 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 10:02:30,395 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 463 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 10:02:30,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-10 10:02:30,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2024-11-10 10:02:30,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 138 states have (on average 1.289855072463768) internal successors, (178), 139 states have internal predecessors, (178), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 10:02:30,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 230 transitions. [2024-11-10 10:02:30,432 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 230 transitions. Word has length 129 [2024-11-10 10:02:30,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:02:30,433 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 230 transitions. [2024-11-10 10:02:30,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 10:02:30,433 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 230 transitions. [2024-11-10 10:02:30,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-10 10:02:30,434 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:02:30,434 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:02:30,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 10:02:30,435 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:02:30,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:02:30,435 INFO L85 PathProgramCache]: Analyzing trace with hash 134226967, now seen corresponding path program 1 times [2024-11-10 10:02:30,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:02:30,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365222103] [2024-11-10 10:02:30,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:02:30,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:02:30,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:33,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 10:02:33,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:33,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 10:02:33,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:33,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 10:02:33,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:33,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 10:02:33,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:33,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 10:02:33,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:33,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 10:02:33,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:33,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 10:02:33,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:33,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 10:02:33,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:33,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 10:02:33,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:33,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 10:02:33,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:33,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 10:02:33,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:33,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 10:02:33,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:33,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 10:02:33,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:33,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 10:02:33,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:33,604 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 10:02:33,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:02:33,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365222103] [2024-11-10 10:02:33,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365222103] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:02:33,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:02:33,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2024-11-10 10:02:33,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950898987] [2024-11-10 10:02:33,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:02:33,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-10 10:02:33,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:02:33,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-10 10:02:33,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2024-11-10 10:02:33,606 INFO L87 Difference]: Start difference. First operand 167 states and 230 transitions. Second operand has 21 states, 20 states have (on average 3.1) internal successors, (62), 21 states have internal predecessors, (62), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-10 10:02:43,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:02:43,657 INFO L93 Difference]: Finished difference Result 334 states and 447 transitions. [2024-11-10 10:02:43,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-10 10:02:43,658 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.1) internal successors, (62), 21 states have internal predecessors, (62), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 129 [2024-11-10 10:02:43,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:02:43,659 INFO L225 Difference]: With dead ends: 334 [2024-11-10 10:02:43,660 INFO L226 Difference]: Without dead ends: 220 [2024-11-10 10:02:43,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=365, Invalid=1275, Unknown=0, NotChecked=0, Total=1640 [2024-11-10 10:02:43,661 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 615 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 1281 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 1309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-10 10:02:43,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 891 Invalid, 1309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1281 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-10 10:02:43,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-11-10 10:02:43,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 169. [2024-11-10 10:02:43,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 140 states have (on average 1.2857142857142858) internal successors, (180), 141 states have internal predecessors, (180), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 10:02:43,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 232 transitions. [2024-11-10 10:02:43,679 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 232 transitions. Word has length 129 [2024-11-10 10:02:43,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:02:43,680 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 232 transitions. [2024-11-10 10:02:43,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.1) internal successors, (62), 21 states have internal predecessors, (62), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-10 10:02:43,680 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 232 transitions. [2024-11-10 10:02:43,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-10 10:02:43,681 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:02:43,681 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:02:43,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 10:02:43,681 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:02:43,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:02:43,682 INFO L85 PathProgramCache]: Analyzing trace with hash 105597816, now seen corresponding path program 1 times [2024-11-10 10:02:43,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:02:43,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941793061] [2024-11-10 10:02:43,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:02:43,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:02:43,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:45,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 10:02:45,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:45,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 10:02:45,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:45,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 10:02:45,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:45,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 10:02:45,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:45,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 10:02:45,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:45,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 10:02:45,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:45,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 10:02:45,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:45,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 10:02:45,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:45,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 10:02:45,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:45,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 10:02:45,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:45,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 10:02:45,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:45,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 10:02:45,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:45,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 10:02:45,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:45,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 10:02:45,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:45,833 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 10:02:45,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:02:45,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941793061] [2024-11-10 10:02:45,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941793061] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:02:45,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:02:45,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-10 10:02:45,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055837880] [2024-11-10 10:02:45,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:02:45,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-10 10:02:45,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:02:45,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-10 10:02:45,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2024-11-10 10:02:45,835 INFO L87 Difference]: Start difference. First operand 169 states and 232 transitions. Second operand has 16 states, 15 states have (on average 4.133333333333334) internal successors, (62), 16 states have internal predecessors, (62), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-10 10:02:46,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:02:46,989 INFO L93 Difference]: Finished difference Result 175 states and 238 transitions. [2024-11-10 10:02:46,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 10:02:46,989 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.133333333333334) internal successors, (62), 16 states have internal predecessors, (62), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 129 [2024-11-10 10:02:46,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:02:46,991 INFO L225 Difference]: With dead ends: 175 [2024-11-10 10:02:46,991 INFO L226 Difference]: Without dead ends: 172 [2024-11-10 10:02:46,991 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=130, Invalid=422, Unknown=0, NotChecked=0, Total=552 [2024-11-10 10:02:46,992 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 434 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 10:02:46,992 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 511 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 10:02:46,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-10 10:02:47,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2024-11-10 10:02:47,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 143 states have (on average 1.2797202797202798) internal successors, (183), 144 states have internal predecessors, (183), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 10:02:47,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 235 transitions. [2024-11-10 10:02:47,012 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 235 transitions. Word has length 129 [2024-11-10 10:02:47,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:02:47,012 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 235 transitions. [2024-11-10 10:02:47,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.133333333333334) internal successors, (62), 16 states have internal predecessors, (62), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-10 10:02:47,013 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 235 transitions. [2024-11-10 10:02:47,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-10 10:02:47,014 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:02:47,014 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:02:47,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 10:02:47,014 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:02:47,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:02:47,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1877037302, now seen corresponding path program 1 times [2024-11-10 10:02:47,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:02:47,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524822652] [2024-11-10 10:02:47,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:02:47,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:02:47,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 10:02:47,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1877609922] [2024-11-10 10:02:47,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:02:47,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:02:47,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:02:47,098 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 10:02:47,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 10:02:48,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 10:02:48,979 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 10:02:51,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 10:02:51,932 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 10:02:51,932 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 10:02:51,933 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 10:02:51,948 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 10:02:52,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-10 10:02:52,143 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:02:52,305 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 10:02:52,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 10:02:52 BoogieIcfgContainer [2024-11-10 10:02:52,309 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 10:02:52,309 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 10:02:52,309 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 10:02:52,309 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 10:02:52,310 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:02:07" (3/4) ... [2024-11-10 10:02:52,311 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 10:02:52,312 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 10:02:52,313 INFO L158 Benchmark]: Toolchain (without parser) took 45720.63ms. Allocated memory was 180.4MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 109.3MB in the beginning and 1.2GB in the end (delta: -1.1GB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 10:02:52,313 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 180.4MB. Free memory is still 137.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 10:02:52,313 INFO L158 Benchmark]: CACSL2BoogieTranslator took 427.15ms. Allocated memory is still 180.4MB. Free memory was 109.1MB in the beginning and 147.8MB in the end (delta: -38.7MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. [2024-11-10 10:02:52,314 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.77ms. Allocated memory is still 180.4MB. Free memory was 147.8MB in the beginning and 143.6MB in the end (delta: 4.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 10:02:52,314 INFO L158 Benchmark]: Boogie Preprocessor took 66.13ms. Allocated memory is still 180.4MB. Free memory was 143.6MB in the beginning and 140.3MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 10:02:52,314 INFO L158 Benchmark]: IcfgBuilder took 709.74ms. Allocated memory is still 180.4MB. Free memory was 140.3MB in the beginning and 105.9MB in the end (delta: 34.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-10 10:02:52,314 INFO L158 Benchmark]: TraceAbstraction took 44438.19ms. Allocated memory was 180.4MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 104.7MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 737.2MB. Max. memory is 16.1GB. [2024-11-10 10:02:52,315 INFO L158 Benchmark]: Witness Printer took 3.16ms. Allocated memory is still 1.3GB. Free memory is still 1.2GB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 10:02:52,316 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.15ms. Allocated memory is still 180.4MB. Free memory is still 137.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 427.15ms. Allocated memory is still 180.4MB. Free memory was 109.1MB in the beginning and 147.8MB in the end (delta: -38.7MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.77ms. Allocated memory is still 180.4MB. Free memory was 147.8MB in the beginning and 143.6MB in the end (delta: 4.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.13ms. Allocated memory is still 180.4MB. Free memory was 143.6MB in the beginning and 140.3MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 709.74ms. Allocated memory is still 180.4MB. Free memory was 140.3MB in the beginning and 105.9MB in the end (delta: 34.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 44438.19ms. Allocated memory was 180.4MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 104.7MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 737.2MB. Max. memory is 16.1GB. * Witness Printer took 3.16ms. Allocated memory is still 1.3GB. Free memory is still 1.2GB. 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 129, overapproximation of someBinaryArithmeticFLOAToperation at line 93. Possible FailurePath: [L39] unsigned char isInitial = 0; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 0, 0, 0, 64, 2.4, 127.75, 0.0, 31.4, 256.75, 256.6, 0, 32, 100 }; [L57] unsigned char* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L58] unsigned char* WrapperStruct00_var_1_4_Pointer = &(WrapperStruct00.var_1_4); [L59] unsigned char* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L60] unsigned char* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L61] unsigned char* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L62] signed long int* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L63] float* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L64] float* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L65] float* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L66] float* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L67] float* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L68] float* WrapperStruct00_var_1_17_Pointer = &(WrapperStruct00.var_1_17); [L69] signed long int* WrapperStruct00_var_1_18_Pointer = &(WrapperStruct00.var_1_18); [L70] unsigned char* WrapperStruct00_var_1_19_Pointer = &(WrapperStruct00.var_1_19); [L71] unsigned char* WrapperStruct00_var_1_20_Pointer = &(WrapperStruct00.var_1_20); VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=0] [L133] isInitial = 1 [L134] FCALL initially() [L135] COND TRUE 1 [L136] FCALL updateLastVariables() [L137] CALL updateVariables() [L102] WrapperStruct00.var_1_4 = __VERIFIER_nondet_uchar() [L103] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L104] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L105] WrapperStruct00.var_1_5 = __VERIFIER_nondet_uchar() [L106] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L107] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L108] WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar() [L109] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L110] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L111] WrapperStruct00.var_1_7 = __VERIFIER_nondet_uchar() [L112] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L113] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L114] WrapperStruct00.var_1_13 = __VERIFIER_nondet_float() [L115] EXPR WrapperStruct00.var_1_13 [L115] EXPR WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F [L115] EXPR WrapperStruct00.var_1_13 [L115] EXPR WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L115] EXPR (WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L115] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L115] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L116] WrapperStruct00.var_1_14 = __VERIFIER_nondet_float() [L117] EXPR WrapperStruct00.var_1_14 [L117] EXPR WrapperStruct00.var_1_14 >= 2305843.009213691390e+12F && WrapperStruct00.var_1_14 <= -1.0e-20F [L117] EXPR WrapperStruct00.var_1_14 [L117] EXPR WrapperStruct00.var_1_14 >= 2305843.009213691390e+12F && WrapperStruct00.var_1_14 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L117] EXPR (WrapperStruct00.var_1_14 >= 2305843.009213691390e+12F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L117] CALL assume_abort_if_not((WrapperStruct00.var_1_14 >= 2305843.009213691390e+12F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L117] RET assume_abort_if_not((WrapperStruct00.var_1_14 >= 2305843.009213691390e+12F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L118] WrapperStruct00.var_1_15 = __VERIFIER_nondet_float() [L119] EXPR WrapperStruct00.var_1_15 [L119] EXPR WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F [L119] EXPR WrapperStruct00.var_1_15 [L119] EXPR WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L119] EXPR (WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L119] CALL assume_abort_if_not((WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L119] RET assume_abort_if_not((WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L120] WrapperStruct00.var_1_16 = __VERIFIER_nondet_float() [L121] EXPR WrapperStruct00.var_1_16 [L121] EXPR WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F [L121] EXPR WrapperStruct00.var_1_16 [L121] EXPR WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L121] EXPR (WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L121] CALL assume_abort_if_not((WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L121] RET assume_abort_if_not((WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L122] WrapperStruct00.var_1_20 = __VERIFIER_nondet_uchar() [L123] EXPR WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L123] CALL assume_abort_if_not(WrapperStruct00.var_1_20 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L123] RET assume_abort_if_not(WrapperStruct00.var_1_20 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L124] EXPR WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L124] CALL assume_abort_if_not(WrapperStruct00.var_1_20 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, \old(cond)=1, isInitial=1] [L124] RET assume_abort_if_not(WrapperStruct00.var_1_20 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L137] RET updateVariables() [L138] CALL step() [L75] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L75] (*(WrapperStruct00_var_1_17_Pointer)) = (*(WrapperStruct00_var_1_14_Pointer)) [L76] EXPR \read(*WrapperStruct00_var_1_20_Pointer) [L76] (*(WrapperStruct00_var_1_19_Pointer)) = (*(WrapperStruct00_var_1_20_Pointer)) [L77] EXPR \read(*WrapperStruct00_var_1_19_Pointer) [L77] (*(WrapperStruct00_var_1_18_Pointer)) = (*(WrapperStruct00_var_1_19_Pointer)) [L78] EXPR \read(*WrapperStruct00_var_1_19_Pointer) [L78] unsigned char stepLocal_1 = (*(WrapperStruct00_var_1_19_Pointer)); [L79] EXPR \read(*WrapperStruct00_var_1_18_Pointer) [L79] EXPR \read(*WrapperStruct00_var_1_18_Pointer) [L79] EXPR \read(*WrapperStruct00_var_1_19_Pointer) [L79] EXPR \read(*WrapperStruct00_var_1_19_Pointer) [L79] signed long int stepLocal_0 = ((*(WrapperStruct00_var_1_18_Pointer)) * (*(WrapperStruct00_var_1_18_Pointer))) * ((*(WrapperStruct00_var_1_19_Pointer)) - (*(WrapperStruct00_var_1_19_Pointer))); [L80] COND FALSE !(stepLocal_0 >= 1u) [L87] EXPR \read(*WrapperStruct00_var_1_19_Pointer) [L87] (*(WrapperStruct00_var_1_8_Pointer)) = (*(WrapperStruct00_var_1_19_Pointer)) [L89] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L89] signed long int stepLocal_2 = (*(WrapperStruct00_var_1_8_Pointer)); [L90] EXPR \read(*WrapperStruct00_var_1_19_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1, stepLocal_1=518, stepLocal_2=6] [L90] COND FALSE !((*(WrapperStruct00_var_1_19_Pointer)) > stepLocal_2) [L93] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L93] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L93] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L93] (*(WrapperStruct00_var_1_12_Pointer)) = ((*(WrapperStruct00_var_1_16_Pointer)) - ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))) [L95] EXPR \read(*WrapperStruct00_var_1_18_Pointer) [L95] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1, stepLocal_1=518] [L95] COND FALSE !((*(WrapperStruct00_var_1_18_Pointer)) >= (8u * (*(WrapperStruct00_var_1_8_Pointer)))) [L98] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L98] (*(WrapperStruct00_var_1_1_Pointer)) = (*(WrapperStruct00_var_1_7_Pointer)) [L138] RET step() [L139] CALL, EXPR property() [L129] EXPR \read(*WrapperStruct00_var_1_18_Pointer) [L129] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L129] EXPR ((*(WrapperStruct00_var_1_18_Pointer)) >= (8u * (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (! ((*(WrapperStruct00_var_1_4_Pointer)) || ((*(WrapperStruct00_var_1_5_Pointer)) || (*(WrapperStruct00_var_1_6_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer)))) [L129] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L129] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L129] EXPR ((*(WrapperStruct00_var_1_18_Pointer)) >= (8u * (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (! ((*(WrapperStruct00_var_1_4_Pointer)) || ((*(WrapperStruct00_var_1_5_Pointer)) || (*(WrapperStruct00_var_1_6_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L129] EXPR (((*(WrapperStruct00_var_1_18_Pointer)) >= (8u * (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (! ((*(WrapperStruct00_var_1_4_Pointer)) || ((*(WrapperStruct00_var_1_5_Pointer)) || (*(WrapperStruct00_var_1_6_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer))))) && (((((*(WrapperStruct00_var_1_18_Pointer)) * (*(WrapperStruct00_var_1_18_Pointer))) * ((*(WrapperStruct00_var_1_19_Pointer)) - (*(WrapperStruct00_var_1_19_Pointer)))) >= 1u) ? (((*(WrapperStruct00_var_1_18_Pointer)) <= (*(WrapperStruct00_var_1_19_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer))))) [L129] EXPR \read(*WrapperStruct00_var_1_18_Pointer) [L129] EXPR \read(*WrapperStruct00_var_1_18_Pointer) [L129] EXPR \read(*WrapperStruct00_var_1_19_Pointer) [L129] EXPR \read(*WrapperStruct00_var_1_19_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L129] EXPR ((((*(WrapperStruct00_var_1_18_Pointer)) * (*(WrapperStruct00_var_1_18_Pointer))) * ((*(WrapperStruct00_var_1_19_Pointer)) - (*(WrapperStruct00_var_1_19_Pointer)))) >= 1u) ? (((*(WrapperStruct00_var_1_18_Pointer)) <= (*(WrapperStruct00_var_1_19_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))) [L129] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L129] EXPR \read(*WrapperStruct00_var_1_19_Pointer) [L129] EXPR ((((*(WrapperStruct00_var_1_18_Pointer)) * (*(WrapperStruct00_var_1_18_Pointer))) * ((*(WrapperStruct00_var_1_19_Pointer)) - (*(WrapperStruct00_var_1_19_Pointer)))) >= 1u) ? (((*(WrapperStruct00_var_1_18_Pointer)) <= (*(WrapperStruct00_var_1_19_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L129] EXPR (((*(WrapperStruct00_var_1_18_Pointer)) >= (8u * (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (! ((*(WrapperStruct00_var_1_4_Pointer)) || ((*(WrapperStruct00_var_1_5_Pointer)) || (*(WrapperStruct00_var_1_6_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer))))) && (((((*(WrapperStruct00_var_1_18_Pointer)) * (*(WrapperStruct00_var_1_18_Pointer))) * ((*(WrapperStruct00_var_1_19_Pointer)) - (*(WrapperStruct00_var_1_19_Pointer)))) >= 1u) ? (((*(WrapperStruct00_var_1_18_Pointer)) <= (*(WrapperStruct00_var_1_19_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L129] EXPR ((((*(WrapperStruct00_var_1_18_Pointer)) >= (8u * (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (! ((*(WrapperStruct00_var_1_4_Pointer)) || ((*(WrapperStruct00_var_1_5_Pointer)) || (*(WrapperStruct00_var_1_6_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer))))) && (((((*(WrapperStruct00_var_1_18_Pointer)) * (*(WrapperStruct00_var_1_18_Pointer))) * ((*(WrapperStruct00_var_1_19_Pointer)) - (*(WrapperStruct00_var_1_19_Pointer)))) >= 1u) ? (((*(WrapperStruct00_var_1_18_Pointer)) <= (*(WrapperStruct00_var_1_19_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))))) && (((*(WrapperStruct00_var_1_19_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) + (((*(WrapperStruct00_var_1_14_Pointer)) - (*(WrapperStruct00_var_1_15_Pointer))) - (*(WrapperStruct00_var_1_16_Pointer)))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_16_Pointer)) - ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))))) [L129] EXPR \read(*WrapperStruct00_var_1_19_Pointer) [L129] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L129] EXPR ((*(WrapperStruct00_var_1_19_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) + (((*(WrapperStruct00_var_1_14_Pointer)) - (*(WrapperStruct00_var_1_15_Pointer))) - (*(WrapperStruct00_var_1_16_Pointer)))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_16_Pointer)) - ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))))) [L129] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L129] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L129] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L129] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L129] EXPR ((*(WrapperStruct00_var_1_19_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) + (((*(WrapperStruct00_var_1_14_Pointer)) - (*(WrapperStruct00_var_1_15_Pointer))) - (*(WrapperStruct00_var_1_16_Pointer)))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_16_Pointer)) - ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L129] EXPR ((((*(WrapperStruct00_var_1_18_Pointer)) >= (8u * (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (! ((*(WrapperStruct00_var_1_4_Pointer)) || ((*(WrapperStruct00_var_1_5_Pointer)) || (*(WrapperStruct00_var_1_6_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer))))) && (((((*(WrapperStruct00_var_1_18_Pointer)) * (*(WrapperStruct00_var_1_18_Pointer))) * ((*(WrapperStruct00_var_1_19_Pointer)) - (*(WrapperStruct00_var_1_19_Pointer)))) >= 1u) ? (((*(WrapperStruct00_var_1_18_Pointer)) <= (*(WrapperStruct00_var_1_19_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))))) && (((*(WrapperStruct00_var_1_19_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) + (((*(WrapperStruct00_var_1_14_Pointer)) - (*(WrapperStruct00_var_1_15_Pointer))) - (*(WrapperStruct00_var_1_16_Pointer)))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_16_Pointer)) - ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L129] EXPR (((((*(WrapperStruct00_var_1_18_Pointer)) >= (8u * (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (! ((*(WrapperStruct00_var_1_4_Pointer)) || ((*(WrapperStruct00_var_1_5_Pointer)) || (*(WrapperStruct00_var_1_6_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer))))) && (((((*(WrapperStruct00_var_1_18_Pointer)) * (*(WrapperStruct00_var_1_18_Pointer))) * ((*(WrapperStruct00_var_1_19_Pointer)) - (*(WrapperStruct00_var_1_19_Pointer)))) >= 1u) ? (((*(WrapperStruct00_var_1_18_Pointer)) <= (*(WrapperStruct00_var_1_19_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))))) && (((*(WrapperStruct00_var_1_19_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) + (((*(WrapperStruct00_var_1_14_Pointer)) - (*(WrapperStruct00_var_1_15_Pointer))) - (*(WrapperStruct00_var_1_16_Pointer)))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_16_Pointer)) - ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((float) (*(WrapperStruct00_var_1_14_Pointer)))) [L129] EXPR \read(*WrapperStruct00_var_1_17_Pointer) [L129] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L129] EXPR (((((*(WrapperStruct00_var_1_18_Pointer)) >= (8u * (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (! ((*(WrapperStruct00_var_1_4_Pointer)) || ((*(WrapperStruct00_var_1_5_Pointer)) || (*(WrapperStruct00_var_1_6_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer))))) && (((((*(WrapperStruct00_var_1_18_Pointer)) * (*(WrapperStruct00_var_1_18_Pointer))) * ((*(WrapperStruct00_var_1_19_Pointer)) - (*(WrapperStruct00_var_1_19_Pointer)))) >= 1u) ? (((*(WrapperStruct00_var_1_18_Pointer)) <= (*(WrapperStruct00_var_1_19_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))))) && (((*(WrapperStruct00_var_1_19_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) + (((*(WrapperStruct00_var_1_14_Pointer)) - (*(WrapperStruct00_var_1_15_Pointer))) - (*(WrapperStruct00_var_1_16_Pointer)))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_16_Pointer)) - ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((float) (*(WrapperStruct00_var_1_14_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L129] EXPR ((((((*(WrapperStruct00_var_1_18_Pointer)) >= (8u * (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (! ((*(WrapperStruct00_var_1_4_Pointer)) || ((*(WrapperStruct00_var_1_5_Pointer)) || (*(WrapperStruct00_var_1_6_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer))))) && (((((*(WrapperStruct00_var_1_18_Pointer)) * (*(WrapperStruct00_var_1_18_Pointer))) * ((*(WrapperStruct00_var_1_19_Pointer)) - (*(WrapperStruct00_var_1_19_Pointer)))) >= 1u) ? (((*(WrapperStruct00_var_1_18_Pointer)) <= (*(WrapperStruct00_var_1_19_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))))) && (((*(WrapperStruct00_var_1_19_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) + (((*(WrapperStruct00_var_1_14_Pointer)) - (*(WrapperStruct00_var_1_15_Pointer))) - (*(WrapperStruct00_var_1_16_Pointer)))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_16_Pointer)) - ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((float) (*(WrapperStruct00_var_1_14_Pointer))))) && ((*(WrapperStruct00_var_1_18_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L129] EXPR (((((((*(WrapperStruct00_var_1_18_Pointer)) >= (8u * (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (! ((*(WrapperStruct00_var_1_4_Pointer)) || ((*(WrapperStruct00_var_1_5_Pointer)) || (*(WrapperStruct00_var_1_6_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer))))) && (((((*(WrapperStruct00_var_1_18_Pointer)) * (*(WrapperStruct00_var_1_18_Pointer))) * ((*(WrapperStruct00_var_1_19_Pointer)) - (*(WrapperStruct00_var_1_19_Pointer)))) >= 1u) ? (((*(WrapperStruct00_var_1_18_Pointer)) <= (*(WrapperStruct00_var_1_19_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))))) && (((*(WrapperStruct00_var_1_19_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) + (((*(WrapperStruct00_var_1_14_Pointer)) - (*(WrapperStruct00_var_1_15_Pointer))) - (*(WrapperStruct00_var_1_16_Pointer)))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_16_Pointer)) - ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((float) (*(WrapperStruct00_var_1_14_Pointer))))) && ((*(WrapperStruct00_var_1_18_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer))))) && ((*(WrapperStruct00_var_1_19_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_20_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L129-L130] return (((((((*(WrapperStruct00_var_1_18_Pointer)) >= (8u * (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (! ((*(WrapperStruct00_var_1_4_Pointer)) || ((*(WrapperStruct00_var_1_5_Pointer)) || (*(WrapperStruct00_var_1_6_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer))))) && (((((*(WrapperStruct00_var_1_18_Pointer)) * (*(WrapperStruct00_var_1_18_Pointer))) * ((*(WrapperStruct00_var_1_19_Pointer)) - (*(WrapperStruct00_var_1_19_Pointer)))) >= 1u) ? (((*(WrapperStruct00_var_1_18_Pointer)) <= (*(WrapperStruct00_var_1_19_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer)))))) && (((*(WrapperStruct00_var_1_19_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) + (((*(WrapperStruct00_var_1_14_Pointer)) - (*(WrapperStruct00_var_1_15_Pointer))) - (*(WrapperStruct00_var_1_16_Pointer)))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_16_Pointer)) - ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((float) (*(WrapperStruct00_var_1_14_Pointer))))) && ((*(WrapperStruct00_var_1_18_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_19_Pointer))))) && ((*(WrapperStruct00_var_1_19_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_20_Pointer)))) ; [L139] RET, EXPR property() [L139] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_13_Pointer={4:13}, WrapperStruct00_var_1_14_Pointer={4:17}, WrapperStruct00_var_1_15_Pointer={4:21}, WrapperStruct00_var_1_16_Pointer={4:25}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_18_Pointer={4:33}, WrapperStruct00_var_1_19_Pointer={4:37}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:38}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 103 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 44.2s, OverallIterations: 15, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 19.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3140 SdHoareTripleChecker+Valid, 8.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3138 mSDsluCounter, 7612 SdHoareTripleChecker+Invalid, 7.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6016 mSDsCounter, 273 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5903 IncrementalHoareTripleChecker+Invalid, 6176 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 273 mSolverCounterUnsat, 1596 mSDtfsCounter, 5903 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 635 GetRequests, 433 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 651 ImplicationChecksByTransitivity, 13.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=172occurred in iteration=14, InterpolantAutomatonStates: 131, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 226 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 17.4s InterpolantComputationTime, 2038 NumberOfCodeBlocks, 2038 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1766 ConstructedInterpolants, 0 QuantifiedInterpolants, 28112 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 5096/5096 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 10:02:52,482 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-sp_file-8.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 2adf86622f346d8406b4270c76c12e01b0cd0b4263eaaf0f4abdb5436079ce86 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 10:02:54,460 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 10:02:54,518 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 10:02:54,523 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 10:02:54,524 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 10:02:54,553 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 10:02:54,554 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 10:02:54,554 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 10:02:54,555 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 10:02:54,555 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 10:02:54,555 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 10:02:54,556 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 10:02:54,556 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 10:02:54,556 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 10:02:54,557 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 10:02:54,557 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 10:02:54,558 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 10:02:54,559 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 10:02:54,559 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 10:02:54,559 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 10:02:54,559 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 10:02:54,560 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 10:02:54,560 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 10:02:54,560 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 10:02:54,561 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 10:02:54,561 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 10:02:54,561 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 10:02:54,562 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 10:02:54,562 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 10:02:54,562 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 10:02:54,562 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 10:02:54,563 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 10:02:54,563 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 10:02:54,563 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 10:02:54,563 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:02:54,564 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 10:02:54,564 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 10:02:54,564 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 10:02:54,565 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 10:02:54,565 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 10:02:54,565 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 10:02:54,566 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 10:02:54,566 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 10:02:54,566 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 10:02:54,566 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 -> 2adf86622f346d8406b4270c76c12e01b0cd0b4263eaaf0f4abdb5436079ce86 [2024-11-10 10:02:54,844 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 10:02:54,867 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 10:02:54,870 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 10:02:54,871 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 10:02:54,871 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 10:02:54,872 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-8.i [2024-11-10 10:02:56,355 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 10:02:56,521 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 10:02:56,521 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-8.i [2024-11-10 10:02:56,528 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c73385040/0803c0213a49406fb61e81fa9a92f475/FLAG30b19ac6b [2024-11-10 10:02:56,931 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c73385040/0803c0213a49406fb61e81fa9a92f475 [2024-11-10 10:02:56,936 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 10:02:56,937 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 10:02:56,938 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 10:02:56,939 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 10:02:56,943 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 10:02:56,943 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:02:56" (1/1) ... [2024-11-10 10:02:56,944 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4089b6bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:02:56, skipping insertion in model container [2024-11-10 10:02:56,944 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:02:56" (1/1) ... [2024-11-10 10:02:56,967 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 10:02:57,125 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-sp_file-8.i[916,929] [2024-11-10 10:02:57,197 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:02:57,215 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 10:02:57,226 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-sp_file-8.i[916,929] [2024-11-10 10:02:57,268 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:02:57,294 INFO L204 MainTranslator]: Completed translation [2024-11-10 10:02:57,295 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:02:57 WrapperNode [2024-11-10 10:02:57,295 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 10:02:57,296 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 10:02:57,296 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 10:02:57,296 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 10:02:57,322 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:02:57" (1/1) ... [2024-11-10 10:02:57,344 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:02:57" (1/1) ... [2024-11-10 10:02:57,377 INFO L138 Inliner]: procedures = 34, calls = 152, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 456 [2024-11-10 10:02:57,381 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 10:02:57,381 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 10:02:57,381 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 10:02:57,382 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 10:02:57,389 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:02:57" (1/1) ... [2024-11-10 10:02:57,390 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:02:57" (1/1) ... [2024-11-10 10:02:57,397 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:02:57" (1/1) ... [2024-11-10 10:02:57,423 INFO L175 MemorySlicer]: Split 127 memory accesses to 2 slices as follows [2, 125]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 35 writes are split as follows [0, 35]. [2024-11-10 10:02:57,423 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:02:57" (1/1) ... [2024-11-10 10:02:57,423 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:02:57" (1/1) ... [2024-11-10 10:02:57,434 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:02:57" (1/1) ... [2024-11-10 10:02:57,435 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:02:57" (1/1) ... [2024-11-10 10:02:57,437 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:02:57" (1/1) ... [2024-11-10 10:02:57,439 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:02:57" (1/1) ... [2024-11-10 10:02:57,442 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 10:02:57,443 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 10:02:57,443 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 10:02:57,443 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 10:02:57,443 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:02:57" (1/1) ... [2024-11-10 10:02:57,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:02:57,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:02:57,470 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 10:02:57,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 10:02:57,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 10:02:57,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-10 10:02:57,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-10 10:02:57,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 10:02:57,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-10 10:02:57,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-10 10:02:57,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-10 10:02:57,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-10 10:02:57,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-10 10:02:57,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-10 10:02:57,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-10 10:02:57,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-10 10:02:57,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-10 10:02:57,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-10 10:02:57,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-10 10:02:57,505 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 10:02:57,505 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 10:02:57,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-10 10:02:57,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-10 10:02:57,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 10:02:57,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 10:02:57,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-10 10:02:57,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-10 10:02:57,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-10 10:02:57,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-10 10:02:57,611 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 10:02:57,612 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 10:02:59,362 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L129: havoc property_#t~mem81#1;havoc property_#t~mem80#1;havoc property_#t~ite90#1;havoc property_#t~mem87#1;havoc property_#t~mem85#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~short84#1;havoc property_#t~short86#1;havoc property_#t~mem89#1;havoc property_#t~mem88#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~ite104#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~ite101#1;havoc property_#t~mem98#1;havoc property_#t~mem97#1;havoc property_#t~mem100#1;havoc property_#t~mem99#1;havoc property_#t~mem103#1;havoc property_#t~mem102#1;havoc property_#t~short105#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~ite117#1;havoc property_#t~mem112#1;havoc property_#t~mem111#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~mem110#1;havoc property_#t~mem116#1;havoc property_#t~mem115#1;havoc property_#t~mem113#1;havoc property_#t~mem114#1;havoc property_#t~short118#1;havoc property_#t~mem120#1;havoc property_#t~mem119#1;havoc property_#t~short121#1;havoc property_#t~mem123#1;havoc property_#t~mem122#1;havoc property_#t~short124#1;havoc property_#t~mem126#1;havoc property_#t~mem125#1;havoc property_#t~short127#1; [2024-11-10 10:02:59,415 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2024-11-10 10:02:59,415 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 10:02:59,427 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 10:02:59,428 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 10:02:59,429 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:02:59 BoogieIcfgContainer [2024-11-10 10:02:59,429 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 10:02:59,431 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 10:02:59,431 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 10:02:59,434 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 10:02:59,434 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 10:02:56" (1/3) ... [2024-11-10 10:02:59,435 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72c15cf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:02:59, skipping insertion in model container [2024-11-10 10:02:59,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:02:57" (2/3) ... [2024-11-10 10:02:59,436 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72c15cf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:02:59, skipping insertion in model container [2024-11-10 10:02:59,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:02:59" (3/3) ... [2024-11-10 10:02:59,437 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-8.i [2024-11-10 10:02:59,449 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 10:02:59,450 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 10:02:59,492 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 10:02:59,497 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;@7b3b753b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 10:02:59,497 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 10:02:59,500 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 86 states have (on average 1.3953488372093024) internal successors, (120), 87 states have internal predecessors, (120), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-10 10:02:59,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-10 10:02:59,508 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:02:59,509 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:02:59,509 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:02:59,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:02:59,513 INFO L85 PathProgramCache]: Analyzing trace with hash -489672525, now seen corresponding path program 1 times [2024-11-10 10:02:59,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 10:02:59,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [893993204] [2024-11-10 10:02:59,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:02:59,523 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 10:02:59,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 10:02:59,525 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 10:02:59,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 10:02:59,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:02:59,864 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 10:02:59,891 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:02:59,917 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2024-11-10 10:02:59,917 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 10:02:59,917 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 10:02:59,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [893993204] [2024-11-10 10:02:59,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [893993204] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:02:59,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:02:59,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 10:02:59,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112354345] [2024-11-10 10:02:59,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:02:59,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 10:02:59,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 10:02:59,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 10:02:59,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 10:02:59,940 INFO L87 Difference]: Start difference. First operand has 103 states, 86 states have (on average 1.3953488372093024) internal successors, (120), 87 states have internal predecessors, (120), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-10 10:02:59,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:02:59,962 INFO L93 Difference]: Finished difference Result 198 states and 303 transitions. [2024-11-10 10:02:59,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 10:02:59,966 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, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 125 [2024-11-10 10:02:59,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:02:59,971 INFO L225 Difference]: With dead ends: 198 [2024-11-10 10:02:59,971 INFO L226 Difference]: Without dead ends: 98 [2024-11-10 10:02:59,973 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 10:02:59,976 INFO L432 NwaCegarLoop]: 140 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, 140 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 10:02:59,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 10:02:59,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-10 10:03:00,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-10 10:03:00,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 82 states have (on average 1.3658536585365855) internal successors, (112), 82 states have internal predecessors, (112), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-10 10:03:00,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 140 transitions. [2024-11-10 10:03:00,007 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 140 transitions. Word has length 125 [2024-11-10 10:03:00,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:03:00,008 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 140 transitions. [2024-11-10 10:03:00,008 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, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-10 10:03:00,008 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 140 transitions. [2024-11-10 10:03:00,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-10 10:03:00,010 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:03:00,010 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:03:00,022 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-10 10:03:00,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 10:03:00,213 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:03:00,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:03:00,214 INFO L85 PathProgramCache]: Analyzing trace with hash -759580483, now seen corresponding path program 1 times [2024-11-10 10:03:00,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 10:03:00,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1745843676] [2024-11-10 10:03:00,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:03:00,215 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 10:03:00,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 10:03:00,219 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 10:03:00,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 10:03:00,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:00,604 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 10:03:00,609 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:03:00,647 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-11-10 10:03:00,647 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 10:03:00,648 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 10:03:00,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1745843676] [2024-11-10 10:03:00,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1745843676] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:03:00,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:03:00,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 10:03:00,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974333045] [2024-11-10 10:03:00,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:03:00,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 10:03:00,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 10:03:00,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 10:03:00,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:03:00,651 INFO L87 Difference]: Start difference. First operand 98 states and 140 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-10 10:03:00,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:03:00,722 INFO L93 Difference]: Finished difference Result 195 states and 280 transitions. [2024-11-10 10:03:00,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 10:03:00,726 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 125 [2024-11-10 10:03:00,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:03:00,728 INFO L225 Difference]: With dead ends: 195 [2024-11-10 10:03:00,728 INFO L226 Difference]: Without dead ends: 100 [2024-11-10 10:03:00,728 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:03:00,729 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 10:03:00,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 403 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 10:03:00,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-10 10:03:00,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-10 10:03:00,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 84 states have (on average 1.3571428571428572) internal successors, (114), 84 states have internal predecessors, (114), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-10 10:03:00,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 142 transitions. [2024-11-10 10:03:00,741 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 142 transitions. Word has length 125 [2024-11-10 10:03:00,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:03:00,742 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 142 transitions. [2024-11-10 10:03:00,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-10 10:03:00,743 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 142 transitions. [2024-11-10 10:03:00,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-10 10:03:00,744 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:03:00,744 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:03:00,757 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 (3)] Ended with exit code 0 [2024-11-10 10:03:00,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 10:03:00,949 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:03:00,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:03:00,950 INFO L85 PathProgramCache]: Analyzing trace with hash -275905156, now seen corresponding path program 1 times [2024-11-10 10:03:00,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 10:03:00,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [991164323] [2024-11-10 10:03:00,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:03:00,951 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 10:03:00,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 10:03:00,953 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 10:03:00,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-10 10:03:01,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:01,442 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 10:03:01,450 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:03:01,496 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 10:03:01,496 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 10:03:01,496 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 10:03:01,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [991164323] [2024-11-10 10:03:01,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [991164323] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:03:01,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:03:01,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 10:03:01,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797198266] [2024-11-10 10:03:01,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:03:01,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 10:03:01,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 10:03:01,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 10:03:01,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 10:03:01,502 INFO L87 Difference]: Start difference. First operand 100 states and 142 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 10:03:01,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:03:01,553 INFO L93 Difference]: Finished difference Result 202 states and 288 transitions. [2024-11-10 10:03:01,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 10:03:01,558 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 125 [2024-11-10 10:03:01,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:03:01,559 INFO L225 Difference]: With dead ends: 202 [2024-11-10 10:03:01,560 INFO L226 Difference]: Without dead ends: 105 [2024-11-10 10:03:01,560 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 121 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-10 10:03:01,562 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 1 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 524 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-10 10:03:01,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 524 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 10:03:01,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-10 10:03:01,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2024-11-10 10:03:01,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 88 states have (on average 1.3409090909090908) internal successors, (118), 88 states have internal predecessors, (118), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-10 10:03:01,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 146 transitions. [2024-11-10 10:03:01,578 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 146 transitions. Word has length 125 [2024-11-10 10:03:01,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:03:01,579 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 146 transitions. [2024-11-10 10:03:01,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 10:03:01,579 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 146 transitions. [2024-11-10 10:03:01,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-10 10:03:01,580 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:03:01,583 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:03:01,600 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 (4)] Ended with exit code 0 [2024-11-10 10:03:01,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 10:03:01,787 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:03:01,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:03:01,787 INFO L85 PathProgramCache]: Analyzing trace with hash -472418661, now seen corresponding path program 1 times [2024-11-10 10:03:01,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 10:03:01,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [361516638] [2024-11-10 10:03:01,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:03:01,788 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 10:03:01,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 10:03:01,791 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 10:03:01,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-10 10:03:02,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:02,143 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 10:03:02,146 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:03:02,177 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 10:03:02,177 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 10:03:02,177 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 10:03:02,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [361516638] [2024-11-10 10:03:02,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [361516638] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:03:02,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:03:02,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 10:03:02,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319062772] [2024-11-10 10:03:02,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:03:02,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 10:03:02,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 10:03:02,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 10:03:02,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 10:03:02,179 INFO L87 Difference]: Start difference. First operand 104 states and 146 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 10:03:02,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:03:02,235 INFO L93 Difference]: Finished difference Result 208 states and 293 transitions. [2024-11-10 10:03:02,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 10:03:02,236 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 125 [2024-11-10 10:03:02,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:03:02,237 INFO L225 Difference]: With dead ends: 208 [2024-11-10 10:03:02,237 INFO L226 Difference]: Without dead ends: 107 [2024-11-10 10:03:02,238 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 120 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-10 10:03:02,238 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 1 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 645 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.0s IncrementalHoareTripleChecker+Time [2024-11-10 10:03:02,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 645 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 10:03:02,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-10 10:03:02,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2024-11-10 10:03:02,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 90 states have (on average 1.3333333333333333) internal successors, (120), 90 states have internal predecessors, (120), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-10 10:03:02,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 148 transitions. [2024-11-10 10:03:02,244 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 148 transitions. Word has length 125 [2024-11-10 10:03:02,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:03:02,244 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 148 transitions. [2024-11-10 10:03:02,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 10:03:02,245 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 148 transitions. [2024-11-10 10:03:02,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-10 10:03:02,246 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:03:02,246 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:03:02,263 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-10 10:03:02,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 10:03:02,449 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:03:02,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:03:02,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1270391674, now seen corresponding path program 1 times [2024-11-10 10:03:02,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 10:03:02,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1131993598] [2024-11-10 10:03:02,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:03:02,450 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 10:03:02,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 10:03:02,453 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 10:03:02,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-10 10:03:02,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:02,764 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 10:03:02,767 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:03:02,811 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 10:03:02,811 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 10:03:02,811 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 10:03:02,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1131993598] [2024-11-10 10:03:02,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1131993598] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:03:02,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:03:02,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 10:03:02,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069139561] [2024-11-10 10:03:02,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:03:02,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 10:03:02,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 10:03:02,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 10:03:02,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 10:03:02,814 INFO L87 Difference]: Start difference. First operand 106 states and 148 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 10:03:02,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:03:02,877 INFO L93 Difference]: Finished difference Result 212 states and 297 transitions. [2024-11-10 10:03:02,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 10:03:02,878 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 125 [2024-11-10 10:03:02,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:03:02,879 INFO L225 Difference]: With dead ends: 212 [2024-11-10 10:03:02,879 INFO L226 Difference]: Without dead ends: 109 [2024-11-10 10:03:02,879 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 119 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-10 10:03:02,880 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 1 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 767 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-10 10:03:02,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 767 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 10:03:02,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-10 10:03:02,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2024-11-10 10:03:02,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 92 states have (on average 1.326086956521739) internal successors, (122), 92 states have internal predecessors, (122), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-10 10:03:02,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 150 transitions. [2024-11-10 10:03:02,895 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 150 transitions. Word has length 125 [2024-11-10 10:03:02,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:03:02,896 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 150 transitions. [2024-11-10 10:03:02,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-10 10:03:02,896 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 150 transitions. [2024-11-10 10:03:02,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-10 10:03:02,898 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:03:02,898 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:03:02,910 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 (6)] Ended with exit code 0 [2024-11-10 10:03:03,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 10:03:03,099 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:03:03,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:03:03,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1299020825, now seen corresponding path program 1 times [2024-11-10 10:03:03,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 10:03:03,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1708469411] [2024-11-10 10:03:03,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:03:03,101 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 10:03:03,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 10:03:03,103 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 10:03:03,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-10 10:03:03,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:03,414 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 10:03:03,417 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:03:03,592 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 97 treesize of output 43 [2024-11-10 10:03:03,620 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-10 10:03:03,621 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 10:03:03,621 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 10:03:03,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1708469411] [2024-11-10 10:03:03,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1708469411] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:03:03,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:03:03,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 10:03:03,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207700112] [2024-11-10 10:03:03,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:03:03,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 10:03:03,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 10:03:03,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 10:03:03,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 10:03:03,623 INFO L87 Difference]: Start difference. First operand 108 states and 150 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-10 10:03:06,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:03:06,625 INFO L93 Difference]: Finished difference Result 214 states and 298 transitions. [2024-11-10 10:03:06,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 10:03:06,626 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 125 [2024-11-10 10:03:06,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:03:06,627 INFO L225 Difference]: With dead ends: 214 [2024-11-10 10:03:06,627 INFO L226 Difference]: Without dead ends: 109 [2024-11-10 10:03:06,628 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-10 10:03:06,628 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 101 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-10 10:03:06,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 402 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-10 10:03:06,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-10 10:03:06,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2024-11-10 10:03:06,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 92 states have (on average 1.315217391304348) internal successors, (121), 92 states have internal predecessors, (121), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-10 10:03:06,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 149 transitions. [2024-11-10 10:03:06,646 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 149 transitions. Word has length 125 [2024-11-10 10:03:06,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:03:06,646 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 149 transitions. [2024-11-10 10:03:06,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-10 10:03:06,647 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 149 transitions. [2024-11-10 10:03:06,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-10 10:03:06,652 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:03:06,652 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:03:06,663 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-10 10:03:06,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 10:03:06,853 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:03:06,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:03:06,853 INFO L85 PathProgramCache]: Analyzing trace with hash -6272101, now seen corresponding path program 1 times [2024-11-10 10:03:06,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 10:03:06,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1395949653] [2024-11-10 10:03:06,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:03:06,854 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 10:03:06,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 10:03:06,857 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 10:03:06,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-10 10:03:07,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:07,186 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 10:03:07,189 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:03:07,352 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 95 treesize of output 41 [2024-11-10 10:03:07,377 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-11-10 10:03:07,377 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 10:03:07,378 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 10:03:07,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1395949653] [2024-11-10 10:03:07,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1395949653] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:03:07,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:03:07,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 10:03:07,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553175113] [2024-11-10 10:03:07,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:03:07,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 10:03:07,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 10:03:07,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 10:03:07,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 10:03:07,380 INFO L87 Difference]: Start difference. First operand 108 states and 149 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-10 10:03:09,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:03:09,796 INFO L93 Difference]: Finished difference Result 214 states and 296 transitions. [2024-11-10 10:03:09,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 10:03:09,796 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 127 [2024-11-10 10:03:09,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:03:09,797 INFO L225 Difference]: With dead ends: 214 [2024-11-10 10:03:09,797 INFO L226 Difference]: Without dead ends: 109 [2024-11-10 10:03:09,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-10 10:03:09,798 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 92 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-10 10:03:09,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 397 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-10 10:03:09,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-10 10:03:09,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2024-11-10 10:03:09,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 92 states have (on average 1.3043478260869565) internal successors, (120), 92 states have internal predecessors, (120), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-10 10:03:09,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 148 transitions. [2024-11-10 10:03:09,809 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 148 transitions. Word has length 127 [2024-11-10 10:03:09,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:03:09,809 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 148 transitions. [2024-11-10 10:03:09,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-10 10:03:09,810 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 148 transitions. [2024-11-10 10:03:09,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-10 10:03:09,810 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:03:09,811 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:03:09,822 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 (8)] Ended with exit code 0 [2024-11-10 10:03:10,014 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-10 10:03:10,015 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:03:10,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:03:10,016 INFO L85 PathProgramCache]: Analyzing trace with hash 933856409, now seen corresponding path program 1 times [2024-11-10 10:03:10,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 10:03:10,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1816481001] [2024-11-10 10:03:10,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:03:10,017 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 10:03:10,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 10:03:10,019 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-10 10:03:10,020 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-10 10:03:10,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:10,348 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 10:03:10,351 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:03:10,504 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 95 treesize of output 41 [2024-11-10 10:03:10,522 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-11-10 10:03:10,522 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 10:03:10,522 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 10:03:10,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1816481001] [2024-11-10 10:03:10,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1816481001] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:03:10,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:03:10,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 10:03:10,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103663299] [2024-11-10 10:03:10,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:03:10,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 10:03:10,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 10:03:10,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 10:03:10,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 10:03:10,525 INFO L87 Difference]: Start difference. First operand 108 states and 148 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-10 10:03:13,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 10:03:13,095 INFO L93 Difference]: Finished difference Result 214 states and 294 transitions. [2024-11-10 10:03:13,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 10:03:13,096 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 129 [2024-11-10 10:03:13,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 10:03:13,096 INFO L225 Difference]: With dead ends: 214 [2024-11-10 10:03:13,097 INFO L226 Difference]: Without dead ends: 109 [2024-11-10 10:03:13,097 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-10 10:03:13,097 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 82 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-10 10:03:13,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 393 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-10 10:03:13,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-10 10:03:13,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2024-11-10 10:03:13,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 92 states have (on average 1.2934782608695652) internal successors, (119), 92 states have internal predecessors, (119), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-10 10:03:13,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 147 transitions. [2024-11-10 10:03:13,102 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 147 transitions. Word has length 129 [2024-11-10 10:03:13,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 10:03:13,102 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 147 transitions. [2024-11-10 10:03:13,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-10 10:03:13,102 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 147 transitions. [2024-11-10 10:03:13,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-10 10:03:13,103 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 10:03:13,103 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:03:13,115 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-10 10:03:13,307 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-10 10:03:13,308 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 10:03:13,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:03:13,308 INFO L85 PathProgramCache]: Analyzing trace with hash 642179611, now seen corresponding path program 1 times [2024-11-10 10:03:13,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 10:03:13,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1904549639] [2024-11-10 10:03:13,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:03:13,309 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 10:03:13,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 10:03:13,310 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-10 10:03:13,311 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-10 10:03:13,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:03:13,863 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-10 10:03:13,871 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:03:17,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-10 10:03:19,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 22 [2024-11-10 10:03:19,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 22 [2024-11-10 10:03:20,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 22 [2024-11-10 10:03:21,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 22 [2024-11-10 10:03:22,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2024-11-10 10:03:23,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 63 [2024-11-10 10:03:23,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 53 [2024-11-10 10:03:23,621 INFO L349 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2024-11-10 10:03:23,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 60 [2024-11-10 10:03:23,682 INFO L349 Elim1Store]: treesize reduction 58, result has 13.4 percent of original size [2024-11-10 10:03:23,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 54 treesize of output 97 [2024-11-10 10:03:23,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 59 [2024-11-10 10:03:24,391 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 115 treesize of output 102 [2024-11-10 10:03:24,437 INFO L349 Elim1Store]: treesize reduction 37, result has 19.6 percent of original size [2024-11-10 10:03:24,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 89 treesize of output 108 [2024-11-10 10:03:24,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 97 [2024-11-10 10:03:24,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 treesize of output 5