./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-p_file-11.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-p_file-11.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 731a50c3ad3ae6f9ff7b1b7184a0c63ba8d981ab93f9514804edd7dd5e5d73f5 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:34:30,948 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:34:31,016 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:34:31,025 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:34:31,025 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:34:31,058 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:34:31,059 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:34:31,059 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:34:31,060 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:34:31,060 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:34:31,061 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:34:31,061 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:34:31,062 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:34:31,062 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:34:31,063 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:34:31,063 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:34:31,063 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:34:31,064 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:34:31,064 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 13:34:31,065 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:34:31,068 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:34:31,069 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:34:31,069 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:34:31,070 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:34:31,070 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:34:31,070 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:34:31,070 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:34:31,071 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:34:31,071 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:34:31,071 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:34:31,072 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:34:31,072 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:34:31,073 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:34:31,074 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:34:31,074 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:34:31,074 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:34:31,074 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 13:34:31,075 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 13:34:31,075 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:34:31,075 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:34:31,075 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:34:31,076 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:34:31,076 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 -> 731a50c3ad3ae6f9ff7b1b7184a0c63ba8d981ab93f9514804edd7dd5e5d73f5 [2024-10-11 13:34:31,341 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:34:31,378 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:34:31,383 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:34:31,385 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:34:31,385 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:34:31,387 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-11.i [2024-10-11 13:34:32,855 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:34:33,083 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:34:33,083 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-11.i [2024-10-11 13:34:33,096 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c7409e17b/4d095620fe974dec8cb28c4d8b755ad7/FLAG8a582b64a [2024-10-11 13:34:33,116 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c7409e17b/4d095620fe974dec8cb28c4d8b755ad7 [2024-10-11 13:34:33,118 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:34:33,120 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:34:33,121 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:34:33,121 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:34:33,126 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:34:33,126 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:34:33" (1/1) ... [2024-10-11 13:34:33,127 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1041c67c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:34:33, skipping insertion in model container [2024-10-11 13:34:33,128 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:34:33" (1/1) ... [2024-10-11 13:34:33,159 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:34:33,380 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-p_file-11.i[916,929] [2024-10-11 13:34:33,448 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:34:33,460 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:34:33,471 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-p_file-11.i[916,929] [2024-10-11 13:34:33,499 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:34:33,522 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:34:33,525 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:34:33 WrapperNode [2024-10-11 13:34:33,525 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:34:33,527 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:34:33,528 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:34:33,528 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:34:33,536 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:34:33" (1/1) ... [2024-10-11 13:34:33,549 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:34:33" (1/1) ... [2024-10-11 13:34:33,597 INFO L138 Inliner]: procedures = 29, calls = 182, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 619 [2024-10-11 13:34:33,598 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:34:33,599 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:34:33,599 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:34:33,599 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:34:33,611 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:34:33" (1/1) ... [2024-10-11 13:34:33,611 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:34:33" (1/1) ... [2024-10-11 13:34:33,617 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:34:33" (1/1) ... [2024-10-11 13:34:33,650 INFO L175 MemorySlicer]: Split 141 memory accesses to 15 slices as follows [2, 5, 10, 8, 8, 17, 12, 10, 10, 6, 6, 5, 12, 22, 8]. 16 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 17 writes are split as follows [0, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1]. [2024-10-11 13:34:33,651 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:34:33" (1/1) ... [2024-10-11 13:34:33,651 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:34:33" (1/1) ... [2024-10-11 13:34:33,681 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:34:33" (1/1) ... [2024-10-11 13:34:33,692 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:34:33" (1/1) ... [2024-10-11 13:34:33,704 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:34:33" (1/1) ... [2024-10-11 13:34:33,712 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:34:33" (1/1) ... [2024-10-11 13:34:33,728 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:34:33,733 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:34:33,733 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:34:33,733 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:34:33,734 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:34:33" (1/1) ... [2024-10-11 13:34:33,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:34:33,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:34:33,783 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:34:33,786 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:34:33,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:34:33,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 13:34:33,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 13:34:33,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 13:34:33,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-11 13:34:33,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-11 13:34:33,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-11 13:34:33,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-11 13:34:33,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-11 13:34:33,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-10-11 13:34:33,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-10-11 13:34:33,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-10-11 13:34:33,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-10-11 13:34:33,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-10-11 13:34:33,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-10-11 13:34:33,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2024-10-11 13:34:33,848 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-11 13:34:33,848 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-11 13:34:33,849 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-11 13:34:33,849 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-11 13:34:33,849 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-11 13:34:33,849 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-10-11 13:34:33,849 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-10-11 13:34:33,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2024-10-11 13:34:33,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2024-10-11 13:34:33,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2024-10-11 13:34:33,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2024-10-11 13:34:33,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2024-10-11 13:34:33,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2024-10-11 13:34:33,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#13 [2024-10-11 13:34:33,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#14 [2024-10-11 13:34:33,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-11 13:34:33,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-11 13:34:33,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-11 13:34:33,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-11 13:34:33,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-11 13:34:33,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-10-11 13:34:33,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-10-11 13:34:33,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2024-10-11 13:34:33,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2024-10-11 13:34:33,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2024-10-11 13:34:33,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2024-10-11 13:34:33,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2024-10-11 13:34:33,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2024-10-11 13:34:33,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#13 [2024-10-11 13:34:33,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#14 [2024-10-11 13:34:33,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 13:34:33,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 13:34:33,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 13:34:33,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-11 13:34:33,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-11 13:34:33,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-11 13:34:33,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-11 13:34:33,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-11 13:34:33,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-10-11 13:34:33,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-10-11 13:34:33,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-10-11 13:34:33,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-10-11 13:34:33,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-10-11 13:34:33,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-10-11 13:34:33,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2024-10-11 13:34:33,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-11 13:34:33,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-11 13:34:33,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-11 13:34:33,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-11 13:34:33,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-10-11 13:34:33,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-10-11 13:34:33,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-10-11 13:34:33,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2024-10-11 13:34:33,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2024-10-11 13:34:33,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2024-10-11 13:34:33,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2024-10-11 13:34:33,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2024-10-11 13:34:33,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2024-10-11 13:34:33,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#13 [2024-10-11 13:34:33,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#14 [2024-10-11 13:34:33,859 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:34:33,859 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:34:33,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 13:34:33,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 13:34:33,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 13:34:33,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 13:34:33,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 13:34:33,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-11 13:34:33,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-11 13:34:33,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-11 13:34:33,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-11 13:34:33,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-11 13:34:33,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-11 13:34:33,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-11 13:34:33,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-11 13:34:33,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-11 13:34:33,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-11 13:34:33,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:34:33,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:34:34,076 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:34:34,078 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:34:34,805 INFO L? ?]: Removed 161 outVars from TransFormulas that were not future-live. [2024-10-11 13:34:34,805 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:34:34,865 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:34:34,866 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:34:34,866 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:34:34 BoogieIcfgContainer [2024-10-11 13:34:34,866 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:34:34,870 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:34:34,870 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:34:34,873 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:34:34,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:34:33" (1/3) ... [2024-10-11 13:34:34,876 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ef1a3b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:34:34, skipping insertion in model container [2024-10-11 13:34:34,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:34:33" (2/3) ... [2024-10-11 13:34:34,876 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ef1a3b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:34:34, skipping insertion in model container [2024-10-11 13:34:34,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:34:34" (3/3) ... [2024-10-11 13:34:34,882 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-11.i [2024-10-11 13:34:34,900 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:34:34,900 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:34:34,984 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:34:34,994 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;@2d53bda2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:34:34,994 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:34:35,000 INFO L276 IsEmpty]: Start isEmpty. Operand has 132 states, 113 states have (on average 1.4955752212389382) internal successors, (169), 114 states have internal predecessors, (169), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 13:34:35,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-11 13:34:35,017 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:34:35,019 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:34:35,019 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:34:35,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:34:35,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1740103682, now seen corresponding path program 1 times [2024-10-11 13:34:35,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:34:35,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344360929] [2024-10-11 13:34:35,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:34:35,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:34:35,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:35,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 13:34:35,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:35,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:34:35,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:35,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:34:35,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:35,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:34:35,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:35,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:34:35,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:35,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:34:35,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:35,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:34:35,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:35,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:34:35,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:35,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:34:35,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:35,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:34:35,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:35,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:34:35,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:35,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:34:35,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:35,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:34:35,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:35,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:34:35,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:35,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:34:35,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:35,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:34:35,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:35,542 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 13:34:35,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:34:35,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344360929] [2024-10-11 13:34:35,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344360929] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:34:35,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:34:35,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:34:35,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657705385] [2024-10-11 13:34:35,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:34:35,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:34:35,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:34:35,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:34:35,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:34:35,584 INFO L87 Difference]: Start difference. First operand has 132 states, 113 states have (on average 1.4955752212389382) internal successors, (169), 114 states have internal predecessors, (169), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 13:34:35,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:34:35,638 INFO L93 Difference]: Finished difference Result 261 states and 416 transitions. [2024-10-11 13:34:35,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:34:35,642 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 128 [2024-10-11 13:34:35,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:34:35,652 INFO L225 Difference]: With dead ends: 261 [2024-10-11 13:34:35,653 INFO L226 Difference]: Without dead ends: 130 [2024-10-11 13:34:35,657 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:34:35,663 INFO L432 NwaCegarLoop]: 192 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, 192 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:34:35,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 192 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:34:35,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-10-11 13:34:35,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-10-11 13:34:35,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 112 states have (on average 1.4642857142857142) internal successors, (164), 112 states have internal predecessors, (164), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 13:34:35,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 196 transitions. [2024-10-11 13:34:35,728 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 196 transitions. Word has length 128 [2024-10-11 13:34:35,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:34:35,730 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 196 transitions. [2024-10-11 13:34:35,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 13:34:35,731 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 196 transitions. [2024-10-11 13:34:35,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-11 13:34:35,736 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:34:35,736 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:34:35,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 13:34:35,737 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:34:35,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:34:35,737 INFO L85 PathProgramCache]: Analyzing trace with hash -924408214, now seen corresponding path program 1 times [2024-10-11 13:34:35,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:34:35,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674089060] [2024-10-11 13:34:35,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:34:35,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:34:35,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:36,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 13:34:36,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:36,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:34:36,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:36,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:34:36,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:36,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:34:36,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:36,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:34:36,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:36,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:34:36,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:36,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:34:36,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:36,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:34:36,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:36,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:34:36,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:36,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:34:36,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:36,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:34:36,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:36,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:34:36,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:36,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:34:36,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:36,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:34:36,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:36,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:34:36,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:36,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:34:36,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:36,303 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 13:34:36,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:34:36,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674089060] [2024-10-11 13:34:36,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674089060] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:34:36,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:34:36,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:34:36,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626394243] [2024-10-11 13:34:36,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:34:36,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:34:36,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:34:36,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:34:36,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:34:36,310 INFO L87 Difference]: Start difference. First operand 130 states and 196 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 13:34:36,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:34:36,388 INFO L93 Difference]: Finished difference Result 261 states and 394 transitions. [2024-10-11 13:34:36,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:34:36,389 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 128 [2024-10-11 13:34:36,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:34:36,391 INFO L225 Difference]: With dead ends: 261 [2024-10-11 13:34:36,391 INFO L226 Difference]: Without dead ends: 132 [2024-10-11 13:34:36,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:34:36,394 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 0 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 563 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:34:36,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 563 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:34:36,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-10-11 13:34:36,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2024-10-11 13:34:36,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 114 states have (on average 1.456140350877193) internal successors, (166), 114 states have internal predecessors, (166), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 13:34:36,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 198 transitions. [2024-10-11 13:34:36,419 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 198 transitions. Word has length 128 [2024-10-11 13:34:36,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:34:36,422 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 198 transitions. [2024-10-11 13:34:36,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 13:34:36,423 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 198 transitions. [2024-10-11 13:34:36,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-11 13:34:36,425 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:34:36,425 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:34:36,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 13:34:36,426 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:34:36,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:34:36,427 INFO L85 PathProgramCache]: Analyzing trace with hash -182284474, now seen corresponding path program 1 times [2024-10-11 13:34:36,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:34:36,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249967571] [2024-10-11 13:34:36,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:34:36,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:34:36,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:36,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 13:34:36,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:36,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:34:36,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:36,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:34:36,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:36,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:34:36,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:36,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:34:36,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:36,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:34:36,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:36,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:34:36,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:36,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:34:36,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:36,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:34:36,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:36,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:34:36,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:36,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:34:36,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:36,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:34:36,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:36,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:34:36,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:36,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:34:36,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:36,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:34:36,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:36,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:34:36,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:36,710 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 13:34:36,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:34:36,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249967571] [2024-10-11 13:34:36,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249967571] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:34:36,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:34:36,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:34:36,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558847224] [2024-10-11 13:34:36,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:34:36,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:34:36,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:34:36,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:34:36,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:34:36,713 INFO L87 Difference]: Start difference. First operand 132 states and 198 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 13:34:36,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:34:36,774 INFO L93 Difference]: Finished difference Result 266 states and 399 transitions. [2024-10-11 13:34:36,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:34:36,775 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 130 [2024-10-11 13:34:36,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:34:36,777 INFO L225 Difference]: With dead ends: 266 [2024-10-11 13:34:36,777 INFO L226 Difference]: Without dead ends: 135 [2024-10-11 13:34:36,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 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:34:36,782 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 0 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:34:36,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 745 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:34:36,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-10-11 13:34:36,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-10-11 13:34:36,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 117 states have (on average 1.4444444444444444) internal successors, (169), 117 states have internal predecessors, (169), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 13:34:36,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 201 transitions. [2024-10-11 13:34:36,801 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 201 transitions. Word has length 130 [2024-10-11 13:34:36,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:34:36,801 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 201 transitions. [2024-10-11 13:34:36,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 13:34:36,805 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 201 transitions. [2024-10-11 13:34:36,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 13:34:36,807 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:34:36,807 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:34:36,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 13:34:36,808 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:34:36,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:34:36,808 INFO L85 PathProgramCache]: Analyzing trace with hash 485803080, now seen corresponding path program 1 times [2024-10-11 13:34:36,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:34:36,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667850229] [2024-10-11 13:34:36,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:34:36,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:34:36,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:37,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 13:34:37,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:37,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:34:37,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:37,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:34:37,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:37,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:34:37,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:37,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:34:37,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:37,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:34:37,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:37,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:34:37,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:37,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:34:37,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:37,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:34:37,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:37,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:34:37,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:37,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:34:37,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:37,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:34:37,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:37,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:34:37,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:37,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:34:37,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:37,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:34:37,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:37,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:34:37,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:37,098 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 13:34:37,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:34:37,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667850229] [2024-10-11 13:34:37,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667850229] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:34:37,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:34:37,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:34:37,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602379049] [2024-10-11 13:34:37,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:34:37,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:34:37,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:34:37,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:34:37,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:34:37,102 INFO L87 Difference]: Start difference. First operand 135 states and 201 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 13:34:37,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:34:37,165 INFO L93 Difference]: Finished difference Result 272 states and 405 transitions. [2024-10-11 13:34:37,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:34:37,166 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 131 [2024-10-11 13:34:37,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:34:37,168 INFO L225 Difference]: With dead ends: 272 [2024-10-11 13:34:37,168 INFO L226 Difference]: Without dead ends: 138 [2024-10-11 13:34:37,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 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:34:37,174 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 0 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:34:37,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 747 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:34:37,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-10-11 13:34:37,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2024-10-11 13:34:37,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 118 states have (on average 1.4406779661016949) internal successors, (170), 118 states have internal predecessors, (170), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 13:34:37,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 202 transitions. [2024-10-11 13:34:37,190 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 202 transitions. Word has length 131 [2024-10-11 13:34:37,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:34:37,192 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 202 transitions. [2024-10-11 13:34:37,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 13:34:37,193 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 202 transitions. [2024-10-11 13:34:37,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-11 13:34:37,195 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:34:37,195 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:34:37,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 13:34:37,196 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:34:37,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:34:37,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1607818929, now seen corresponding path program 1 times [2024-10-11 13:34:37,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:34:37,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453716904] [2024-10-11 13:34:37,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:34:37,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:34:37,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:37,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 13:34:37,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:37,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:34:37,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:37,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:34:37,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:37,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:34:37,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:37,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:34:37,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:37,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:34:37,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:37,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:34:37,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:37,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:34:37,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:37,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:34:37,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:37,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:34:37,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:37,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:34:37,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:37,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:34:37,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:37,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:34:37,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:37,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:34:37,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:37,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:34:37,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:37,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:34:37,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:37,486 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 13:34:37,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:34:37,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453716904] [2024-10-11 13:34:37,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453716904] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:34:37,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:34:37,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:34:37,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115539692] [2024-10-11 13:34:37,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:34:37,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:34:37,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:34:37,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:34:37,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:34:37,491 INFO L87 Difference]: Start difference. First operand 136 states and 202 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 13:34:37,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:34:37,547 INFO L93 Difference]: Finished difference Result 275 states and 408 transitions. [2024-10-11 13:34:37,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:34:37,548 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 132 [2024-10-11 13:34:37,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:34:37,550 INFO L225 Difference]: With dead ends: 275 [2024-10-11 13:34:37,552 INFO L226 Difference]: Without dead ends: 140 [2024-10-11 13:34:37,553 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 35 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:34:37,554 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 0 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 927 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:34:37,557 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 927 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:34:37,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-10-11 13:34:37,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 137. [2024-10-11 13:34:37,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 119 states have (on average 1.4369747899159664) internal successors, (171), 119 states have internal predecessors, (171), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 13:34:37,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 203 transitions. [2024-10-11 13:34:37,569 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 203 transitions. Word has length 132 [2024-10-11 13:34:37,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:34:37,569 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 203 transitions. [2024-10-11 13:34:37,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 13:34:37,570 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 203 transitions. [2024-10-11 13:34:37,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-11 13:34:37,574 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:34:37,575 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:34:37,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 13:34:37,575 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:34:37,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:34:37,576 INFO L85 PathProgramCache]: Analyzing trace with hash 158961268, now seen corresponding path program 1 times [2024-10-11 13:34:37,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:34:37,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335178135] [2024-10-11 13:34:37,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:34:37,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:34:37,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:37,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 13:34:37,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:37,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:34:37,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:37,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:34:37,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:37,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:34:37,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:37,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:34:37,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:37,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:34:37,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:37,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:34:37,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:37,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:34:37,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:37,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:34:37,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:37,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:34:37,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:37,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:34:37,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:37,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:34:37,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:37,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:34:37,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:37,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:34:37,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:37,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:34:37,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:37,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:34:37,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:34:37,839 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 13:34:37,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:34:37,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335178135] [2024-10-11 13:34:37,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335178135] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:34:37,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:34:37,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:34:37,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511995291] [2024-10-11 13:34:37,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:34:37,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:34:37,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:34:37,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:34:37,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:34:37,846 INFO L87 Difference]: Start difference. First operand 137 states and 203 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 13:34:37,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:34:37,919 INFO L93 Difference]: Finished difference Result 276 states and 409 transitions. [2024-10-11 13:34:37,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:34:37,920 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 132 [2024-10-11 13:34:37,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:34:37,923 INFO L225 Difference]: With dead ends: 276 [2024-10-11 13:34:37,923 INFO L226 Difference]: Without dead ends: 140 [2024-10-11 13:34:37,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 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:34:37,925 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 0 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:34:37,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 746 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:34:37,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-10-11 13:34:37,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2024-10-11 13:34:37,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 122 states have (on average 1.4262295081967213) internal successors, (174), 122 states have internal predecessors, (174), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 13:34:37,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 206 transitions. [2024-10-11 13:34:37,943 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 206 transitions. Word has length 132 [2024-10-11 13:34:37,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:34:37,944 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 206 transitions. [2024-10-11 13:34:37,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 13:34:37,944 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 206 transitions. [2024-10-11 13:34:37,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-11 13:34:37,946 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:34:37,946 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:34:37,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 13:34:37,948 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:34:37,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:34:37,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1674204255, now seen corresponding path program 1 times [2024-10-11 13:34:37,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:34:37,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497968630] [2024-10-11 13:34:37,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:34:37,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:34:38,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:34:38,058 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 13:34:38,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:34:38,236 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 13:34:38,236 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 13:34:38,237 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 13:34:38,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 13:34:38,243 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:34:38,440 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 13:34:38,446 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 01:34:38 BoogieIcfgContainer [2024-10-11 13:34:38,446 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 13:34:38,447 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 13:34:38,448 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 13:34:38,448 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 13:34:38,448 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:34:34" (3/4) ... [2024-10-11 13:34:38,450 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 13:34:38,452 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 13:34:38,452 INFO L158 Benchmark]: Toolchain (without parser) took 5332.51ms. Allocated memory was 159.4MB in the beginning and 232.8MB in the end (delta: 73.4MB). Free memory was 91.1MB in the beginning and 118.5MB in the end (delta: -27.4MB). Peak memory consumption was 47.9MB. Max. memory is 16.1GB. [2024-10-11 13:34:38,453 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 159.4MB. Free memory is still 124.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:34:38,454 INFO L158 Benchmark]: CACSL2BoogieTranslator took 405.55ms. Allocated memory is still 159.4MB. Free memory was 91.0MB in the beginning and 124.4MB in the end (delta: -33.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 13:34:38,454 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.69ms. Allocated memory is still 159.4MB. Free memory was 124.4MB in the beginning and 120.3MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 13:34:38,454 INFO L158 Benchmark]: Boogie Preprocessor took 133.52ms. Allocated memory is still 159.4MB. Free memory was 120.3MB in the beginning and 114.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 13:34:38,454 INFO L158 Benchmark]: RCFGBuilder took 1133.35ms. Allocated memory is still 159.4MB. Free memory was 114.0MB in the beginning and 111.7MB in the end (delta: 2.3MB). Peak memory consumption was 54.6MB. Max. memory is 16.1GB. [2024-10-11 13:34:38,456 INFO L158 Benchmark]: TraceAbstraction took 3576.88ms. Allocated memory was 159.4MB in the beginning and 232.8MB in the end (delta: 73.4MB). Free memory was 111.7MB in the beginning and 118.5MB in the end (delta: -6.9MB). Peak memory consumption was 66.3MB. Max. memory is 16.1GB. [2024-10-11 13:34:38,456 INFO L158 Benchmark]: Witness Printer took 4.90ms. Allocated memory is still 232.8MB. Free memory is still 118.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:34:38,457 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.20ms. Allocated memory is still 159.4MB. Free memory is still 124.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 405.55ms. Allocated memory is still 159.4MB. Free memory was 91.0MB in the beginning and 124.4MB in the end (delta: -33.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.69ms. Allocated memory is still 159.4MB. Free memory was 124.4MB in the beginning and 120.3MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 133.52ms. Allocated memory is still 159.4MB. Free memory was 120.3MB in the beginning and 114.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1133.35ms. Allocated memory is still 159.4MB. Free memory was 114.0MB in the beginning and 111.7MB in the end (delta: 2.3MB). Peak memory consumption was 54.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3576.88ms. Allocated memory was 159.4MB in the beginning and 232.8MB in the end (delta: 73.4MB). Free memory was 111.7MB in the beginning and 118.5MB in the end (delta: -6.9MB). Peak memory consumption was 66.3MB. Max. memory is 16.1GB. * Witness Printer took 4.90ms. Allocated memory is still 232.8MB. Free memory is still 118.5MB. 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 114, overapproximation of someBinaryFLOATComparisonOperation at line 114. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -16; [L22] signed char var_1_1 = -16; [L23] signed char* var_1_1_Pointer = &(var_1_1); [L24] double var_1_2 = 50.75; [L24] double var_1_2 = 50.75; [L25] double* var_1_2_Pointer = &(var_1_2); [L26] double var_1_3 = 7.675; [L26] double var_1_3 = 7.675; [L27] double* var_1_3_Pointer = &(var_1_3); [L28] signed char var_1_7 = 10; [L28] signed char var_1_7 = 10; [L29] signed char* var_1_7_Pointer = &(var_1_7); [L30] float var_1_8 = 32.5; [L30] float var_1_8 = 32.5; [L31] float* var_1_8_Pointer = &(var_1_8); [L32] float var_1_9 = 1000000.7; [L32] float var_1_9 = 1000000.7; [L33] float* var_1_9_Pointer = &(var_1_9); [L34] float var_1_10 = 2.4; [L34] float var_1_10 = 2.4; [L35] float* var_1_10_Pointer = &(var_1_10); [L36] unsigned char var_1_11 = 1; [L36] unsigned char var_1_11 = 1; [L37] unsigned char* var_1_11_Pointer = &(var_1_11); [L38] unsigned char var_1_12 = 1; [L38] unsigned char var_1_12 = 1; [L39] unsigned char* var_1_12_Pointer = &(var_1_12); [L40] unsigned char var_1_13 = 1; [L40] unsigned char var_1_13 = 1; [L41] unsigned char* var_1_13_Pointer = &(var_1_13); [L42] unsigned char var_1_14 = 5; [L42] unsigned char var_1_14 = 5; [L43] unsigned char* var_1_14_Pointer = &(var_1_14); [L44] unsigned char var_1_15 = 200; [L44] unsigned char var_1_15 = 200; [L45] unsigned char* var_1_15_Pointer = &(var_1_15); [L46] unsigned char var_1_16 = 10; [L46] unsigned char var_1_16 = 10; [L47] unsigned char* var_1_16_Pointer = &(var_1_16); [L48] unsigned char var_1_17 = 1; [L48] unsigned char var_1_17 = 1; [L49] unsigned char* var_1_17_Pointer = &(var_1_17); [L50] unsigned char last_1_var_1_11 = 1; [L118] isInitial = 1 [L119] FCALL initially() [L120] COND TRUE 1 [L121] CALL updateLastVariables() [L111] EXPR \read(var_1_11) [L111] last_1_var_1_11 = var_1_11 [L121] RET updateLastVariables() [L122] CALL updateVariables() [L83] var_1_2 = __VERIFIER_nondet_double() [L84] EXPR \read(var_1_2) [L84] EXPR var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L84] EXPR var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F [L84] EXPR \read(var_1_2) [L84] EXPR var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L84] EXPR (var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L84] EXPR (var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L84] CALL assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L84] RET assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L85] var_1_3 = __VERIFIER_nondet_double() [L86] EXPR \read(var_1_3) [L86] EXPR var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L86] EXPR var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F [L86] EXPR \read(var_1_3) [L86] EXPR var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L86] EXPR (var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L86] EXPR (var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L86] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L86] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L87] var_1_7 = __VERIFIER_nondet_char() [L88] EXPR \read(var_1_7) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L88] CALL assume_abort_if_not(var_1_7 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L88] RET assume_abort_if_not(var_1_7 >= -127) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L89] EXPR \read(var_1_7) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L89] CALL assume_abort_if_not(var_1_7 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L89] RET assume_abort_if_not(var_1_7 <= 126) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L90] var_1_9 = __VERIFIER_nondet_float() [L91] EXPR \read(var_1_9) [L91] EXPR var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L91] EXPR var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F [L91] EXPR \read(var_1_9) [L91] EXPR var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L91] EXPR (var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L91] EXPR (var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L91] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L91] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L92] var_1_10 = __VERIFIER_nondet_float() [L93] EXPR \read(var_1_10) [L93] EXPR var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L93] EXPR var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F [L93] EXPR \read(var_1_10) [L93] EXPR var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L93] EXPR (var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L93] EXPR (var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L93] CALL assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L93] RET assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L94] var_1_12 = __VERIFIER_nondet_uchar() [L95] EXPR \read(var_1_12) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L95] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L95] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L96] EXPR \read(var_1_12) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L96] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L96] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L97] var_1_13 = __VERIFIER_nondet_uchar() [L98] EXPR \read(var_1_13) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L98] CALL assume_abort_if_not(var_1_13 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L98] RET assume_abort_if_not(var_1_13 >= 1) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L99] EXPR \read(var_1_13) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L99] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L99] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L100] var_1_15 = __VERIFIER_nondet_uchar() [L101] EXPR \read(var_1_15) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L101] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L101] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L102] EXPR \read(var_1_15) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L102] CALL assume_abort_if_not(var_1_15 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L102] RET assume_abort_if_not(var_1_15 <= 254) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L103] var_1_16 = __VERIFIER_nondet_uchar() [L104] EXPR \read(var_1_16) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L104] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L104] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L105] EXPR \read(var_1_16) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L105] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L105] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L106] var_1_17 = __VERIFIER_nondet_uchar() [L107] EXPR \read(var_1_17) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L107] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L107] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L108] EXPR \read(var_1_17) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L108] CALL assume_abort_if_not(var_1_17 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L108] RET assume_abort_if_not(var_1_17 <= 254) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L122] RET updateVariables() [L123] CALL step() [L54] EXPR \read(*var_1_3_Pointer) [L54] EXPR \read(*var_1_2_Pointer) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L54] COND FALSE !((*(var_1_3_Pointer)) >= (*(var_1_2_Pointer))) [L63] EXPR \read(*var_1_8_Pointer) [L63] EXPR \read(*var_1_8_Pointer) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L63] COND FALSE !((*(var_1_8_Pointer)) <= (*(var_1_8_Pointer))) [L66] EXPR \read(*var_1_11_Pointer) [L66] unsigned char stepLocal_0 = (*(var_1_11_Pointer)); [L67] EXPR \read(*var_1_2_Pointer) [L67] EXPR \read(*var_1_8_Pointer) [L67] EXPR \read(*var_1_8_Pointer) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L67] COND FALSE !(((*(var_1_2_Pointer)) - 5.25) < ((*(var_1_8_Pointer)) * ((*(var_1_8_Pointer)) * 199.4))) [L76] EXPR \read(*var_1_11_Pointer) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L76] COND FALSE !(! (*(var_1_11_Pointer))) [L79] EXPR \read(*var_1_16_Pointer) [L79] (*(var_1_14_Pointer)) = (*(var_1_16_Pointer)) [L123] RET step() [L124] CALL, EXPR property() [L114] EXPR \read(*var_1_2_Pointer) [L114] EXPR \read(*var_1_8_Pointer) [L114] EXPR \read(*var_1_8_Pointer) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L114] EXPR (((*(var_1_2_Pointer)) - 5.25) < ((*(var_1_8_Pointer)) * ((*(var_1_8_Pointer)) * 199.4))) ? (((*(var_1_11_Pointer)) && (*(var_1_11_Pointer))) ? (((*(var_1_8_Pointer)) < (*(var_1_8_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) : 1) : 1 [L114] EXPR \read(*var_1_11_Pointer) [L114] EXPR (*(var_1_11_Pointer)) && (*(var_1_11_Pointer)) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L114] EXPR (*(var_1_11_Pointer)) && (*(var_1_11_Pointer)) [L114] EXPR \read(*var_1_11_Pointer) [L114] EXPR (*(var_1_11_Pointer)) && (*(var_1_11_Pointer)) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L114] EXPR ((*(var_1_11_Pointer)) && (*(var_1_11_Pointer))) ? (((*(var_1_8_Pointer)) < (*(var_1_8_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) : 1 [L114] EXPR \read(*var_1_8_Pointer) [L114] EXPR \read(*var_1_8_Pointer) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L114] EXPR ((*(var_1_8_Pointer)) < (*(var_1_8_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) [L114] EXPR \read(*var_1_1_Pointer) [L114] EXPR \read(*var_1_7_Pointer) [L114] EXPR ((*(var_1_8_Pointer)) < (*(var_1_8_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L114] EXPR ((*(var_1_11_Pointer)) && (*(var_1_11_Pointer))) ? (((*(var_1_8_Pointer)) < (*(var_1_8_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) : 1 VAL [isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L114] EXPR (((*(var_1_2_Pointer)) - 5.25) < ((*(var_1_8_Pointer)) * ((*(var_1_8_Pointer)) * 199.4))) ? (((*(var_1_11_Pointer)) && (*(var_1_11_Pointer))) ? (((*(var_1_8_Pointer)) < (*(var_1_8_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) : 1) : 1 VAL [isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L114] EXPR ((((*(var_1_2_Pointer)) - 5.25) < ((*(var_1_8_Pointer)) * ((*(var_1_8_Pointer)) * 199.4))) ? (((*(var_1_11_Pointer)) && (*(var_1_11_Pointer))) ? (((*(var_1_8_Pointer)) < (*(var_1_8_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) : 1) : 1) && (((*(var_1_3_Pointer)) >= (*(var_1_2_Pointer))) ? (last_1_var_1_11 ? ((! last_1_var_1_11) ? ((*(var_1_8_Pointer)) == ((float) (((((*(var_1_9_Pointer))) > ((10.25f + (*(var_1_10_Pointer))))) ? ((*(var_1_9_Pointer))) : ((10.25f + (*(var_1_10_Pointer)))))))) : ((*(var_1_8_Pointer)) == ((float) (*(var_1_9_Pointer))))) : 1) : 1) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L114] EXPR ((((*(var_1_2_Pointer)) - 5.25) < ((*(var_1_8_Pointer)) * ((*(var_1_8_Pointer)) * 199.4))) ? (((*(var_1_11_Pointer)) && (*(var_1_11_Pointer))) ? (((*(var_1_8_Pointer)) < (*(var_1_8_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) : 1) : 1) && (((*(var_1_3_Pointer)) >= (*(var_1_2_Pointer))) ? (last_1_var_1_11 ? ((! last_1_var_1_11) ? ((*(var_1_8_Pointer)) == ((float) (((((*(var_1_9_Pointer))) > ((10.25f + (*(var_1_10_Pointer))))) ? ((*(var_1_9_Pointer))) : ((10.25f + (*(var_1_10_Pointer)))))))) : ((*(var_1_8_Pointer)) == ((float) (*(var_1_9_Pointer))))) : 1) : 1) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L114] EXPR (((((*(var_1_2_Pointer)) - 5.25) < ((*(var_1_8_Pointer)) * ((*(var_1_8_Pointer)) * 199.4))) ? (((*(var_1_11_Pointer)) && (*(var_1_11_Pointer))) ? (((*(var_1_8_Pointer)) < (*(var_1_8_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) : 1) : 1) && (((*(var_1_3_Pointer)) >= (*(var_1_2_Pointer))) ? (last_1_var_1_11 ? ((! last_1_var_1_11) ? ((*(var_1_8_Pointer)) == ((float) (((((*(var_1_9_Pointer))) > ((10.25f + (*(var_1_10_Pointer))))) ? ((*(var_1_9_Pointer))) : ((10.25f + (*(var_1_10_Pointer)))))))) : ((*(var_1_8_Pointer)) == ((float) (*(var_1_9_Pointer))))) : 1) : 1)) && (((*(var_1_8_Pointer)) <= (*(var_1_8_Pointer))) ? ((*(var_1_11_Pointer)) == ((unsigned char) ((*(var_1_12_Pointer)) || (*(var_1_13_Pointer))))) : 1) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L114] EXPR (((((*(var_1_2_Pointer)) - 5.25) < ((*(var_1_8_Pointer)) * ((*(var_1_8_Pointer)) * 199.4))) ? (((*(var_1_11_Pointer)) && (*(var_1_11_Pointer))) ? (((*(var_1_8_Pointer)) < (*(var_1_8_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) : 1) : 1) && (((*(var_1_3_Pointer)) >= (*(var_1_2_Pointer))) ? (last_1_var_1_11 ? ((! last_1_var_1_11) ? ((*(var_1_8_Pointer)) == ((float) (((((*(var_1_9_Pointer))) > ((10.25f + (*(var_1_10_Pointer))))) ? ((*(var_1_9_Pointer))) : ((10.25f + (*(var_1_10_Pointer)))))))) : ((*(var_1_8_Pointer)) == ((float) (*(var_1_9_Pointer))))) : 1) : 1)) && (((*(var_1_8_Pointer)) <= (*(var_1_8_Pointer))) ? ((*(var_1_11_Pointer)) == ((unsigned char) ((*(var_1_12_Pointer)) || (*(var_1_13_Pointer))))) : 1) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L114] EXPR ((((((*(var_1_2_Pointer)) - 5.25) < ((*(var_1_8_Pointer)) * ((*(var_1_8_Pointer)) * 199.4))) ? (((*(var_1_11_Pointer)) && (*(var_1_11_Pointer))) ? (((*(var_1_8_Pointer)) < (*(var_1_8_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) : 1) : 1) && (((*(var_1_3_Pointer)) >= (*(var_1_2_Pointer))) ? (last_1_var_1_11 ? ((! last_1_var_1_11) ? ((*(var_1_8_Pointer)) == ((float) (((((*(var_1_9_Pointer))) > ((10.25f + (*(var_1_10_Pointer))))) ? ((*(var_1_9_Pointer))) : ((10.25f + (*(var_1_10_Pointer)))))))) : ((*(var_1_8_Pointer)) == ((float) (*(var_1_9_Pointer))))) : 1) : 1)) && (((*(var_1_8_Pointer)) <= (*(var_1_8_Pointer))) ? ((*(var_1_11_Pointer)) == ((unsigned char) ((*(var_1_12_Pointer)) || (*(var_1_13_Pointer))))) : 1)) && ((! (*(var_1_11_Pointer))) ? ((*(var_1_14_Pointer)) == ((unsigned char) (((((((((*(var_1_15_Pointer))) < ((((((*(var_1_16_Pointer))) > (5)) ? ((*(var_1_16_Pointer))) : (5))))) ? ((*(var_1_15_Pointer))) : ((((((*(var_1_16_Pointer))) > (5)) ? ((*(var_1_16_Pointer))) : (5))))))) < ((*(var_1_17_Pointer)))) ? ((((((*(var_1_15_Pointer))) < ((((((*(var_1_16_Pointer))) > (5)) ? ((*(var_1_16_Pointer))) : (5))))) ? ((*(var_1_15_Pointer))) : ((((((*(var_1_16_Pointer))) > (5)) ? ((*(var_1_16_Pointer))) : (5))))))) : ((*(var_1_17_Pointer))))))) : ((*(var_1_14_Pointer)) == ((unsigned char) (*(var_1_16_Pointer))))) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L114] EXPR ((((((*(var_1_2_Pointer)) - 5.25) < ((*(var_1_8_Pointer)) * ((*(var_1_8_Pointer)) * 199.4))) ? (((*(var_1_11_Pointer)) && (*(var_1_11_Pointer))) ? (((*(var_1_8_Pointer)) < (*(var_1_8_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) : 1) : 1) && (((*(var_1_3_Pointer)) >= (*(var_1_2_Pointer))) ? (last_1_var_1_11 ? ((! last_1_var_1_11) ? ((*(var_1_8_Pointer)) == ((float) (((((*(var_1_9_Pointer))) > ((10.25f + (*(var_1_10_Pointer))))) ? ((*(var_1_9_Pointer))) : ((10.25f + (*(var_1_10_Pointer)))))))) : ((*(var_1_8_Pointer)) == ((float) (*(var_1_9_Pointer))))) : 1) : 1)) && (((*(var_1_8_Pointer)) <= (*(var_1_8_Pointer))) ? ((*(var_1_11_Pointer)) == ((unsigned char) ((*(var_1_12_Pointer)) || (*(var_1_13_Pointer))))) : 1)) && ((! (*(var_1_11_Pointer))) ? ((*(var_1_14_Pointer)) == ((unsigned char) (((((((((*(var_1_15_Pointer))) < ((((((*(var_1_16_Pointer))) > (5)) ? ((*(var_1_16_Pointer))) : (5))))) ? ((*(var_1_15_Pointer))) : ((((((*(var_1_16_Pointer))) > (5)) ? ((*(var_1_16_Pointer))) : (5))))))) < ((*(var_1_17_Pointer)))) ? ((((((*(var_1_15_Pointer))) < ((((((*(var_1_16_Pointer))) > (5)) ? ((*(var_1_16_Pointer))) : (5))))) ? ((*(var_1_15_Pointer))) : ((((((*(var_1_16_Pointer))) > (5)) ? ((*(var_1_16_Pointer))) : (5))))))) : ((*(var_1_17_Pointer))))))) : ((*(var_1_14_Pointer)) == ((unsigned char) (*(var_1_16_Pointer))))) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L114-L115] return ((((((*(var_1_2_Pointer)) - 5.25) < ((*(var_1_8_Pointer)) * ((*(var_1_8_Pointer)) * 199.4))) ? (((*(var_1_11_Pointer)) && (*(var_1_11_Pointer))) ? (((*(var_1_8_Pointer)) < (*(var_1_8_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer)))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_7_Pointer))))) : 1) : 1) && (((*(var_1_3_Pointer)) >= (*(var_1_2_Pointer))) ? (last_1_var_1_11 ? ((! last_1_var_1_11) ? ((*(var_1_8_Pointer)) == ((float) (((((*(var_1_9_Pointer))) > ((10.25f + (*(var_1_10_Pointer))))) ? ((*(var_1_9_Pointer))) : ((10.25f + (*(var_1_10_Pointer)))))))) : ((*(var_1_8_Pointer)) == ((float) (*(var_1_9_Pointer))))) : 1) : 1)) && (((*(var_1_8_Pointer)) <= (*(var_1_8_Pointer))) ? ((*(var_1_11_Pointer)) == ((unsigned char) ((*(var_1_12_Pointer)) || (*(var_1_13_Pointer))))) : 1)) && ((! (*(var_1_11_Pointer))) ? ((*(var_1_14_Pointer)) == ((unsigned char) (((((((((*(var_1_15_Pointer))) < ((((((*(var_1_16_Pointer))) > (5)) ? ((*(var_1_16_Pointer))) : (5))))) ? ((*(var_1_15_Pointer))) : ((((((*(var_1_16_Pointer))) > (5)) ? ((*(var_1_16_Pointer))) : (5))))))) < ((*(var_1_17_Pointer)))) ? ((((((*(var_1_15_Pointer))) < ((((((*(var_1_16_Pointer))) > (5)) ? ((*(var_1_16_Pointer))) : (5))))) ? ((*(var_1_15_Pointer))) : ((((((*(var_1_16_Pointer))) > (5)) ? ((*(var_1_16_Pointer))) : (5))))))) : ((*(var_1_17_Pointer))))))) : ((*(var_1_14_Pointer)) == ((unsigned char) (*(var_1_16_Pointer))))) ; [L124] RET, EXPR property() [L124] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 132 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.3s, OverallIterations: 7, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 3920 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2783 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 189 IncrementalHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 1137 mSDtfsCounter, 189 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 240 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=140occurred in iteration=6, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 914 NumberOfCodeBlocks, 914 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 775 ConstructedInterpolants, 0 QuantifiedInterpolants, 796 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 2880/2880 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:34:38,504 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-p_file-11.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 731a50c3ad3ae6f9ff7b1b7184a0c63ba8d981ab93f9514804edd7dd5e5d73f5 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:34:40,764 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:34:40,852 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:34:40,860 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:34:40,860 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:34:40,888 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:34:40,889 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:34:40,891 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:34:40,891 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:34:40,893 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:34:40,893 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:34:40,894 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:34:40,894 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:34:40,895 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:34:40,895 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:34:40,897 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:34:40,897 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:34:40,898 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:34:40,898 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:34:40,898 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:34:40,899 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:34:40,903 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:34:40,903 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:34:40,904 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 13:34:40,904 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 13:34:40,904 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:34:40,904 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 13:34:40,905 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:34:40,905 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:34:40,905 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:34:40,905 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:34:40,905 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:34:40,906 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:34:40,906 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:34:40,906 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:34:40,907 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:34:40,907 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:34:40,907 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:34:40,909 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 13:34:40,909 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 13:34:40,909 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:34:40,910 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:34:40,910 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:34:40,910 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:34:40,910 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 13:34:40,911 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 -> 731a50c3ad3ae6f9ff7b1b7184a0c63ba8d981ab93f9514804edd7dd5e5d73f5 [2024-10-11 13:34:41,245 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:34:41,268 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:34:41,271 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:34:41,272 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:34:41,272 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:34:41,275 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-11.i [2024-10-11 13:34:42,888 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:34:43,094 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:34:43,095 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-11.i [2024-10-11 13:34:43,109 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b09220a22/220b854fb99a40a2972ab55dfb4ee156/FLAG3caf7ffe1 [2024-10-11 13:34:43,124 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b09220a22/220b854fb99a40a2972ab55dfb4ee156 [2024-10-11 13:34:43,127 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:34:43,128 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:34:43,131 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:34:43,131 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:34:43,136 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:34:43,137 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:34:43" (1/1) ... [2024-10-11 13:34:43,138 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74f3d611 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:34:43, skipping insertion in model container [2024-10-11 13:34:43,138 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:34:43" (1/1) ... [2024-10-11 13:34:43,171 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:34:43,362 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-p_file-11.i[916,929] [2024-10-11 13:34:43,437 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:34:43,459 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:34:43,471 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-p_file-11.i[916,929] [2024-10-11 13:34:43,522 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:34:43,551 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:34:43,552 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:34:43 WrapperNode [2024-10-11 13:34:43,552 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:34:43,554 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:34:43,554 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:34:43,554 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:34:43,561 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:34:43" (1/1) ... [2024-10-11 13:34:43,585 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:34:43" (1/1) ... [2024-10-11 13:34:43,639 INFO L138 Inliner]: procedures = 33, calls = 182, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 618 [2024-10-11 13:34:43,640 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:34:43,640 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:34:43,641 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:34:43,641 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:34:43,659 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:34:43" (1/1) ... [2024-10-11 13:34:43,659 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:34:43" (1/1) ... [2024-10-11 13:34:43,671 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:34:43" (1/1) ... [2024-10-11 13:34:43,718 INFO L175 MemorySlicer]: Split 141 memory accesses to 15 slices as follows [2, 5, 10, 8, 8, 17, 12, 10, 10, 6, 6, 5, 12, 22, 8]. 16 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 17 writes are split as follows [0, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1]. [2024-10-11 13:34:43,719 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:34:43" (1/1) ... [2024-10-11 13:34:43,719 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:34:43" (1/1) ... [2024-10-11 13:34:43,758 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:34:43" (1/1) ... [2024-10-11 13:34:43,763 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:34:43" (1/1) ... [2024-10-11 13:34:43,771 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:34:43" (1/1) ... [2024-10-11 13:34:43,780 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:34:43" (1/1) ... [2024-10-11 13:34:43,797 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:34:43,802 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:34:43,802 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:34:43,802 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:34:43,803 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:34:43" (1/1) ... [2024-10-11 13:34:43,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:34:43,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:34:43,838 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:34:43,841 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:34:43,885 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:34:43,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-10-11 13:34:43,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-10-11 13:34:43,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-10-11 13:34:43,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-10-11 13:34:43,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-10-11 13:34:43,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-10-11 13:34:43,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2024-10-11 13:34:43,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#7 [2024-10-11 13:34:43,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#8 [2024-10-11 13:34:43,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#9 [2024-10-11 13:34:43,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#10 [2024-10-11 13:34:43,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#11 [2024-10-11 13:34:43,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#12 [2024-10-11 13:34:43,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#13 [2024-10-11 13:34:43,888 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#14 [2024-10-11 13:34:43,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-11 13:34:43,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-11 13:34:43,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-10-11 13:34:43,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-10-11 13:34:43,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-10-11 13:34:43,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-10-11 13:34:43,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2024-10-11 13:34:43,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#7 [2024-10-11 13:34:43,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#8 [2024-10-11 13:34:43,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#9 [2024-10-11 13:34:43,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#10 [2024-10-11 13:34:43,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#11 [2024-10-11 13:34:43,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#12 [2024-10-11 13:34:43,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#13 [2024-10-11 13:34:43,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#14 [2024-10-11 13:34:43,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-11 13:34:43,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-11 13:34:43,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-11 13:34:43,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-11 13:34:43,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-10-11 13:34:43,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-10-11 13:34:43,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-10-11 13:34:43,892 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2024-10-11 13:34:43,892 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2024-10-11 13:34:43,892 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2024-10-11 13:34:43,892 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2024-10-11 13:34:43,892 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2024-10-11 13:34:43,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2024-10-11 13:34:43,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2024-10-11 13:34:43,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#14 [2024-10-11 13:34:43,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 13:34:43,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 13:34:43,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-11 13:34:43,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-11 13:34:43,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-10-11 13:34:43,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-10-11 13:34:43,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-10-11 13:34:43,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-10-11 13:34:43,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2024-10-11 13:34:43,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2024-10-11 13:34:43,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2024-10-11 13:34:43,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2024-10-11 13:34:43,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2024-10-11 13:34:43,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2024-10-11 13:34:43,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#14 [2024-10-11 13:34:43,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-11 13:34:43,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-11 13:34:43,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-10-11 13:34:43,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-10-11 13:34:43,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-10-11 13:34:43,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-10-11 13:34:43,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2024-10-11 13:34:43,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2024-10-11 13:34:43,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#8 [2024-10-11 13:34:43,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#9 [2024-10-11 13:34:43,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#10 [2024-10-11 13:34:43,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#11 [2024-10-11 13:34:43,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#12 [2024-10-11 13:34:43,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#13 [2024-10-11 13:34:43,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#14 [2024-10-11 13:34:43,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-10-11 13:34:43,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-10-11 13:34:43,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-10-11 13:34:43,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-10-11 13:34:43,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-10-11 13:34:43,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-10-11 13:34:43,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2024-10-11 13:34:43,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#7 [2024-10-11 13:34:43,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#8 [2024-10-11 13:34:43,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#9 [2024-10-11 13:34:43,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#10 [2024-10-11 13:34:43,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#11 [2024-10-11 13:34:43,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#12 [2024-10-11 13:34:43,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#13 [2024-10-11 13:34:43,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#14 [2024-10-11 13:34:43,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-11 13:34:43,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-11 13:34:43,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-10-11 13:34:43,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-10-11 13:34:43,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-10-11 13:34:43,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-10-11 13:34:43,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2024-10-11 13:34:43,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2024-10-11 13:34:43,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#8 [2024-10-11 13:34:43,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#9 [2024-10-11 13:34:43,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#10 [2024-10-11 13:34:43,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#11 [2024-10-11 13:34:43,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#12 [2024-10-11 13:34:43,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#13 [2024-10-11 13:34:43,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#14 [2024-10-11 13:34:43,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-11 13:34:43,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-11 13:34:43,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-10-11 13:34:43,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-10-11 13:34:43,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-10-11 13:34:43,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-10-11 13:34:43,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2024-10-11 13:34:43,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2024-10-11 13:34:43,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#8 [2024-10-11 13:34:43,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#9 [2024-10-11 13:34:43,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#10 [2024-10-11 13:34:43,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#11 [2024-10-11 13:34:43,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#12 [2024-10-11 13:34:43,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#13 [2024-10-11 13:34:43,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#14 [2024-10-11 13:34:43,909 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:34:43,909 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:34:43,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:34:43,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:34:43,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-11 13:34:43,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-11 13:34:43,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-10-11 13:34:43,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-10-11 13:34:43,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-10-11 13:34:43,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-10-11 13:34:43,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-10-11 13:34:43,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2024-10-11 13:34:43,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2024-10-11 13:34:43,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2024-10-11 13:34:43,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2024-10-11 13:34:43,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2024-10-11 13:34:43,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2024-10-11 13:34:43,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2024-10-11 13:34:43,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#14 [2024-10-11 13:34:44,183 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:34:44,185 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:35:02,945 INFO L? ?]: Removed 165 outVars from TransFormulas that were not future-live. [2024-10-11 13:35:02,945 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:35:03,043 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:35:03,043 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:35:03,043 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:35:03 BoogieIcfgContainer [2024-10-11 13:35:03,044 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:35:03,046 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:35:03,046 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:35:03,049 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:35:03,049 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:34:43" (1/3) ... [2024-10-11 13:35:03,050 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2944c013 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:35:03, skipping insertion in model container [2024-10-11 13:35:03,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:34:43" (2/3) ... [2024-10-11 13:35:03,050 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2944c013 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:35:03, skipping insertion in model container [2024-10-11 13:35:03,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:35:03" (3/3) ... [2024-10-11 13:35:03,052 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-11.i [2024-10-11 13:35:03,069 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:35:03,070 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:35:03,140 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:35:03,146 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;@b42c76c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:35:03,146 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:35:03,152 INFO L276 IsEmpty]: Start isEmpty. Operand has 132 states, 113 states have (on average 1.4955752212389382) internal successors, (169), 114 states have internal predecessors, (169), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 13:35:03,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-11 13:35:03,166 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:35:03,167 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:35:03,167 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:35:03,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:35:03,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1740103682, now seen corresponding path program 1 times [2024-10-11 13:35:03,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:35:03,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [213270478] [2024-10-11 13:35:03,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:35:03,187 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:35:03,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:35:03,191 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:35:03,192 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:35:04,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:04,319 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 13:35:04,327 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:35:04,372 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2024-10-11 13:35:04,372 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:35:04,373 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:35:04,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [213270478] [2024-10-11 13:35:04,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [213270478] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:35:04,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:35:04,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:35:04,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686821497] [2024-10-11 13:35:04,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:35:04,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:35:04,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:35:04,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:35:04,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:35:04,408 INFO L87 Difference]: Start difference. First operand has 132 states, 113 states have (on average 1.4955752212389382) internal successors, (169), 114 states have internal predecessors, (169), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 13:35:04,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:35:04,501 INFO L93 Difference]: Finished difference Result 261 states and 416 transitions. [2024-10-11 13:35:04,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:35:04,506 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 128 [2024-10-11 13:35:04,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:35:04,518 INFO L225 Difference]: With dead ends: 261 [2024-10-11 13:35:04,519 INFO L226 Difference]: Without dead ends: 130 [2024-10-11 13:35:04,524 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 127 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:35:04,529 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 192 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.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:35:04,530 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 192 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:35:04,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-10-11 13:35:04,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-10-11 13:35:04,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 112 states have (on average 1.4642857142857142) internal successors, (164), 112 states have internal predecessors, (164), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 13:35:04,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 196 transitions. [2024-10-11 13:35:04,604 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 196 transitions. Word has length 128 [2024-10-11 13:35:04,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:35:04,604 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 196 transitions. [2024-10-11 13:35:04,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 13:35:04,605 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 196 transitions. [2024-10-11 13:35:04,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-11 13:35:04,608 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:35:04,608 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:35:04,649 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:35:04,809 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:35:04,810 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:35:04,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:35:04,811 INFO L85 PathProgramCache]: Analyzing trace with hash -924408214, now seen corresponding path program 1 times [2024-10-11 13:35:04,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:35:04,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [194564905] [2024-10-11 13:35:04,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:35:04,813 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:35:04,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:35:04,816 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:35:04,817 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:35:05,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:05,765 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 13:35:05,771 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:35:08,485 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 68 treesize of output 32 [2024-10-11 13:35:08,696 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 13:35:08,696 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:35:08,696 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:35:08,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [194564905] [2024-10-11 13:35:08,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [194564905] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:35:08,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:35:08,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 13:35:08,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788059488] [2024-10-11 13:35:08,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:35:08,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:35:08,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:35:08,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:35:08,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:35:08,699 INFO L87 Difference]: Start difference. First operand 130 states and 196 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 13:35:09,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:35:09,500 INFO L93 Difference]: Finished difference Result 388 states and 586 transitions. [2024-10-11 13:35:09,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:35:09,501 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 128 [2024-10-11 13:35:09,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:35:09,504 INFO L225 Difference]: With dead ends: 388 [2024-10-11 13:35:09,504 INFO L226 Difference]: Without dead ends: 259 [2024-10-11 13:35:09,508 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:35:09,509 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 127 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 13:35:09,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 543 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 13:35:09,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2024-10-11 13:35:09,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 254. [2024-10-11 13:35:09,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 219 states have (on average 1.461187214611872) internal successors, (320), 219 states have internal predecessors, (320), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 13:35:09,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 384 transitions. [2024-10-11 13:35:09,551 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 384 transitions. Word has length 128 [2024-10-11 13:35:09,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:35:09,552 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 384 transitions. [2024-10-11 13:35:09,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 13:35:09,552 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 384 transitions. [2024-10-11 13:35:09,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-11 13:35:09,558 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:35:09,558 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:35:09,601 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:35:09,759 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:35:09,760 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:35:09,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:35:09,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1137818577, now seen corresponding path program 1 times [2024-10-11 13:35:09,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:35:09,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [414508472] [2024-10-11 13:35:09,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:35:09,761 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:35:09,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:35:09,764 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:35:09,765 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:35:10,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:10,779 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 13:35:10,783 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:35:10,914 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 13:35:10,914 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:35:10,915 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:35:10,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [414508472] [2024-10-11 13:35:10,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [414508472] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:35:10,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:35:10,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:35:10,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950916675] [2024-10-11 13:35:10,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:35:10,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:35:10,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:35:10,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:35:10,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:35:10,922 INFO L87 Difference]: Start difference. First operand 254 states and 384 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 13:35:11,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:35:11,191 INFO L93 Difference]: Finished difference Result 511 states and 773 transitions. [2024-10-11 13:35:11,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:35:11,192 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 130 [2024-10-11 13:35:11,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:35:11,203 INFO L225 Difference]: With dead ends: 511 [2024-10-11 13:35:11,203 INFO L226 Difference]: Without dead ends: 258 [2024-10-11 13:35:11,204 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:35:11,205 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 0 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 563 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.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:35:11,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 563 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:35:11,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-10-11 13:35:11,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2024-10-11 13:35:11,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 223 states have (on average 1.452914798206278) internal successors, (324), 223 states have internal predecessors, (324), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 13:35:11,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 388 transitions. [2024-10-11 13:35:11,231 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 388 transitions. Word has length 130 [2024-10-11 13:35:11,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:35:11,232 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 388 transitions. [2024-10-11 13:35:11,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 13:35:11,232 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 388 transitions. [2024-10-11 13:35:11,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-11 13:35:11,235 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:35:11,235 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:35:11,273 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:35:11,436 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:35:11,436 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:35:11,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:35:11,437 INFO L85 PathProgramCache]: Analyzing trace with hash 888786891, now seen corresponding path program 1 times [2024-10-11 13:35:11,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:35:11,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2121687492] [2024-10-11 13:35:11,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:35:11,438 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:35:11,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:35:11,441 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:35:11,442 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:35:12,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:12,472 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 13:35:12,476 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:35:12,700 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 13:35:12,700 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:35:12,704 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:35:12,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2121687492] [2024-10-11 13:35:12,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2121687492] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:35:12,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:35:12,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:35:12,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938965901] [2024-10-11 13:35:12,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:35:12,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:35:12,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:35:12,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:35:12,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:35:12,707 INFO L87 Difference]: Start difference. First operand 258 states and 388 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 13:35:13,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:35:13,103 INFO L93 Difference]: Finished difference Result 521 states and 783 transitions. [2024-10-11 13:35:13,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:35:13,103 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 132 [2024-10-11 13:35:13,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:35:13,106 INFO L225 Difference]: With dead ends: 521 [2024-10-11 13:35:13,106 INFO L226 Difference]: Without dead ends: 264 [2024-10-11 13:35:13,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:35:13,107 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 0 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 13:35:13,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 745 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 13:35:13,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-10-11 13:35:13,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2024-10-11 13:35:13,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 229 states have (on average 1.4410480349344978) internal successors, (330), 229 states have internal predecessors, (330), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 13:35:13,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 394 transitions. [2024-10-11 13:35:13,125 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 394 transitions. Word has length 132 [2024-10-11 13:35:13,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:35:13,125 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 394 transitions. [2024-10-11 13:35:13,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 13:35:13,125 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 394 transitions. [2024-10-11 13:35:13,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-11 13:35:13,127 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:35:13,127 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:35:13,163 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:35:13,328 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:35:13,328 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:35:13,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:35:13,329 INFO L85 PathProgramCache]: Analyzing trace with hash -670722973, now seen corresponding path program 1 times [2024-10-11 13:35:13,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:35:13,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [735531476] [2024-10-11 13:35:13,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:35:13,329 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:35:13,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:35:13,332 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:35:13,333 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:35:14,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:14,272 INFO L255 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 13:35:14,277 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:35:14,353 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:35:14,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 32 treesize of output 20 [2024-10-11 13:35:14,659 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 13:35:14,660 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:35:14,660 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:35:14,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [735531476] [2024-10-11 13:35:14,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [735531476] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:35:14,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:35:14,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:35:14,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756719682] [2024-10-11 13:35:14,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:35:14,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:35:14,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:35:14,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:35:14,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:35:14,666 INFO L87 Difference]: Start difference. First operand 264 states and 394 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 13:35:19,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:35:23,225 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:35:27,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:35:31,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:35:31,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:35:31,817 INFO L93 Difference]: Finished difference Result 794 states and 1184 transitions. [2024-10-11 13:35:31,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:35:31,818 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2024-10-11 13:35:31,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:35:31,822 INFO L225 Difference]: With dead ends: 794 [2024-10-11 13:35:31,822 INFO L226 Difference]: Without dead ends: 531 [2024-10-11 13:35:31,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:35:31,824 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 186 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 3 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.9s IncrementalHoareTripleChecker+Time [2024-10-11 13:35:31,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 824 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 55 Invalid, 4 Unknown, 0 Unchecked, 16.9s Time] [2024-10-11 13:35:31,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2024-10-11 13:35:31,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 521. [2024-10-11 13:35:31,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 452 states have (on average 1.4336283185840708) internal successors, (648), 452 states have internal predecessors, (648), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-11 13:35:31,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 776 transitions. [2024-10-11 13:35:31,860 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 776 transitions. Word has length 133 [2024-10-11 13:35:31,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:35:31,861 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 776 transitions. [2024-10-11 13:35:31,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 13:35:31,861 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 776 transitions. [2024-10-11 13:35:31,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-11 13:35:31,863 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:35:31,864 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:35:31,905 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:35:32,064 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:35:32,065 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:35:32,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:35:32,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1488371423, now seen corresponding path program 1 times [2024-10-11 13:35:32,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:35:32,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1770256489] [2024-10-11 13:35:32,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:35:32,066 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:35:32,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:35:32,069 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:35:32,070 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:35:33,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:35:33,093 INFO L255 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-11 13:35:33,099 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:35:38,035 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 42 treesize of output 26 [2024-10-11 13:35:38,246 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:35:38,598 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 32 treesize of output 20 [2024-10-11 13:35:38,833 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 270 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-11 13:35:38,834 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:35:42,133 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-10-11 13:35:42,134 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 30 treesize of output 25 [2024-10-11 13:35:43,539 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 51 proven. 36 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2024-10-11 13:35:43,540 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:35:43,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1770256489] [2024-10-11 13:35:43,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1770256489] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 13:35:43,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 13:35:43,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2024-10-11 13:35:43,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705577890] [2024-10-11 13:35:43,540 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 13:35:43,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-11 13:35:43,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:35:43,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-11 13:35:43,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2024-10-11 13:35:43,543 INFO L87 Difference]: Start difference. First operand 521 states and 776 transitions. Second operand has 23 states, 19 states have (on average 5.0) internal successors, (95), 21 states have internal predecessors, (95), 7 states have call successors, (32), 4 states have call predecessors, (32), 7 states have return successors, (32), 5 states have call predecessors, (32), 7 states have call successors, (32) [2024-10-11 13:35:53,364 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:35:57,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []