./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-54.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-54.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 a03615f4cb38a9b89085584f5a3b534d2c13f2818b8d6757a2151c55b4669a1f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:29:04,247 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:29:04,315 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 13:29:04,322 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:29:04,323 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:29:04,347 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:29:04,347 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:29:04,348 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:29:04,348 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:29:04,349 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:29:04,349 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:29:04,350 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:29:04,350 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:29:04,351 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:29:04,351 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:29:04,351 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:29:04,352 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:29:04,352 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:29:04,352 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 13:29:04,353 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:29:04,353 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:29:04,357 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:29:04,357 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:29:04,357 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:29:04,357 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:29:04,358 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:29:04,358 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:29:04,358 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:29:04,358 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:29:04,359 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:29:04,359 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:29:04,359 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:29:04,359 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:29:04,359 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:29:04,360 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:29:04,360 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:29:04,361 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 13:29:04,362 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 13:29:04,362 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:29:04,362 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:29:04,363 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:29:04,363 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:29:04,363 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-clean/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-clean/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 -> a03615f4cb38a9b89085584f5a3b534d2c13f2818b8d6757a2151c55b4669a1f [2024-10-11 13:29:04,630 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:29:04,660 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:29:04,663 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:29:04,664 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:29:04,665 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:29:04,667 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-54.i [2024-10-11 13:29:06,098 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:29:06,324 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:29:06,325 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-54.i [2024-10-11 13:29:06,333 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/231468606/fda3fb90db69400cb4c5128a1f3c7a24/FLAG8ac1abf32 [2024-10-11 13:29:06,348 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/231468606/fda3fb90db69400cb4c5128a1f3c7a24 [2024-10-11 13:29:06,350 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:29:06,352 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:29:06,356 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:29:06,356 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:29:06,361 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:29:06,362 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:29:06" (1/1) ... [2024-10-11 13:29:06,363 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@510026a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:29:06, skipping insertion in model container [2024-10-11 13:29:06,363 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:29:06" (1/1) ... [2024-10-11 13:29:06,394 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:29:06,552 WARN L248 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-ap_file-54.i[917,930] [2024-10-11 13:29:06,621 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:29:06,633 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:29:06,642 WARN L248 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-ap_file-54.i[917,930] [2024-10-11 13:29:06,673 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:29:06,701 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:29:06,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:29:06 WrapperNode [2024-10-11 13:29:06,705 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:29:06,706 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:29:06,706 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:29:06,706 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:29:06,715 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:29:06" (1/1) ... [2024-10-11 13:29:06,727 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:29:06" (1/1) ... [2024-10-11 13:29:06,762 INFO L138 Inliner]: procedures = 29, calls = 143, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 482 [2024-10-11 13:29:06,766 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:29:06,767 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:29:06,767 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:29:06,767 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:29:06,777 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:29:06" (1/1) ... [2024-10-11 13:29:06,777 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:29:06" (1/1) ... [2024-10-11 13:29:06,783 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:29:06" (1/1) ... [2024-10-11 13:29:06,812 INFO L175 MemorySlicer]: Split 115 memory accesses to 6 slices as follows [2, 33, 41, 7, 13, 19]. 36 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 3, 1, 2, 2]. The 16 writes are split as follows [0, 7, 4, 1, 2, 2]. [2024-10-11 13:29:06,813 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:29:06" (1/1) ... [2024-10-11 13:29:06,813 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:29:06" (1/1) ... [2024-10-11 13:29:06,830 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:29:06" (1/1) ... [2024-10-11 13:29:06,835 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:29:06" (1/1) ... [2024-10-11 13:29:06,838 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:29:06" (1/1) ... [2024-10-11 13:29:06,841 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:29:06" (1/1) ... [2024-10-11 13:29:06,851 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:29:06,852 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:29:06,852 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:29:06,853 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:29:06,854 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:29:06" (1/1) ... [2024-10-11 13:29:06,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:29:06,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:29:06,891 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:29:06,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:29:06,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:29:06,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 13:29:06,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 13:29:06,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 13:29:06,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-11 13:29:06,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-11 13:29:06,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-11 13:29:06,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-11 13:29:06,995 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-11 13:29:06,995 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-11 13:29:06,995 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-11 13:29:06,995 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-11 13:29:06,995 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-10-11 13:29:06,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-11 13:29:06,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-11 13:29:06,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-11 13:29:06,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-11 13:29:06,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-11 13:29:06,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-10-11 13:29:06,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 13:29:06,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 13:29:06,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 13:29:06,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-11 13:29:06,997 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-11 13:29:06,997 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-11 13:29:06,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-11 13:29:06,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-11 13:29:06,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-11 13:29:06,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-11 13:29:06,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-10-11 13:29:06,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-10-11 13:29:06,997 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:29:06,997 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:29:06,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 13:29:06,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 13:29:06,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 13:29:06,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 13:29:06,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 13:29:07,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-11 13:29:07,001 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:29:07,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:29:07,147 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:29:07,149 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:29:07,660 INFO L? ?]: Removed 120 outVars from TransFormulas that were not future-live. [2024-10-11 13:29:07,660 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:29:07,724 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:29:07,726 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:29:07,726 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:29:07 BoogieIcfgContainer [2024-10-11 13:29:07,726 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:29:07,729 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:29:07,730 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:29:07,733 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:29:07,734 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:29:06" (1/3) ... [2024-10-11 13:29:07,735 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17e42d0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:29:07, skipping insertion in model container [2024-10-11 13:29:07,735 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:29:06" (2/3) ... [2024-10-11 13:29:07,736 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17e42d0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:29:07, skipping insertion in model container [2024-10-11 13:29:07,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:29:07" (3/3) ... [2024-10-11 13:29:07,737 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-54.i [2024-10-11 13:29:07,756 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:29:07,756 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:29:07,822 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:29:07,830 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;@21cfc138, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:29:07,831 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:29:07,837 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 88 states have (on average 1.4886363636363635) internal successors, (131), 89 states have internal predecessors, (131), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 13:29:07,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 13:29:07,851 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:29:07,853 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:29:07,854 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:29:07,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:29:07,861 INFO L85 PathProgramCache]: Analyzing trace with hash 562341410, now seen corresponding path program 1 times [2024-10-11 13:29:07,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:29:07,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549611637] [2024-10-11 13:29:07,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:29:07,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:29:08,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:08,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:29:08,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:08,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:29:08,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:08,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:29:08,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:08,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:29:08,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:08,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:29:08,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:08,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:29:08,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:08,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:29:08,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:08,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:29:08,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:08,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:29:08,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:08,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:29:08,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:08,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:29:08,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:08,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:29:08,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:08,287 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:29:08,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:29:08,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549611637] [2024-10-11 13:29:08,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549611637] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:29:08,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:29:08,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:29:08,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627146832] [2024-10-11 13:29:08,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:29:08,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:29:08,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:29:08,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:29:08,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:29:08,333 INFO L87 Difference]: Start difference. First operand has 103 states, 88 states have (on average 1.4886363636363635) internal successors, (131), 89 states have internal predecessors, (131), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 13:29:08,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:29:08,386 INFO L93 Difference]: Finished difference Result 203 states and 320 transitions. [2024-10-11 13:29:08,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:29:08,390 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 100 [2024-10-11 13:29:08,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:29:08,400 INFO L225 Difference]: With dead ends: 203 [2024-10-11 13:29:08,401 INFO L226 Difference]: Without dead ends: 101 [2024-10-11 13:29:08,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 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-10-11 13:29:08,411 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:29:08,413 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 146 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:29:08,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-11 13:29:08,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-10-11 13:29:08,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 87 states have (on average 1.4482758620689655) internal successors, (126), 87 states have internal predecessors, (126), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 13:29:08,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 150 transitions. [2024-10-11 13:29:08,465 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 150 transitions. Word has length 100 [2024-10-11 13:29:08,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:29:08,466 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 150 transitions. [2024-10-11 13:29:08,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 13:29:08,467 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 150 transitions. [2024-10-11 13:29:08,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 13:29:08,473 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:29:08,473 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:29:08,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 13:29:08,474 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:29:08,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:29:08,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1664980018, now seen corresponding path program 1 times [2024-10-11 13:29:08,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:29:08,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787523819] [2024-10-11 13:29:08,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:29:08,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:29:08,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:08,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:29:08,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:08,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:29:08,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:08,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:29:08,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:08,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:29:08,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:08,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:29:08,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:08,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:29:08,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:08,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:29:08,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:08,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:29:08,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:08,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:29:08,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:08,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:29:08,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:08,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:29:08,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:08,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:29:08,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:08,912 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:29:08,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:29:08,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787523819] [2024-10-11 13:29:08,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787523819] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:29:08,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:29:08,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:29:08,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727901226] [2024-10-11 13:29:08,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:29:08,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:29:08,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:29:08,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:29:08,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:29:08,919 INFO L87 Difference]: Start difference. First operand 101 states and 150 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:29:08,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:29:08,976 INFO L93 Difference]: Finished difference Result 203 states and 302 transitions. [2024-10-11 13:29:08,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:29:08,977 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 100 [2024-10-11 13:29:08,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:29:08,979 INFO L225 Difference]: With dead ends: 203 [2024-10-11 13:29:08,979 INFO L226 Difference]: Without dead ends: 103 [2024-10-11 13:29:08,980 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 27 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-10-11 13:29:08,982 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:29:08,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 425 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:29:08,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-11 13:29:08,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-10-11 13:29:08,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 89 states have (on average 1.4382022471910112) internal successors, (128), 89 states have internal predecessors, (128), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 13:29:09,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 152 transitions. [2024-10-11 13:29:09,005 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 152 transitions. Word has length 100 [2024-10-11 13:29:09,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:29:09,006 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 152 transitions. [2024-10-11 13:29:09,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:29:09,007 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 152 transitions. [2024-10-11 13:29:09,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 13:29:09,012 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:29:09,012 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:29:09,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 13:29:09,013 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:29:09,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:29:09,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1774493837, now seen corresponding path program 1 times [2024-10-11 13:29:09,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:29:09,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39627346] [2024-10-11 13:29:09,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:29:09,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:29:09,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:09,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:29:09,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:09,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:29:09,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:09,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:29:09,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:09,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:29:09,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:09,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:29:09,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:09,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:29:09,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:09,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:29:09,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:09,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:29:09,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:09,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:29:09,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:09,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:29:09,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:09,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:29:09,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:09,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:29:09,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:09,243 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:29:09,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:29:09,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39627346] [2024-10-11 13:29:09,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39627346] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:29:09,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:29:09,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:29:09,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224016005] [2024-10-11 13:29:09,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:29:09,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:29:09,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:29:09,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:29:09,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:29:09,248 INFO L87 Difference]: Start difference. First operand 103 states and 152 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:29:09,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:29:09,302 INFO L93 Difference]: Finished difference Result 208 states and 307 transitions. [2024-10-11 13:29:09,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:29:09,303 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 102 [2024-10-11 13:29:09,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:29:09,306 INFO L225 Difference]: With dead ends: 208 [2024-10-11 13:29:09,310 INFO L226 Difference]: Without dead ends: 106 [2024-10-11 13:29:09,311 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 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-10-11 13:29:09,312 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 1 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:29:09,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 422 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:29:09,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-11 13:29:09,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2024-10-11 13:29:09,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 91 states have (on average 1.4285714285714286) internal successors, (130), 91 states have internal predecessors, (130), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 13:29:09,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 154 transitions. [2024-10-11 13:29:09,327 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 154 transitions. Word has length 102 [2024-10-11 13:29:09,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:29:09,327 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 154 transitions. [2024-10-11 13:29:09,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:29:09,327 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 154 transitions. [2024-10-11 13:29:09,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 13:29:09,330 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:29:09,330 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:29:09,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 13:29:09,332 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:29:09,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:29:09,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1717235535, now seen corresponding path program 1 times [2024-10-11 13:29:09,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:29:09,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156151024] [2024-10-11 13:29:09,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:29:09,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:29:09,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:09,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:29:09,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:09,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:29:09,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:09,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:29:09,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:09,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:29:09,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:09,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:29:09,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:09,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:29:09,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:09,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:29:09,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:09,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:29:09,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:09,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:29:09,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:09,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:29:09,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:09,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:29:09,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:09,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:29:09,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:09,544 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:29:09,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:29:09,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156151024] [2024-10-11 13:29:09,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156151024] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:29:09,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:29:09,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:29:09,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873140237] [2024-10-11 13:29:09,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:29:09,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:29:09,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:29:09,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:29:09,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:29:09,549 INFO L87 Difference]: Start difference. First operand 105 states and 154 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:29:09,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:29:09,588 INFO L93 Difference]: Finished difference Result 212 states and 311 transitions. [2024-10-11 13:29:09,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:29:09,590 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 102 [2024-10-11 13:29:09,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:29:09,592 INFO L225 Difference]: With dead ends: 212 [2024-10-11 13:29:09,592 INFO L226 Difference]: Without dead ends: 108 [2024-10-11 13:29:09,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 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-10-11 13:29:09,593 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 1 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:29:09,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 426 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:29:09,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-11 13:29:09,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2024-10-11 13:29:09,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 93 states have (on average 1.4193548387096775) internal successors, (132), 93 states have internal predecessors, (132), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 13:29:09,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 156 transitions. [2024-10-11 13:29:09,607 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 156 transitions. Word has length 102 [2024-10-11 13:29:09,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:29:09,608 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 156 transitions. [2024-10-11 13:29:09,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:29:09,608 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 156 transitions. [2024-10-11 13:29:09,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 13:29:09,609 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:29:09,610 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:29:09,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 13:29:09,610 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:29:09,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:29:09,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1717175953, now seen corresponding path program 1 times [2024-10-11 13:29:09,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:29:09,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109527451] [2024-10-11 13:29:09,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:29:09,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:29:09,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:09,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:29:09,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:09,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:29:09,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:09,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:29:09,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:09,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:29:09,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:09,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:29:09,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:09,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:29:09,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:09,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:29:09,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:09,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:29:09,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:09,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:29:09,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:09,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:29:09,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:09,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:29:09,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:09,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:29:09,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:09,858 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:29:09,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:29:09,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109527451] [2024-10-11 13:29:09,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109527451] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:29:09,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:29:09,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:29:09,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430506467] [2024-10-11 13:29:09,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:29:09,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:29:09,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:29:09,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:29:09,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:29:09,863 INFO L87 Difference]: Start difference. First operand 107 states and 156 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:29:09,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:29:09,980 INFO L93 Difference]: Finished difference Result 304 states and 443 transitions. [2024-10-11 13:29:09,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:29:09,981 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 102 [2024-10-11 13:29:09,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:29:09,983 INFO L225 Difference]: With dead ends: 304 [2024-10-11 13:29:09,983 INFO L226 Difference]: Without dead ends: 198 [2024-10-11 13:29:09,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:29:09,984 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 120 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:29:09,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 534 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:29:09,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-10-11 13:29:10,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 195. [2024-10-11 13:29:10,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 172 states have (on average 1.4244186046511629) internal successors, (245), 173 states have internal predecessors, (245), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 13:29:10,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 285 transitions. [2024-10-11 13:29:10,008 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 285 transitions. Word has length 102 [2024-10-11 13:29:10,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:29:10,009 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 285 transitions. [2024-10-11 13:29:10,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:29:10,010 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 285 transitions. [2024-10-11 13:29:10,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-11 13:29:10,014 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:29:10,014 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:29:10,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 13:29:10,015 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:29:10,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:29:10,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1294826256, now seen corresponding path program 1 times [2024-10-11 13:29:10,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:29:10,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899505858] [2024-10-11 13:29:10,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:29:10,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:29:10,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:10,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:29:10,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:10,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:29:10,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:10,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:29:10,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:10,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:29:10,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:10,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:29:10,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:10,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:29:10,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:10,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:29:10,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:10,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:29:10,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:10,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:29:10,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:10,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:29:10,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:10,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:29:10,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:10,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:29:10,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:10,420 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:29:10,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:29:10,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899505858] [2024-10-11 13:29:10,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899505858] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:29:10,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:29:10,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:29:10,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828028074] [2024-10-11 13:29:10,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:29:10,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:29:10,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:29:10,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:29:10,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:29:10,427 INFO L87 Difference]: Start difference. First operand 195 states and 285 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 13:29:10,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:29:10,552 INFO L93 Difference]: Finished difference Result 495 states and 720 transitions. [2024-10-11 13:29:10,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:29:10,552 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 103 [2024-10-11 13:29:10,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:29:10,557 INFO L225 Difference]: With dead ends: 495 [2024-10-11 13:29:10,558 INFO L226 Difference]: Without dead ends: 301 [2024-10-11 13:29:10,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:29:10,560 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 211 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:29:10,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 398 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:29:10,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2024-10-11 13:29:10,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 297. [2024-10-11 13:29:10,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 260 states have (on average 1.4115384615384616) internal successors, (367), 261 states have internal predecessors, (367), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 13:29:10,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 431 transitions. [2024-10-11 13:29:10,593 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 431 transitions. Word has length 103 [2024-10-11 13:29:10,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:29:10,594 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 431 transitions. [2024-10-11 13:29:10,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 13:29:10,594 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 431 transitions. [2024-10-11 13:29:10,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-11 13:29:10,595 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:29:10,597 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:29:10,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 13:29:10,597 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:29:10,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:29:10,598 INFO L85 PathProgramCache]: Analyzing trace with hash -394117486, now seen corresponding path program 1 times [2024-10-11 13:29:10,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:29:10,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843895668] [2024-10-11 13:29:10,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:29:10,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:29:10,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:10,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:29:10,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:10,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:29:10,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:11,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:29:11,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:11,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:29:11,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:11,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:29:11,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:11,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:29:11,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:11,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:29:11,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:11,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:29:11,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:11,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:29:11,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:11,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:29:11,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:11,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:29:11,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:11,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:29:11,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:11,055 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:29:11,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:29:11,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843895668] [2024-10-11 13:29:11,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843895668] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:29:11,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:29:11,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:29:11,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421183102] [2024-10-11 13:29:11,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:29:11,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:29:11,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:29:11,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:29:11,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:29:11,059 INFO L87 Difference]: Start difference. First operand 297 states and 431 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 13:29:11,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:29:11,237 INFO L93 Difference]: Finished difference Result 597 states and 865 transitions. [2024-10-11 13:29:11,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:29:11,238 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 103 [2024-10-11 13:29:11,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:29:11,240 INFO L225 Difference]: With dead ends: 597 [2024-10-11 13:29:11,240 INFO L226 Difference]: Without dead ends: 301 [2024-10-11 13:29:11,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:29:11,243 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 202 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:29:11,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 500 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:29:11,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2024-10-11 13:29:11,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 297. [2024-10-11 13:29:11,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 260 states have (on average 1.4076923076923078) internal successors, (366), 261 states have internal predecessors, (366), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 13:29:11,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 430 transitions. [2024-10-11 13:29:11,267 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 430 transitions. Word has length 103 [2024-10-11 13:29:11,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:29:11,267 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 430 transitions. [2024-10-11 13:29:11,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 13:29:11,268 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 430 transitions. [2024-10-11 13:29:11,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-11 13:29:11,269 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:29:11,269 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:29:11,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 13:29:11,270 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:29:11,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:29:11,270 INFO L85 PathProgramCache]: Analyzing trace with hash -135952048, now seen corresponding path program 1 times [2024-10-11 13:29:11,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:29:11,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552110239] [2024-10-11 13:29:11,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:29:11,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:29:11,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:12,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:29:12,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:12,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:29:12,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:12,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:29:12,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:12,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:29:12,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:12,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:29:12,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:12,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:29:12,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:12,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:29:12,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:12,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:29:12,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:12,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:29:12,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:12,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:29:12,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:12,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:29:12,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:12,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:29:12,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:12,380 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:29:12,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:29:12,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552110239] [2024-10-11 13:29:12,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552110239] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:29:12,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:29:12,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 13:29:12,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356682919] [2024-10-11 13:29:12,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:29:12,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 13:29:12,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:29:12,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 13:29:12,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-11 13:29:12,382 INFO L87 Difference]: Start difference. First operand 297 states and 430 transitions. Second operand has 10 states, 8 states have (on average 5.75) internal successors, (46), 10 states have internal predecessors, (46), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-11 13:29:12,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:29:12,840 INFO L93 Difference]: Finished difference Result 728 states and 1046 transitions. [2024-10-11 13:29:12,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 13:29:12,841 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 5.75) internal successors, (46), 10 states have internal predecessors, (46), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) Word has length 103 [2024-10-11 13:29:12,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:29:12,844 INFO L225 Difference]: With dead ends: 728 [2024-10-11 13:29:12,844 INFO L226 Difference]: Without dead ends: 432 [2024-10-11 13:29:12,845 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-10-11 13:29:12,845 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 412 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:29:12,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 785 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:29:12,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2024-10-11 13:29:12,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 328. [2024-10-11 13:29:12,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 291 states have (on average 1.3917525773195876) internal successors, (405), 292 states have internal predecessors, (405), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 13:29:12,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 469 transitions. [2024-10-11 13:29:12,869 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 469 transitions. Word has length 103 [2024-10-11 13:29:12,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:29:12,870 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 469 transitions. [2024-10-11 13:29:12,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 5.75) internal successors, (46), 10 states have internal predecessors, (46), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-11 13:29:12,870 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 469 transitions. [2024-10-11 13:29:12,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 13:29:12,871 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:29:12,871 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:29:12,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 13:29:12,871 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:29:12,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:29:12,872 INFO L85 PathProgramCache]: Analyzing trace with hash 139234422, now seen corresponding path program 1 times [2024-10-11 13:29:12,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:29:12,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834570702] [2024-10-11 13:29:12,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:29:12,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:29:12,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:13,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:29:13,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:13,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:29:13,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:13,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:29:13,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:13,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:29:13,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:13,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:29:13,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:13,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:29:13,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:13,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:29:13,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:13,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:29:13,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:13,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:29:13,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:13,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:29:13,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:13,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:29:13,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:13,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:29:13,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:13,582 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:29:13,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:29:13,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834570702] [2024-10-11 13:29:13,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834570702] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:29:13,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:29:13,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 13:29:13,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147284129] [2024-10-11 13:29:13,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:29:13,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 13:29:13,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:29:13,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 13:29:13,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-11 13:29:13,586 INFO L87 Difference]: Start difference. First operand 328 states and 469 transitions. Second operand has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 13:29:14,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:29:14,045 INFO L93 Difference]: Finished difference Result 696 states and 998 transitions. [2024-10-11 13:29:14,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:29:14,046 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 104 [2024-10-11 13:29:14,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:29:14,050 INFO L225 Difference]: With dead ends: 696 [2024-10-11 13:29:14,051 INFO L226 Difference]: Without dead ends: 480 [2024-10-11 13:29:14,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2024-10-11 13:29:14,052 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 515 mSDsluCounter, 742 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:29:14,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 935 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:29:14,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2024-10-11 13:29:14,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 476. [2024-10-11 13:29:14,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 416 states have (on average 1.3846153846153846) internal successors, (576), 419 states have internal predecessors, (576), 52 states have call successors, (52), 7 states have call predecessors, (52), 7 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-11 13:29:14,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 680 transitions. [2024-10-11 13:29:14,106 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 680 transitions. Word has length 104 [2024-10-11 13:29:14,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:29:14,107 INFO L471 AbstractCegarLoop]: Abstraction has 476 states and 680 transitions. [2024-10-11 13:29:14,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 13:29:14,107 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 680 transitions. [2024-10-11 13:29:14,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 13:29:14,109 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:29:14,109 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:29:14,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 13:29:14,109 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:29:14,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:29:14,110 INFO L85 PathProgramCache]: Analyzing trace with hash -447571592, now seen corresponding path program 1 times [2024-10-11 13:29:14,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:29:14,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269602608] [2024-10-11 13:29:14,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:29:14,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:29:14,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:14,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:29:14,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:14,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:29:14,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:14,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:29:14,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:14,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:29:14,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:14,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:29:14,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:14,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:29:14,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:14,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:29:14,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:14,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:29:14,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:14,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:29:14,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:14,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:29:14,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:14,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:29:14,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:14,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:29:14,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:14,580 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:29:14,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:29:14,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269602608] [2024-10-11 13:29:14,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269602608] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:29:14,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:29:14,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 13:29:14,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845048778] [2024-10-11 13:29:14,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:29:14,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 13:29:14,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:29:14,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 13:29:14,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:29:14,585 INFO L87 Difference]: Start difference. First operand 476 states and 680 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:29:14,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:29:14,868 INFO L93 Difference]: Finished difference Result 805 states and 1154 transitions. [2024-10-11 13:29:14,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 13:29:14,869 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2024-10-11 13:29:14,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:29:14,871 INFO L225 Difference]: With dead ends: 805 [2024-10-11 13:29:14,871 INFO L226 Difference]: Without dead ends: 479 [2024-10-11 13:29:14,872 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-10-11 13:29:14,873 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 128 mSDsluCounter, 1511 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 1771 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:29:14,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 1771 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:29:14,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2024-10-11 13:29:14,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 472. [2024-10-11 13:29:14,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 412 states have (on average 1.3810679611650485) internal successors, (569), 415 states have internal predecessors, (569), 52 states have call successors, (52), 7 states have call predecessors, (52), 7 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-11 13:29:14,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 673 transitions. [2024-10-11 13:29:14,923 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 673 transitions. Word has length 104 [2024-10-11 13:29:14,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:29:14,924 INFO L471 AbstractCegarLoop]: Abstraction has 472 states and 673 transitions. [2024-10-11 13:29:14,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:29:14,924 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 673 transitions. [2024-10-11 13:29:14,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 13:29:14,926 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:29:14,926 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:29:14,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 13:29:14,927 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:29:14,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:29:14,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1944672756, now seen corresponding path program 1 times [2024-10-11 13:29:14,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:29:14,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667346496] [2024-10-11 13:29:14,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:29:14,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:29:14,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:15,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:29:15,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:15,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:29:15,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:15,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:29:15,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:15,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:29:15,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:15,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:29:15,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:15,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:29:15,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:15,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:29:15,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:15,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:29:15,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:15,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:29:15,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:15,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:29:15,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:15,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:29:15,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:15,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:29:15,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:15,580 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:29:15,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:29:15,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667346496] [2024-10-11 13:29:15,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667346496] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:29:15,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:29:15,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 13:29:15,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841963623] [2024-10-11 13:29:15,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:29:15,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 13:29:15,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:29:15,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 13:29:15,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-11 13:29:15,583 INFO L87 Difference]: Start difference. First operand 472 states and 673 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:29:15,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:29:15,954 INFO L93 Difference]: Finished difference Result 815 states and 1161 transitions. [2024-10-11 13:29:15,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 13:29:15,954 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2024-10-11 13:29:15,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:29:15,957 INFO L225 Difference]: With dead ends: 815 [2024-10-11 13:29:15,957 INFO L226 Difference]: Without dead ends: 493 [2024-10-11 13:29:15,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-10-11 13:29:15,959 INFO L432 NwaCegarLoop]: 253 mSDtfsCounter, 132 mSDsluCounter, 1778 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 2031 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:29:15,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 2031 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:29:15,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2024-10-11 13:29:15,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 402. [2024-10-11 13:29:15,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 350 states have (on average 1.3771428571428572) internal successors, (482), 352 states have internal predecessors, (482), 44 states have call successors, (44), 7 states have call predecessors, (44), 7 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-11 13:29:15,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 570 transitions. [2024-10-11 13:29:15,999 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 570 transitions. Word has length 104 [2024-10-11 13:29:15,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:29:15,999 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 570 transitions. [2024-10-11 13:29:16,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:29:16,000 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 570 transitions. [2024-10-11 13:29:16,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 13:29:16,001 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:29:16,001 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:29:16,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 13:29:16,001 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:29:16,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:29:16,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1357866742, now seen corresponding path program 1 times [2024-10-11 13:29:16,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:29:16,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086776415] [2024-10-11 13:29:16,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:29:16,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:29:16,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:16,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:29:16,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:16,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:29:16,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:16,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:29:16,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:16,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:29:16,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:16,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:29:16,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:16,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:29:16,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:16,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:29:16,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:16,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:29:16,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:16,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:29:16,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:16,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:29:16,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:16,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:29:16,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:16,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:29:16,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:16,466 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:29:16,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:29:16,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086776415] [2024-10-11 13:29:16,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086776415] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:29:16,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:29:16,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 13:29:16,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461791195] [2024-10-11 13:29:16,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:29:16,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 13:29:16,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:29:16,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 13:29:16,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:29:16,468 INFO L87 Difference]: Start difference. First operand 402 states and 570 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 13:29:16,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:29:16,831 INFO L93 Difference]: Finished difference Result 731 states and 1039 transitions. [2024-10-11 13:29:16,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:29:16,832 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 104 [2024-10-11 13:29:16,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:29:16,834 INFO L225 Difference]: With dead ends: 731 [2024-10-11 13:29:16,834 INFO L226 Difference]: Without dead ends: 479 [2024-10-11 13:29:16,835 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-11 13:29:16,837 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 343 mSDsluCounter, 670 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:29:16,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 924 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:29:16,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2024-10-11 13:29:16,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 396. [2024-10-11 13:29:16,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 344 states have (on average 1.372093023255814) internal successors, (472), 346 states have internal predecessors, (472), 44 states have call successors, (44), 7 states have call predecessors, (44), 7 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-11 13:29:16,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 560 transitions. [2024-10-11 13:29:16,885 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 560 transitions. Word has length 104 [2024-10-11 13:29:16,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:29:16,885 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 560 transitions. [2024-10-11 13:29:16,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 13:29:16,886 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 560 transitions. [2024-10-11 13:29:16,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-11 13:29:16,887 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:29:16,887 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:29:16,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 13:29:16,887 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:29:16,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:29:16,888 INFO L85 PathProgramCache]: Analyzing trace with hash -219259458, now seen corresponding path program 1 times [2024-10-11 13:29:16,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:29:16,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645681997] [2024-10-11 13:29:16,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:29:16,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:29:16,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:17,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:29:17,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:17,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:29:17,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:17,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:29:17,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:17,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:29:17,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:17,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:29:17,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:17,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:29:17,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:17,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:29:17,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:17,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:29:17,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:17,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:29:17,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:17,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:29:17,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:17,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:29:17,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:17,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:29:17,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:17,343 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:29:17,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:29:17,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645681997] [2024-10-11 13:29:17,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645681997] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:29:17,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:29:17,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 13:29:17,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518845907] [2024-10-11 13:29:17,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:29:17,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 13:29:17,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:29:17,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 13:29:17,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:29:17,346 INFO L87 Difference]: Start difference. First operand 396 states and 560 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 13:29:17,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:29:17,552 INFO L93 Difference]: Finished difference Result 408 states and 573 transitions. [2024-10-11 13:29:17,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:29:17,553 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 105 [2024-10-11 13:29:17,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:29:17,555 INFO L225 Difference]: With dead ends: 408 [2024-10-11 13:29:17,555 INFO L226 Difference]: Without dead ends: 406 [2024-10-11 13:29:17,556 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-10-11 13:29:17,557 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 226 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:29:17,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 564 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:29:17,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2024-10-11 13:29:17,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 406. [2024-10-11 13:29:17,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 353 states have (on average 1.3626062322946175) internal successors, (481), 355 states have internal predecessors, (481), 44 states have call successors, (44), 8 states have call predecessors, (44), 8 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-11 13:29:17,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 569 transitions. [2024-10-11 13:29:17,632 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 569 transitions. Word has length 105 [2024-10-11 13:29:17,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:29:17,632 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 569 transitions. [2024-10-11 13:29:17,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 13:29:17,633 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 569 transitions. [2024-10-11 13:29:17,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-11 13:29:17,634 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:29:17,634 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:29:17,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 13:29:17,634 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:29:17,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:29:17,635 INFO L85 PathProgramCache]: Analyzing trace with hash -219199876, now seen corresponding path program 1 times [2024-10-11 13:29:17,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:29:17,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436840370] [2024-10-11 13:29:17,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:29:17,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:29:17,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:29:17,706 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 13:29:17,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:29:17,819 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 13:29:17,820 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 13:29:17,821 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 13:29:17,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 13:29:17,826 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:29:18,008 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 13:29:18,012 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 01:29:18 BoogieIcfgContainer [2024-10-11 13:29:18,013 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 13:29:18,013 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 13:29:18,013 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 13:29:18,014 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 13:29:18,014 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:29:07" (3/4) ... [2024-10-11 13:29:18,016 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 13:29:18,017 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 13:29:18,018 INFO L158 Benchmark]: Toolchain (without parser) took 11666.10ms. Allocated memory was 146.8MB in the beginning and 369.1MB in the end (delta: 222.3MB). Free memory was 94.4MB in the beginning and 252.4MB in the end (delta: -158.0MB). Peak memory consumption was 64.9MB. Max. memory is 16.1GB. [2024-10-11 13:29:18,018 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 146.8MB. Free memory is still 106.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:29:18,018 INFO L158 Benchmark]: CACSL2BoogieTranslator took 349.22ms. Allocated memory is still 146.8MB. Free memory was 94.0MB in the beginning and 77.5MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 13:29:18,019 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.72ms. Allocated memory is still 146.8MB. Free memory was 77.1MB in the beginning and 73.8MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 13:29:18,019 INFO L158 Benchmark]: Boogie Preprocessor took 84.61ms. Allocated memory is still 146.8MB. Free memory was 73.8MB in the beginning and 68.9MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 13:29:18,020 INFO L158 Benchmark]: RCFGBuilder took 874.07ms. Allocated memory was 146.8MB in the beginning and 195.0MB in the end (delta: 48.2MB). Free memory was 68.9MB in the beginning and 127.0MB in the end (delta: -58.1MB). Peak memory consumption was 11.0MB. Max. memory is 16.1GB. [2024-10-11 13:29:18,020 INFO L158 Benchmark]: TraceAbstraction took 10283.81ms. Allocated memory was 195.0MB in the beginning and 369.1MB in the end (delta: 174.1MB). Free memory was 127.0MB in the beginning and 252.4MB in the end (delta: -125.4MB). Peak memory consumption was 47.6MB. Max. memory is 16.1GB. [2024-10-11 13:29:18,020 INFO L158 Benchmark]: Witness Printer took 4.03ms. Allocated memory is still 369.1MB. Free memory is still 252.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:29:18,022 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.28ms. Allocated memory is still 146.8MB. Free memory is still 106.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 349.22ms. Allocated memory is still 146.8MB. Free memory was 94.0MB in the beginning and 77.5MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.72ms. Allocated memory is still 146.8MB. Free memory was 77.1MB in the beginning and 73.8MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 84.61ms. Allocated memory is still 146.8MB. Free memory was 73.8MB in the beginning and 68.9MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 874.07ms. Allocated memory was 146.8MB in the beginning and 195.0MB in the end (delta: 48.2MB). Free memory was 68.9MB in the beginning and 127.0MB in the end (delta: -58.1MB). Peak memory consumption was 11.0MB. Max. memory is 16.1GB. * TraceAbstraction took 10283.81ms. Allocated memory was 195.0MB in the beginning and 369.1MB in the end (delta: 174.1MB). Free memory was 127.0MB in the beginning and 252.4MB in the end (delta: -125.4MB). Peak memory consumption was 47.6MB. Max. memory is 16.1GB. * Witness Printer took 4.03ms. Allocated memory is still 369.1MB. Free memory is still 252.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 96, overapproximation of someBinaryFLOATComparisonOperation at line 107. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 1}, {0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 1}, {0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 1}, {0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 1}, {0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 1}, {0, 0} }; [L25] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer = &(BOOL_unsigned_char_Array_0[0][0]); [L26] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer = &(BOOL_unsigned_char_Array_0[1][0]); [L27] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer = &(BOOL_unsigned_char_Array_0[0][1]); [L28] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer = &(BOOL_unsigned_char_Array_0[1][1]); [L29-L31] double double_Array_0[3] = { 5.5, 4.1, 9.75 }; [L29-L31] double double_Array_0[3] = { 5.5, 4.1, 9.75 }; [L29-L31] double double_Array_0[3] = { 5.5, 4.1, 9.75 }; [L29-L31] double double_Array_0[3] = { 5.5, 4.1, 9.75 }; [L32] double* double_Array_0_arraydouble_Array_0arrayVar0_Pointer = &(double_Array_0[0]); [L33] double* double_Array_0_arraydouble_Array_0arrayVar1_Pointer = &(double_Array_0[1]); [L34] double* double_Array_0_arraydouble_Array_0arrayVar2_Pointer = &(double_Array_0[2]); [L35-L37] float float_Array_0[1] = { 9.8 }; [L35-L37] float float_Array_0[1] = { 9.8 }; [L38] float* float_Array_0_arrayfloat_Array_0arrayVar0_Pointer = &(float_Array_0[0]); [L39-L41] signed char signed_char_Array_0[2] = { 2, 25 }; [L39-L41] signed char signed_char_Array_0[2] = { 2, 25 }; [L39-L41] signed char signed_char_Array_0[2] = { 2, 25 }; [L42] signed char* signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer = &(signed_char_Array_0[0]); [L43] signed char* signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer = &(signed_char_Array_0[1]); [L44-L46] unsigned char unsigned_char_Array_0[2] = { 10, 16 }; [L44-L46] unsigned char unsigned_char_Array_0[2] = { 10, 16 }; [L44-L46] unsigned char unsigned_char_Array_0[2] = { 10, 16 }; [L47] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer = &(unsigned_char_Array_0[0]); [L48] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer = &(unsigned_char_Array_0[1]); [L111] isInitial = 1 [L112] FCALL initially() [L113] COND TRUE 1 [L114] FCALL updateLastVariables() [L115] CALL updateVariables() [L84] BOOL_unsigned_char_Array_0[0][0] = __VERIFIER_nondet_uchar() [L85] EXPR BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L85] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L85] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L86] EXPR BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L86] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L86] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L87] BOOL_unsigned_char_Array_0[1][0] = __VERIFIER_nondet_uchar() [L88] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L88] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L88] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L89] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L89] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L89] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L90] BOOL_unsigned_char_Array_0[0][1] = __VERIFIER_nondet_uchar() [L91] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L91] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L91] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L92] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L92] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L92] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L93] double_Array_0[0] = __VERIFIER_nondet_double() [L94] EXPR double_Array_0[0] [L94] EXPR double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L94] EXPR double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F [L94] EXPR double_Array_0[0] [L94] EXPR double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L94] EXPR (double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L94] EXPR (double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L94] CALL assume_abort_if_not((double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L94] RET assume_abort_if_not((double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L95] double_Array_0[1] = __VERIFIER_nondet_double() [L96] EXPR double_Array_0[1] [L96] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L96] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F [L96] EXPR double_Array_0[1] [L96] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L96] EXPR (double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L96] EXPR (double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L96] CALL assume_abort_if_not((double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L96] RET assume_abort_if_not((double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L97] signed_char_Array_0[0] = __VERIFIER_nondet_char() [L98] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L98] CALL assume_abort_if_not(signed_char_Array_0[0] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L98] RET assume_abort_if_not(signed_char_Array_0[0] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L99] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L99] CALL assume_abort_if_not(signed_char_Array_0[0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L99] RET assume_abort_if_not(signed_char_Array_0[0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L100] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L101] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L101] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L101] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L102] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L102] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L102] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L115] RET updateVariables() [L116] CALL step() [L52] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar0_Pointer) [L52] (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) = (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) [L53] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer) [L53] (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) = (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)) [L54] signed long int stepLocal_0 = -4; [L55] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L55] COND FALSE !(stepLocal_0 >= (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) [L58] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer) [L58] unsigned char stepLocal_2 = (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)); [L59] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L59] COND FALSE !((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) [L68] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L68] EXPR ((10) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? (10) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) [L68] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L68] EXPR ((10) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? (10) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={7:1}, stepLocal_2=254, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L68] signed long int stepLocal_1 = (((10) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? (10) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))); [L69] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L69] COND FALSE !((8 * (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) == stepLocal_1) [L80] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer) [L80] (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) = (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) [L116] RET step() [L117] CALL, EXPR property() [L107] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L107] EXPR (-4 >= (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1 [L107] EXPR (-4 >= (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L107] EXPR ((-4 >= (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) == ((((10) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? (10) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) < (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))))) : (((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) >= (((((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) < 0 ) ? -((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)))))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) 0)))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L107] EXPR ((-4 >= (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) == ((((10) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? (10) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) < (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))))) : (((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) >= (((((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) < 0 ) ? -((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)))))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) 0)))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))))) [L107] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L107] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L107] EXPR ((10) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? (10) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) [L107] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L107] EXPR ((10) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? (10) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L107] EXPR ((8 * (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) == ((((10) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? (10) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) < (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))))) : (((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) >= (((((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) < 0 ) ? -((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)))))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) 0)))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)))) [L107] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer) [L107] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer) [L107] EXPR ((8 * (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) == ((((10) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? (10) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) < (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))))) : (((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) >= (((((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) < 0 ) ? -((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)))))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) 0)))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L107] EXPR ((-4 >= (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) == ((((10) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? (10) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) < (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))))) : (((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) >= (((((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) < 0 ) ? -((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)))))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) 0)))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L107] EXPR (((-4 >= (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) == ((((10) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? (10) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) < (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))))) : (((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) >= (((((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) < 0 ) ? -((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)))))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) 0)))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) > (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (((((((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) > (16.5)) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : (16.5)))) > ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) ? ((((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) > (16.5)) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : (16.5)))) : ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)))) : 1)) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L107] EXPR (((-4 >= (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) == ((((10) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? (10) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) < (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))))) : (((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) >= (((((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) < 0 ) ? -((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)))))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) 0)))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) > (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (((((((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) > (16.5)) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : (16.5)))) > ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) ? ((((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) > (16.5)) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : (16.5)))) : ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)))) : 1)) : 1) [L107] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L107] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) > (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (((((((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) > (16.5)) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : (16.5)))) > ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) ? ((((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) > (16.5)) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : (16.5)))) : ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)))) : 1)) : 1 [L107] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) > (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (((((((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) > (16.5)) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : (16.5)))) > ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) ? ((((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) > (16.5)) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : (16.5)))) : ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)))) : 1)) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L107] EXPR (((-4 >= (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) == ((((10) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? (10) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) < (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))))) : (((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) >= (((((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) < 0 ) ? -((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)))))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) 0)))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) > (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (((((((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) > (16.5)) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : (16.5)))) > ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) ? ((((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) > (16.5)) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : (16.5)))) : ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)))) : 1)) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L107] EXPR ((((-4 >= (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) == ((((10) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? (10) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) < (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))))) : (((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) >= (((((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) < 0 ) ? -((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)))))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) 0)))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) > (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (((((((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) > (16.5)) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : (16.5)))) > ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) ? ((((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) > (16.5)) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : (16.5)))) : ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)))) : 1)) : 1)) && ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) == ((float) (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L107] EXPR ((((-4 >= (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) == ((((10) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? (10) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) < (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))))) : (((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) >= (((((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) < 0 ) ? -((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)))))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) 0)))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) > (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (((((((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) > (16.5)) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : (16.5)))) > ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) ? ((((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) > (16.5)) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : (16.5)))) : ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)))) : 1)) : 1)) && ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) == ((float) (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)))) [L107] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar0_Pointer) [L107] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar0_Pointer) [L107] EXPR ((((-4 >= (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) == ((((10) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? (10) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) < (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))))) : (((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) >= (((((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) < 0 ) ? -((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)))))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) 0)))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) > (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (((((((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) > (16.5)) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : (16.5)))) > ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) ? ((((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) > (16.5)) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : (16.5)))) : ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)))) : 1)) : 1)) && ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) == ((float) (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L107] EXPR (((((-4 >= (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) == ((((10) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? (10) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) < (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))))) : (((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) >= (((((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) < 0 ) ? -((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)))))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) 0)))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) > (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (((((((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) > (16.5)) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : (16.5)))) > ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) ? ((((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) > (16.5)) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : (16.5)))) : ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)))) : 1)) : 1)) && ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) == ((float) (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))))) && ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L107] EXPR (((((-4 >= (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) == ((((10) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? (10) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) < (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))))) : (((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) >= (((((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) < 0 ) ? -((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)))))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) 0)))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) > (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (((((((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) > (16.5)) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : (16.5)))) > ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) ? ((((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) > (16.5)) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : (16.5)))) : ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)))) : 1)) : 1)) && ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) == ((float) (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))))) && ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L107-L108] return (((((-4 >= (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) == ((((10) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? (10) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) < (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))))) : (((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) >= (((((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) < 0 ) ? -((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)))))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) 0)))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) > (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (((((((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) > (16.5)) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : (16.5)))) > ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) ? ((((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) > (16.5)) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : (16.5)))) : ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)))) : 1)) : 1)) && ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) == ((float) (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))))) && ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ; [L117] RET, EXPR property() [L117] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={7:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 103 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.0s, OverallIterations: 14, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2293 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2291 mSDsluCounter, 9861 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7614 mSDsCounter, 186 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1584 IncrementalHoareTripleChecker+Invalid, 1770 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 186 mSolverCounterUnsat, 2247 mSDtfsCounter, 1584 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 438 GetRequests, 352 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=476occurred in iteration=9, InterpolantAutomatonStates: 79, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 13 MinimizatonAttempts, 302 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 1441 NumberOfCodeBlocks, 1441 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1323 ConstructedInterpolants, 0 QuantifiedInterpolants, 5340 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 3432/3432 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-10-11 13:29:18,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-54.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 a03615f4cb38a9b89085584f5a3b534d2c13f2818b8d6757a2151c55b4669a1f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:29:20,354 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:29:20,430 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 13:29:20,436 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:29:20,436 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:29:20,474 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:29:20,475 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:29:20,475 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:29:20,475 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:29:20,476 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:29:20,476 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:29:20,478 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:29:20,478 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:29:20,479 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:29:20,479 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:29:20,479 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:29:20,480 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:29:20,480 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:29:20,480 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:29:20,481 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:29:20,481 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:29:20,486 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:29:20,486 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:29:20,486 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 13:29:20,487 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 13:29:20,489 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:29:20,490 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 13:29:20,490 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:29:20,490 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:29:20,491 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:29:20,491 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:29:20,491 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:29:20,491 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:29:20,491 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:29:20,492 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:29:20,492 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:29:20,492 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:29:20,493 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:29:20,493 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 13:29:20,493 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 13:29:20,494 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:29:20,494 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:29:20,494 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:29:20,495 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:29:20,495 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 13:29:20,495 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-clean/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-clean/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 -> a03615f4cb38a9b89085584f5a3b534d2c13f2818b8d6757a2151c55b4669a1f [2024-10-11 13:29:20,798 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:29:20,825 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:29:20,830 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:29:20,831 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:29:20,832 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:29:20,833 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-54.i [2024-10-11 13:29:22,372 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:29:22,640 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:29:22,641 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-54.i [2024-10-11 13:29:22,653 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/22e2cabb7/37f44e5dd00343659412fd0f05a79892/FLAG3b678d928 [2024-10-11 13:29:22,977 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/22e2cabb7/37f44e5dd00343659412fd0f05a79892 [2024-10-11 13:29:22,980 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:29:22,982 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:29:22,984 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:29:22,984 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:29:22,989 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:29:22,990 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:29:22" (1/1) ... [2024-10-11 13:29:22,991 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@607939fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:29:22, skipping insertion in model container [2024-10-11 13:29:22,993 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:29:22" (1/1) ... [2024-10-11 13:29:23,023 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:29:23,233 WARN L248 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-ap_file-54.i[917,930] [2024-10-11 13:29:23,315 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:29:23,341 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:29:23,354 WARN L248 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-ap_file-54.i[917,930] [2024-10-11 13:29:23,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:29:23,412 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:29:23,413 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:29:23 WrapperNode [2024-10-11 13:29:23,413 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:29:23,414 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:29:23,414 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:29:23,414 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:29:23,420 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:29:23" (1/1) ... [2024-10-11 13:29:23,446 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:29:23" (1/1) ... [2024-10-11 13:29:23,489 INFO L138 Inliner]: procedures = 33, calls = 143, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 481 [2024-10-11 13:29:23,490 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:29:23,491 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:29:23,491 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:29:23,491 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:29:23,504 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:29:23" (1/1) ... [2024-10-11 13:29:23,504 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:29:23" (1/1) ... [2024-10-11 13:29:23,512 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:29:23" (1/1) ... [2024-10-11 13:29:23,551 INFO L175 MemorySlicer]: Split 115 memory accesses to 6 slices as follows [2, 33, 41, 7, 13, 19]. 36 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 3, 1, 2, 2]. The 16 writes are split as follows [0, 7, 4, 1, 2, 2]. [2024-10-11 13:29:23,551 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:29:23" (1/1) ... [2024-10-11 13:29:23,552 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:29:23" (1/1) ... [2024-10-11 13:29:23,576 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:29:23" (1/1) ... [2024-10-11 13:29:23,581 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:29:23" (1/1) ... [2024-10-11 13:29:23,585 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:29:23" (1/1) ... [2024-10-11 13:29:23,588 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:29:23" (1/1) ... [2024-10-11 13:29:23,596 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:29:23,597 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:29:23,597 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:29:23,597 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:29:23,598 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:29:23" (1/1) ... [2024-10-11 13:29:23,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:29:23,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:29:23,643 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:29:23,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:29:23,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:29:23,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-10-11 13:29:23,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-10-11 13:29:23,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-10-11 13:29:23,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-10-11 13:29:23,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-10-11 13:29:23,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-10-11 13:29:23,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-11 13:29:23,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-11 13:29:23,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-10-11 13:29:23,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-10-11 13:29:23,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-10-11 13:29:23,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-10-11 13:29:23,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-11 13:29:23,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-11 13:29:23,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-11 13:29:23,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-11 13:29:23,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-10-11 13:29:23,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-10-11 13:29:23,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 13:29:23,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 13:29:23,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-11 13:29:23,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-11 13:29:23,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-10-11 13:29:23,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-10-11 13:29:23,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-11 13:29:23,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-11 13:29:23,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-10-11 13:29:23,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-10-11 13:29:23,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-10-11 13:29:23,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-10-11 13:29:23,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-10-11 13:29:23,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-10-11 13:29:23,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-10-11 13:29:23,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-10-11 13:29:23,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-10-11 13:29:23,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-10-11 13:29:23,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-11 13:29:23,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-11 13:29:23,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-10-11 13:29:23,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-10-11 13:29:23,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-10-11 13:29:23,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-10-11 13:29:23,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-11 13:29:23,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-11 13:29:23,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-10-11 13:29:23,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-10-11 13:29:23,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-10-11 13:29:23,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-10-11 13:29:23,710 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:29:23,710 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:29:23,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:29:23,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:29:23,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-11 13:29:23,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-11 13:29:23,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-10-11 13:29:23,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-10-11 13:29:23,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-10-11 13:29:23,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-10-11 13:29:23,906 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:29:23,908 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:29:25,218 INFO L? ?]: Removed 127 outVars from TransFormulas that were not future-live. [2024-10-11 13:29:25,218 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:29:25,274 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:29:25,275 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:29:25,275 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:29:25 BoogieIcfgContainer [2024-10-11 13:29:25,275 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:29:25,277 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:29:25,277 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:29:25,281 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:29:25,281 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:29:22" (1/3) ... [2024-10-11 13:29:25,282 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@405c123 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:29:25, skipping insertion in model container [2024-10-11 13:29:25,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:29:23" (2/3) ... [2024-10-11 13:29:25,283 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@405c123 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:29:25, skipping insertion in model container [2024-10-11 13:29:25,283 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:29:25" (3/3) ... [2024-10-11 13:29:25,285 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-54.i [2024-10-11 13:29:25,303 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:29:25,303 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:29:25,371 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:29:25,378 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;@717cd953, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:29:25,378 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:29:25,384 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 88 states have (on average 1.4886363636363635) internal successors, (131), 89 states have internal predecessors, (131), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 13:29:25,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 13:29:25,397 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:29:25,398 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:29:25,399 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:29:25,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:29:25,405 INFO L85 PathProgramCache]: Analyzing trace with hash 562341410, now seen corresponding path program 1 times [2024-10-11 13:29:25,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:29:25,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [264983007] [2024-10-11 13:29:25,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:29:25,423 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-10-11 13:29:25,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:29:25,427 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-10-11 13:29:25,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:29:25,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:25,844 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 13:29:25,856 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:29:25,896 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2024-10-11 13:29:25,896 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:29:25,899 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:29:25,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [264983007] [2024-10-11 13:29:25,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [264983007] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:29:25,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:29:25,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:29:25,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066144997] [2024-10-11 13:29:25,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:29:25,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:29:25,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:29:25,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:29:25,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:29:25,947 INFO L87 Difference]: Start difference. First operand has 103 states, 88 states have (on average 1.4886363636363635) internal successors, (131), 89 states have internal predecessors, (131), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 13:29:26,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:29:26,028 INFO L93 Difference]: Finished difference Result 203 states and 320 transitions. [2024-10-11 13:29:26,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:29:26,030 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 100 [2024-10-11 13:29:26,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:29:26,038 INFO L225 Difference]: With dead ends: 203 [2024-10-11 13:29:26,038 INFO L226 Difference]: Without dead ends: 101 [2024-10-11 13:29:26,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 99 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-10-11 13:29:26,044 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:29:26,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 146 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:29:26,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-11 13:29:26,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-10-11 13:29:26,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 87 states have (on average 1.4482758620689655) internal successors, (126), 87 states have internal predecessors, (126), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 13:29:26,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 150 transitions. [2024-10-11 13:29:26,091 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 150 transitions. Word has length 100 [2024-10-11 13:29:26,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:29:26,091 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 150 transitions. [2024-10-11 13:29:26,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 13:29:26,092 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 150 transitions. [2024-10-11 13:29:26,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 13:29:26,095 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:29:26,096 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:29:26,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 13:29:26,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-10-11 13:29:26,297 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:29:26,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:29:26,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1664980018, now seen corresponding path program 1 times [2024-10-11 13:29:26,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:29:26,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [937523965] [2024-10-11 13:29:26,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:29:26,299 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-10-11 13:29:26,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:29:26,301 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-10-11 13:29:26,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:29:26,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:26,652 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 13:29:26,656 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:29:26,723 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:29:26,724 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:29:26,724 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:29:26,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [937523965] [2024-10-11 13:29:26,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [937523965] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:29:26,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:29:26,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:29:26,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114075694] [2024-10-11 13:29:26,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:29:26,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:29:26,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:29:26,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:29:26,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:29:26,728 INFO L87 Difference]: Start difference. First operand 101 states and 150 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:29:26,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:29:26,851 INFO L93 Difference]: Finished difference Result 203 states and 302 transitions. [2024-10-11 13:29:26,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:29:26,855 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 100 [2024-10-11 13:29:26,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:29:26,857 INFO L225 Difference]: With dead ends: 203 [2024-10-11 13:29:26,857 INFO L226 Difference]: Without dead ends: 103 [2024-10-11 13:29:26,858 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 97 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-10-11 13:29:26,859 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:29:26,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 425 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:29:26,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-11 13:29:26,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-10-11 13:29:26,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 89 states have (on average 1.4382022471910112) internal successors, (128), 89 states have internal predecessors, (128), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 13:29:26,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 152 transitions. [2024-10-11 13:29:26,878 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 152 transitions. Word has length 100 [2024-10-11 13:29:26,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:29:26,879 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 152 transitions. [2024-10-11 13:29:26,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:29:26,879 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 152 transitions. [2024-10-11 13:29:26,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 13:29:26,884 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:29:26,884 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:29:26,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:29:27,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/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-10-11 13:29:27,085 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:29:27,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:29:27,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1774493837, now seen corresponding path program 1 times [2024-10-11 13:29:27,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:29:27,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [608749491] [2024-10-11 13:29:27,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:29:27,087 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-10-11 13:29:27,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:29:27,089 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/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-10-11 13:29:27,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:29:27,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:27,409 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 13:29:27,413 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:29:27,444 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:29:27,444 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:29:27,444 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:29:27,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [608749491] [2024-10-11 13:29:27,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [608749491] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:29:27,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:29:27,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:29:27,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670378382] [2024-10-11 13:29:27,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:29:27,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:29:27,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:29:27,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:29:27,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:29:27,448 INFO L87 Difference]: Start difference. First operand 103 states and 152 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:29:27,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:29:27,791 INFO L93 Difference]: Finished difference Result 210 states and 310 transitions. [2024-10-11 13:29:27,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:29:27,792 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 102 [2024-10-11 13:29:27,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:29:27,794 INFO L225 Difference]: With dead ends: 210 [2024-10-11 13:29:27,794 INFO L226 Difference]: Without dead ends: 108 [2024-10-11 13:29:27,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 98 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-10-11 13:29:27,796 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 1 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:29:27,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 554 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:29:27,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-11 13:29:27,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2024-10-11 13:29:27,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 93 states have (on average 1.4193548387096775) internal successors, (132), 93 states have internal predecessors, (132), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 13:29:27,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 156 transitions. [2024-10-11 13:29:27,806 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 156 transitions. Word has length 102 [2024-10-11 13:29:27,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:29:27,806 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 156 transitions. [2024-10-11 13:29:27,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:29:27,807 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 156 transitions. [2024-10-11 13:29:27,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 13:29:27,808 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:29:27,808 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:29:27,818 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:29:28,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/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-10-11 13:29:28,010 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:29:28,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:29:28,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1717235535, now seen corresponding path program 1 times [2024-10-11 13:29:28,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:29:28,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [611164926] [2024-10-11 13:29:28,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:29:28,013 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-10-11 13:29:28,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:29:28,014 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/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-10-11 13:29:28,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:29:28,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:28,291 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 13:29:28,294 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:29:28,331 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:29:28,331 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:29:28,331 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:29:28,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [611164926] [2024-10-11 13:29:28,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [611164926] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:29:28,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:29:28,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:29:28,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257751454] [2024-10-11 13:29:28,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:29:28,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:29:28,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:29:28,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:29:28,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:29:28,334 INFO L87 Difference]: Start difference. First operand 107 states and 156 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:29:29,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:29:29,081 INFO L93 Difference]: Finished difference Result 216 states and 315 transitions. [2024-10-11 13:29:29,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:29:29,081 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 102 [2024-10-11 13:29:29,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:29:29,083 INFO L225 Difference]: With dead ends: 216 [2024-10-11 13:29:29,083 INFO L226 Difference]: Without dead ends: 110 [2024-10-11 13:29:29,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 97 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-10-11 13:29:29,085 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 1 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 13:29:29,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 688 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 13:29:29,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-10-11 13:29:29,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2024-10-11 13:29:29,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 95 states have (on average 1.4105263157894736) internal successors, (134), 95 states have internal predecessors, (134), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 13:29:29,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 158 transitions. [2024-10-11 13:29:29,103 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 158 transitions. Word has length 102 [2024-10-11 13:29:29,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:29:29,104 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 158 transitions. [2024-10-11 13:29:29,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:29:29,107 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 158 transitions. [2024-10-11 13:29:29,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 13:29:29,109 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:29:29,109 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:29:29,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-11 13:29:29,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/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-10-11 13:29:29,310 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:29:29,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:29:29,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1717175953, now seen corresponding path program 1 times [2024-10-11 13:29:29,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:29:29,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [256865832] [2024-10-11 13:29:29,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:29:29,311 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-10-11 13:29:29,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:29:29,314 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/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-10-11 13:29:29,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:29:29,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:29,638 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 13:29:29,642 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:29:29,748 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 19 treesize of output 11 [2024-10-11 13:29:29,821 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:29:29,821 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:29:29,821 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:29:29,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [256865832] [2024-10-11 13:29:29,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [256865832] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:29:29,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:29:29,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:29:29,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867184570] [2024-10-11 13:29:29,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:29:29,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:29:29,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:29:29,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:29:29,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:29:29,825 INFO L87 Difference]: Start difference. First operand 109 states and 158 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:29:30,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:29:30,233 INFO L93 Difference]: Finished difference Result 308 states and 447 transitions. [2024-10-11 13:29:30,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:29:30,234 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 102 [2024-10-11 13:29:30,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:29:30,236 INFO L225 Difference]: With dead ends: 308 [2024-10-11 13:29:30,236 INFO L226 Difference]: Without dead ends: 200 [2024-10-11 13:29:30,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:29:30,238 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 120 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 13:29:30,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 534 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 13:29:30,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-10-11 13:29:30,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 197. [2024-10-11 13:29:30,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 174 states have (on average 1.4195402298850575) internal successors, (247), 175 states have internal predecessors, (247), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 13:29:30,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 287 transitions. [2024-10-11 13:29:30,253 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 287 transitions. Word has length 102 [2024-10-11 13:29:30,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:29:30,253 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 287 transitions. [2024-10-11 13:29:30,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:29:30,254 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 287 transitions. [2024-10-11 13:29:30,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-11 13:29:30,259 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:29:30,259 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:29:30,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:29:30,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/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-10-11 13:29:30,460 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:29:30,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:29:30,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1294826256, now seen corresponding path program 1 times [2024-10-11 13:29:30,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:29:30,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1821183777] [2024-10-11 13:29:30,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:29:30,461 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-10-11 13:29:30,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:29:30,463 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/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-10-11 13:29:30,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:29:30,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:30,911 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 13:29:30,916 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:29:31,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2024-10-11 13:29:32,860 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 17 treesize of output 9 [2024-10-11 13:29:32,873 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-10-11 13:29:32,873 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:29:41,006 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:29:41,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1821183777] [2024-10-11 13:29:41,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1821183777] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:29:41,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [656970602] [2024-10-11 13:29:41,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:29:41,006 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 13:29:41,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 13:29:41,012 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 13:29:41,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-10-11 13:29:41,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:41,892 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 13:29:41,897 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:29:42,999 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 21 treesize of output 20 [2024-10-11 13:29:43,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-11 13:29:43,358 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-10-11 13:29:43,358 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:29:47,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [656970602] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:29:47,447 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 13:29:47,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-10-11 13:29:47,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812871167] [2024-10-11 13:29:47,447 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 13:29:47,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 13:29:47,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:29:47,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 13:29:47,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=61, Unknown=1, NotChecked=0, Total=90 [2024-10-11 13:29:47,449 INFO L87 Difference]: Start difference. First operand 197 states and 287 transitions. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 6 states have internal predecessors, (79), 4 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2024-10-11 13:29:47,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:29:47,817 INFO L93 Difference]: Finished difference Result 499 states and 724 transitions. [2024-10-11 13:29:47,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:29:47,818 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 6 states have internal predecessors, (79), 4 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) Word has length 103 [2024-10-11 13:29:47,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:29:47,821 INFO L225 Difference]: With dead ends: 499 [2024-10-11 13:29:47,821 INFO L226 Difference]: Without dead ends: 303 [2024-10-11 13:29:47,822 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 269 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=47, Invalid=84, Unknown=1, NotChecked=0, Total=132 [2024-10-11 13:29:47,823 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 305 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:29:47,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 530 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:29:47,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-10-11 13:29:47,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 299. [2024-10-11 13:29:47,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 262 states have (on average 1.4083969465648856) internal successors, (369), 263 states have internal predecessors, (369), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 13:29:47,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 433 transitions. [2024-10-11 13:29:47,862 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 433 transitions. Word has length 103 [2024-10-11 13:29:47,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:29:47,864 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 433 transitions. [2024-10-11 13:29:47,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 6 states have internal predecessors, (79), 4 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2024-10-11 13:29:47,868 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 433 transitions. [2024-10-11 13:29:47,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-11 13:29:47,869 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:29:47,869 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:29:47,884 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:29:48,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2024-10-11 13:29:48,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/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 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-11 13:29:48,271 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:29:48,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:29:48,272 INFO L85 PathProgramCache]: Analyzing trace with hash -394117486, now seen corresponding path program 1 times [2024-10-11 13:29:48,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:29:48,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1981679910] [2024-10-11 13:29:48,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:29:48,273 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-10-11 13:29:48,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:29:48,276 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/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-10-11 13:29:48,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:29:48,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:48,531 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 13:29:48,534 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:29:48,564 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 19 treesize of output 11 [2024-10-11 13:29:48,578 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:29:48,578 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:29:48,578 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:29:48,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1981679910] [2024-10-11 13:29:48,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1981679910] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:29:48,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:29:48,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:29:48,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621566615] [2024-10-11 13:29:48,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:29:48,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:29:48,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:29:48,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:29:48,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:29:48,580 INFO L87 Difference]: Start difference. First operand 299 states and 433 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:29:48,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:29:48,914 INFO L93 Difference]: Finished difference Result 766 states and 1105 transitions. [2024-10-11 13:29:48,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:29:48,914 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2024-10-11 13:29:48,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:29:48,917 INFO L225 Difference]: With dead ends: 766 [2024-10-11 13:29:48,917 INFO L226 Difference]: Without dead ends: 468 [2024-10-11 13:29:48,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:29:48,919 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 112 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:29:48,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 526 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:29:48,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2024-10-11 13:29:48,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 465. [2024-10-11 13:29:48,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 407 states have (on average 1.3955773955773956) internal successors, (568), 410 states have internal predecessors, (568), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-11 13:29:48,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 668 transitions. [2024-10-11 13:29:48,950 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 668 transitions. Word has length 103 [2024-10-11 13:29:48,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:29:48,950 INFO L471 AbstractCegarLoop]: Abstraction has 465 states and 668 transitions. [2024-10-11 13:29:48,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:29:48,951 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 668 transitions. [2024-10-11 13:29:48,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-11 13:29:48,953 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:29:48,953 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:29:48,964 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:29:49,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/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-10-11 13:29:49,155 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:29:49,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:29:49,155 INFO L85 PathProgramCache]: Analyzing trace with hash -135952048, now seen corresponding path program 1 times [2024-10-11 13:29:49,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:29:49,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1650047842] [2024-10-11 13:29:49,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:29:49,156 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-10-11 13:29:49,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:29:49,157 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/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-10-11 13:29:49,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:29:49,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:49,447 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-11 13:29:49,451 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:29:49,668 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 15 treesize of output 1 [2024-10-11 13:29:50,064 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 31 treesize of output 26 [2024-10-11 13:29:51,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2024-10-11 13:29:51,308 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:29:51,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 80 treesize of output 44 [2024-10-11 13:29:51,379 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 18 proven. 128 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-10-11 13:29:51,379 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:29:51,545 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:29:51,545 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:29:51,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1650047842] [2024-10-11 13:29:51,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1650047842] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 13:29:51,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 13:29:51,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [15] total 18 [2024-10-11 13:29:51,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814697937] [2024-10-11 13:29:51,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:29:51,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:29:51,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:29:51,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:29:51,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2024-10-11 13:29:51,548 INFO L87 Difference]: Start difference. First operand 465 states and 668 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:29:52,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:29:52,259 INFO L93 Difference]: Finished difference Result 1158 states and 1651 transitions. [2024-10-11 13:29:52,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:29:52,260 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2024-10-11 13:29:52,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:29:52,264 INFO L225 Difference]: With dead ends: 1158 [2024-10-11 13:29:52,264 INFO L226 Difference]: Without dead ends: 694 [2024-10-11 13:29:52,266 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2024-10-11 13:29:52,266 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 55 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 13:29:52,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 659 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 13:29:52,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2024-10-11 13:29:52,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 518. [2024-10-11 13:29:52,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 460 states have (on average 1.3782608695652174) internal successors, (634), 463 states have internal predecessors, (634), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-11 13:29:52,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 734 transitions. [2024-10-11 13:29:52,301 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 734 transitions. Word has length 103 [2024-10-11 13:29:52,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:29:52,302 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 734 transitions. [2024-10-11 13:29:52,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:29:52,302 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 734 transitions. [2024-10-11 13:29:52,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 13:29:52,303 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:29:52,303 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:29:52,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-11 13:29:52,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/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-10-11 13:29:52,504 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:29:52,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:29:52,505 INFO L85 PathProgramCache]: Analyzing trace with hash 139234422, now seen corresponding path program 1 times [2024-10-11 13:29:52,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:29:52,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1309413094] [2024-10-11 13:29:52,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:29:52,506 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-10-11 13:29:52,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:29:52,509 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/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-10-11 13:29:52,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-11 13:29:52,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:52,809 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-11 13:29:52,811 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:29:53,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-11 13:29:53,936 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 24 treesize of output 23 [2024-10-11 13:29:54,007 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:29:54,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 16 [2024-10-11 13:29:54,027 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-10-11 13:29:54,027 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:29:54,184 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:29:54,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1309413094] [2024-10-11 13:29:54,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1309413094] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:29:54,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1576535340] [2024-10-11 13:29:54,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:29:54,185 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 13:29:54,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 13:29:54,187 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 13:29:54,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2024-10-11 13:29:55,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:55,063 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 13:29:55,066 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:29:55,940 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 15 treesize of output 1 [2024-10-11 13:29:56,122 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 24 treesize of output 23 [2024-10-11 13:29:56,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2024-10-11 13:29:56,245 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-10-11 13:29:56,246 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:29:56,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1576535340] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:29:56,309 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 13:29:56,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2024-10-11 13:29:56,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273288866] [2024-10-11 13:29:56,310 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 13:29:56,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 13:29:56,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:29:56,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 13:29:56,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2024-10-11 13:29:56,311 INFO L87 Difference]: Start difference. First operand 518 states and 734 transitions. Second operand has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 13 states have internal predecessors, (88), 4 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2024-10-11 13:29:57,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:29:57,085 INFO L93 Difference]: Finished difference Result 1173 states and 1668 transitions. [2024-10-11 13:29:57,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:29:57,086 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 13 states have internal predecessors, (88), 4 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) Word has length 104 [2024-10-11 13:29:57,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:29:57,091 INFO L225 Difference]: With dead ends: 1173 [2024-10-11 13:29:57,091 INFO L226 Difference]: Without dead ends: 771 [2024-10-11 13:29:57,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 241 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=125, Invalid=337, Unknown=0, NotChecked=0, Total=462 [2024-10-11 13:29:57,094 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 491 mSDsluCounter, 956 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 1150 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 13:29:57,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 1150 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 13:29:57,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2024-10-11 13:29:57,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 569. [2024-10-11 13:29:57,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 511 states have (on average 1.3894324853228963) internal successors, (710), 514 states have internal predecessors, (710), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-11 13:29:57,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 810 transitions. [2024-10-11 13:29:57,134 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 810 transitions. Word has length 104 [2024-10-11 13:29:57,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:29:57,134 INFO L471 AbstractCegarLoop]: Abstraction has 569 states and 810 transitions. [2024-10-11 13:29:57,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 13 states have internal predecessors, (88), 4 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2024-10-11 13:29:57,135 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 810 transitions. [2024-10-11 13:29:57,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 13:29:57,136 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:29:57,136 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:29:57,150 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Ended with exit code 0 [2024-10-11 13:29:57,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-10-11 13:29:57,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,11 /storage/repos/ultimate-clean/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-10-11 13:29:57,537 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:29:57,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:29:57,537 INFO L85 PathProgramCache]: Analyzing trace with hash -447571592, now seen corresponding path program 1 times [2024-10-11 13:29:57,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:29:57,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [591262361] [2024-10-11 13:29:57,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:29:57,538 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-10-11 13:29:57,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:29:57,539 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/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-10-11 13:29:57,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-11 13:29:57,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:57,776 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 13:29:57,779 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:29:57,786 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-10-11 13:29:57,803 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 17 treesize of output 9 [2024-10-11 13:29:57,845 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:29:57,845 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:29:57,846 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:29:57,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [591262361] [2024-10-11 13:29:57,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [591262361] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:29:57,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:29:57,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 13:29:57,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497598418] [2024-10-11 13:29:57,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:29:57,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 13:29:57,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:29:57,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 13:29:57,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:29:57,847 INFO L87 Difference]: Start difference. First operand 569 states and 810 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:29:58,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:29:58,210 INFO L93 Difference]: Finished difference Result 1109 states and 1580 transitions. [2024-10-11 13:29:58,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 13:29:58,211 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2024-10-11 13:29:58,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:29:58,214 INFO L225 Difference]: With dead ends: 1109 [2024-10-11 13:29:58,214 INFO L226 Difference]: Without dead ends: 656 [2024-10-11 13:29:58,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 97 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-10-11 13:29:58,217 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 128 mSDsluCounter, 1158 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 1419 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:29:58,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 1419 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:29:58,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2024-10-11 13:29:58,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 567. [2024-10-11 13:29:58,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 509 states have (on average 1.387033398821218) internal successors, (706), 512 states have internal predecessors, (706), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-11 13:29:58,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 806 transitions. [2024-10-11 13:29:58,253 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 806 transitions. Word has length 104 [2024-10-11 13:29:58,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:29:58,254 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 806 transitions. [2024-10-11 13:29:58,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:29:58,254 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 806 transitions. [2024-10-11 13:29:58,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 13:29:58,256 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:29:58,256 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:29:58,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-10-11 13:29:58,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-clean/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-10-11 13:29:58,461 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:29:58,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:29:58,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1944672756, now seen corresponding path program 1 times [2024-10-11 13:29:58,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:29:58,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [471567639] [2024-10-11 13:29:58,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:29:58,462 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-10-11 13:29:58,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:29:58,465 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/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-10-11 13:29:58,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-11 13:29:58,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:29:58,751 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 13:29:58,754 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:29:58,897 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-10-11 13:29:58,897 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 1 case distinctions, treesize of input 29 treesize of output 28 [2024-10-11 13:29:59,043 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:29:59,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 30 [2024-10-11 13:29:59,123 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:29:59,123 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:29:59,124 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:29:59,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [471567639] [2024-10-11 13:29:59,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [471567639] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:29:59,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:29:59,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 13:29:59,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396705357] [2024-10-11 13:29:59,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:29:59,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 13:29:59,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:29:59,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 13:29:59,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-11 13:29:59,125 INFO L87 Difference]: Start difference. First operand 567 states and 806 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:29:59,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:29:59,989 INFO L93 Difference]: Finished difference Result 1111 states and 1577 transitions. [2024-10-11 13:29:59,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 13:29:59,990 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2024-10-11 13:29:59,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:29:59,993 INFO L225 Difference]: With dead ends: 1111 [2024-10-11 13:29:59,993 INFO L226 Difference]: Without dead ends: 660 [2024-10-11 13:29:59,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2024-10-11 13:29:59,996 INFO L432 NwaCegarLoop]: 253 mSDtfsCounter, 229 mSDsluCounter, 1462 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 2 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 1715 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 13:29:59,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 1715 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 418 Invalid, 3 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 13:29:59,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2024-10-11 13:30:00,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 481. [2024-10-11 13:30:00,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 431 states have (on average 1.382830626450116) internal successors, (596), 433 states have internal predecessors, (596), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-11 13:30:00,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 680 transitions. [2024-10-11 13:30:00,031 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 680 transitions. Word has length 104 [2024-10-11 13:30:00,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:30:00,032 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 680 transitions. [2024-10-11 13:30:00,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:30:00,032 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 680 transitions. [2024-10-11 13:30:00,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-11 13:30:00,033 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:30:00,033 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:30:00,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-10-11 13:30:00,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-clean/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-10-11 13:30:00,234 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:30:00,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:30:00,235 INFO L85 PathProgramCache]: Analyzing trace with hash -219259458, now seen corresponding path program 1 times [2024-10-11 13:30:00,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:30:00,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1323763313] [2024-10-11 13:30:00,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:30:00,235 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-10-11 13:30:00,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:30:00,237 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/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-10-11 13:30:00,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-10-11 13:30:00,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:00,640 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-11 13:30:00,644 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:30:01,254 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-10-11 13:30:01,522 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 26 treesize of output 21 [2024-10-11 13:30:01,896 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:30:01,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 32 [2024-10-11 13:30:01,913 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-10-11 13:30:01,913 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:30:02,021 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:30:02,021 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:30:02,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1323763313] [2024-10-11 13:30:02,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1323763313] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 13:30:02,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 13:30:02,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2024-10-11 13:30:02,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374126015] [2024-10-11 13:30:02,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:30:02,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:30:02,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:30:02,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:30:02,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:30:02,023 INFO L87 Difference]: Start difference. First operand 481 states and 680 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:30:02,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:30:02,276 INFO L93 Difference]: Finished difference Result 526 states and 740 transitions. [2024-10-11 13:30:02,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:30:02,277 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 105 [2024-10-11 13:30:02,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:30:02,280 INFO L225 Difference]: With dead ends: 526 [2024-10-11 13:30:02,280 INFO L226 Difference]: Without dead ends: 524 [2024-10-11 13:30:02,280 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-11 13:30:02,281 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 116 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:30:02,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 594 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:30:02,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2024-10-11 13:30:02,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 417. [2024-10-11 13:30:02,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 375 states have (on average 1.3813333333333333) internal successors, (518), 376 states have internal predecessors, (518), 34 states have call successors, (34), 7 states have call predecessors, (34), 7 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 13:30:02,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 586 transitions. [2024-10-11 13:30:02,310 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 586 transitions. Word has length 105 [2024-10-11 13:30:02,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:30:02,310 INFO L471 AbstractCegarLoop]: Abstraction has 417 states and 586 transitions. [2024-10-11 13:30:02,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:30:02,310 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 586 transitions. [2024-10-11 13:30:02,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-11 13:30:02,311 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:30:02,311 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:30:02,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-10-11 13:30:02,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-clean/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-10-11 13:30:02,512 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:30:02,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:30:02,513 INFO L85 PathProgramCache]: Analyzing trace with hash -219199876, now seen corresponding path program 1 times [2024-10-11 13:30:02,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:30:02,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1263486005] [2024-10-11 13:30:02,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:30:02,513 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-10-11 13:30:02,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:30:02,514 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/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-10-11 13:30:02,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-10-11 13:30:03,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:30:03,260 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-11 13:30:03,264 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:30:03,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-11 13:30:03,997 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:30:03,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 77 [2024-10-11 13:30:08,841 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 15 treesize of output 1 [2024-10-11 13:30:21,798 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 203 treesize of output 167 [2024-10-11 13:30:21,819 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:30:21,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 287 treesize of output 125 [2024-10-11 13:30:22,322 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 24 proven. 140 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-10-11 13:30:22,322 INFO L311 TraceCheckSpWp]: Computing backward predicates...