./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-15.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-15.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1cf2833edd1cdae0e001cafaa7cd8c6b44382f8b73a263b509a9183609c6c876 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 01:38:34,433 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:38:34,515 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 01:38:34,525 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:38:34,526 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:38:34,558 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:38:34,558 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:38:34,559 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:38:34,559 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:38:34,560 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:38:34,560 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:38:34,561 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:38:34,561 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:38:34,564 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:38:34,565 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:38:34,565 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:38:34,565 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:38:34,566 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:38:34,566 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 01:38:34,566 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:38:34,566 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:38:34,567 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:38:34,567 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:38:34,567 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:38:34,569 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:38:34,570 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:38:34,570 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:38:34,570 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:38:34,571 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:38:34,571 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:38:34,571 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:38:34,571 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:38:34,572 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:38:34,572 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:38:34,573 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:38:34,573 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:38:34,574 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 01:38:34,574 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 01:38:34,574 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:38:34,575 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:38:34,575 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:38:34,575 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:38:34,576 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1cf2833edd1cdae0e001cafaa7cd8c6b44382f8b73a263b509a9183609c6c876 [2024-11-09 01:38:34,819 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:38:34,842 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:38:34,846 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:38:34,847 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:38:34,848 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:38:34,849 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-15.i [2024-11-09 01:38:36,226 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:38:36,463 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:38:36,464 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-15.i [2024-11-09 01:38:36,478 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fd7a8020/dbee968e08eb4cf09e262c46fd7764b6/FLAG29a687213 [2024-11-09 01:38:36,822 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fd7a8020/dbee968e08eb4cf09e262c46fd7764b6 [2024-11-09 01:38:36,825 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:38:36,827 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:38:36,830 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:38:36,830 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:38:36,836 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:38:36,836 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:38:36" (1/1) ... [2024-11-09 01:38:36,837 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10a62cf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:38:36, skipping insertion in model container [2024-11-09 01:38:36,837 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:38:36" (1/1) ... [2024-11-09 01:38:36,870 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:38:37,057 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-15.i[917,930] [2024-11-09 01:38:37,129 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:38:37,140 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:38:37,152 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-15.i[917,930] [2024-11-09 01:38:37,192 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:38:37,216 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:38:37,217 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:38:37 WrapperNode [2024-11-09 01:38:37,217 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:38:37,218 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:38:37,221 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:38:37,221 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:38:37,227 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:38:37" (1/1) ... [2024-11-09 01:38:37,239 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:38:37" (1/1) ... [2024-11-09 01:38:37,296 INFO L138 Inliner]: procedures = 29, calls = 155, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 513 [2024-11-09 01:38:37,296 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:38:37,297 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:38:37,297 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:38:37,297 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:38:37,316 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:38:37" (1/1) ... [2024-11-09 01:38:37,316 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:38:37" (1/1) ... [2024-11-09 01:38:37,324 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:38:37" (1/1) ... [2024-11-09 01:38:37,367 INFO L175 MemorySlicer]: Split 127 memory accesses to 6 slices as follows [2, 16, 51, 25, 10, 23]. 40 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 2, 5, 2, 1, 2]. The 16 writes are split as follows [0, 2, 6, 4, 1, 3]. [2024-11-09 01:38:37,367 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:38:37" (1/1) ... [2024-11-09 01:38:37,368 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:38:37" (1/1) ... [2024-11-09 01:38:37,383 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:38:37" (1/1) ... [2024-11-09 01:38:37,393 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:38:37" (1/1) ... [2024-11-09 01:38:37,396 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:38:37" (1/1) ... [2024-11-09 01:38:37,403 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:38:37" (1/1) ... [2024-11-09 01:38:37,413 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:38:37,416 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:38:37,416 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:38:37,417 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:38:37,417 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:38:37" (1/1) ... [2024-11-09 01:38:37,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:38:37,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:38:37,455 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 01:38:37,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 01:38:37,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:38:37,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-09 01:38:37,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-09 01:38:37,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-09 01:38:37,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-09 01:38:37,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-09 01:38:37,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-09 01:38:37,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 01:38:37,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 01:38:37,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 01:38:37,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-09 01:38:37,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-09 01:38:37,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-09 01:38:37,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-09 01:38:37,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-09 01:38:37,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-09 01:38:37,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-09 01:38:37,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-09 01:38:37,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-09 01:38:37,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 01:38:37,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 01:38:37,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 01:38:37,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-09 01:38:37,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-09 01:38:37,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-09 01:38:37,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-09 01:38:37,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-09 01:38:37,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-09 01:38:37,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-09 01:38:37,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-09 01:38:37,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-09 01:38:37,517 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:38:37,517 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:38:37,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 01:38:37,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 01:38:37,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 01:38:37,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-09 01:38:37,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-09 01:38:37,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-09 01:38:37,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:38:37,518 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:38:37,689 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:38:37,691 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:38:38,256 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-11-09 01:38:38,257 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:38:38,272 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:38:38,273 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:38:38,273 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:38:38 BoogieIcfgContainer [2024-11-09 01:38:38,274 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:38:38,276 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:38:38,276 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:38:38,280 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:38:38,280 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:38:36" (1/3) ... [2024-11-09 01:38:38,281 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f5f447d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:38:38, skipping insertion in model container [2024-11-09 01:38:38,281 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:38:37" (2/3) ... [2024-11-09 01:38:38,282 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f5f447d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:38:38, skipping insertion in model container [2024-11-09 01:38:38,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:38:38" (3/3) ... [2024-11-09 01:38:38,283 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-15.i [2024-11-09 01:38:38,300 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:38:38,301 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:38:38,364 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:38:38,370 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;@51bdec55, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:38:38,370 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:38:38,375 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 98 states have (on average 1.4489795918367347) internal successors, (142), 99 states have internal predecessors, (142), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 01:38:38,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-09 01:38:38,387 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:38:38,387 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:38:38,388 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:38:38,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:38:38,392 INFO L85 PathProgramCache]: Analyzing trace with hash 31279224, now seen corresponding path program 1 times [2024-11-09 01:38:38,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:38:38,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58264696] [2024-11-09 01:38:38,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:38:38,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:38:38,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:38,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:38:38,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:38,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:38:38,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:38,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:38:38,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:38,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:38:38,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:38,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:38:38,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:38,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:38:38,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:38,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:38:38,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:38,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:38:38,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:38,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:38:38,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:38,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:38:38,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:38,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:38:38,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:38,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:38:38,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:38,810 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:38:38,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:38:38,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58264696] [2024-11-09 01:38:38,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58264696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:38:38,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:38:38,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:38:38,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293283004] [2024-11-09 01:38:38,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:38:38,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:38:38,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:38:38,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:38:38,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:38:38,849 INFO L87 Difference]: Start difference. First operand has 113 states, 98 states have (on average 1.4489795918367347) internal successors, (142), 99 states have internal predecessors, (142), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 01:38:38,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:38:38,878 INFO L93 Difference]: Finished difference Result 219 states and 338 transitions. [2024-11-09 01:38:38,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:38:38,881 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 115 [2024-11-09 01:38:38,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:38:38,891 INFO L225 Difference]: With dead ends: 219 [2024-11-09 01:38:38,892 INFO L226 Difference]: Without dead ends: 109 [2024-11-09 01:38:38,897 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:38:38,902 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:38:38,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:38:38,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-09 01:38:38,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-09 01:38:38,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 95 states have (on average 1.4) internal successors, (133), 95 states have internal predecessors, (133), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 01:38:38,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 157 transitions. [2024-11-09 01:38:38,951 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 157 transitions. Word has length 115 [2024-11-09 01:38:38,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:38:38,953 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 157 transitions. [2024-11-09 01:38:38,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 01:38:38,954 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 157 transitions. [2024-11-09 01:38:38,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-09 01:38:38,960 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:38:38,960 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:38:38,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 01:38:38,961 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:38:38,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:38:38,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1829017178, now seen corresponding path program 1 times [2024-11-09 01:38:38,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:38:38,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346765343] [2024-11-09 01:38:38,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:38:38,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:38:39,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:39,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:38:39,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:39,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:38:39,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:39,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:38:39,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:39,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:38:39,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:39,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:38:39,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:39,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:38:39,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:39,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:38:39,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:39,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:38:39,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:39,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:38:39,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:39,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:38:39,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:39,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:38:39,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:39,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:38:39,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:39,435 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:38:39,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:38:39,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346765343] [2024-11-09 01:38:39,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346765343] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:38:39,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:38:39,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:38:39,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003696488] [2024-11-09 01:38:39,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:38:39,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:38:39,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:38:39,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:38:39,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:38:39,442 INFO L87 Difference]: Start difference. First operand 109 states and 157 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 01:38:39,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:38:39,499 INFO L93 Difference]: Finished difference Result 217 states and 314 transitions. [2024-11-09 01:38:39,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:38:39,502 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 115 [2024-11-09 01:38:39,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:38:39,505 INFO L225 Difference]: With dead ends: 217 [2024-11-09 01:38:39,505 INFO L226 Difference]: Without dead ends: 111 [2024-11-09 01:38:39,506 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:38:39,507 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:38:39,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 454 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:38:39,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-09 01:38:39,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-09 01:38:39,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 97 states have (on average 1.3917525773195876) internal successors, (135), 97 states have internal predecessors, (135), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 01:38:39,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 159 transitions. [2024-11-09 01:38:39,530 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 159 transitions. Word has length 115 [2024-11-09 01:38:39,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:38:39,532 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 159 transitions. [2024-11-09 01:38:39,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 01:38:39,532 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 159 transitions. [2024-11-09 01:38:39,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-09 01:38:39,534 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:38:39,534 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:38:39,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 01:38:39,534 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:38:39,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:38:39,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1512009960, now seen corresponding path program 1 times [2024-11-09 01:38:39,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:38:39,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628842693] [2024-11-09 01:38:39,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:38:39,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:38:39,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:39,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:38:39,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:39,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:38:39,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:39,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:38:39,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:39,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:38:39,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:39,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:38:39,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:39,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:38:39,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:39,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:38:39,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:39,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:38:39,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:39,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:38:39,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:39,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:38:39,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:39,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:38:39,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:39,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:38:39,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:39,735 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:38:39,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:38:39,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628842693] [2024-11-09 01:38:39,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628842693] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:38:39,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:38:39,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 01:38:39,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243581177] [2024-11-09 01:38:39,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:38:39,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 01:38:39,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:38:39,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 01:38:39,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:38:39,738 INFO L87 Difference]: Start difference. First operand 111 states and 159 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:38:39,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:38:39,771 INFO L93 Difference]: Finished difference Result 220 states and 317 transitions. [2024-11-09 01:38:39,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 01:38:39,772 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-11-09 01:38:39,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:38:39,777 INFO L225 Difference]: With dead ends: 220 [2024-11-09 01:38:39,777 INFO L226 Difference]: Without dead ends: 112 [2024-11-09 01:38:39,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:38:39,779 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 0 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:38:39,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 306 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:38:39,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-09 01:38:39,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-09 01:38:39,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 98 states have (on average 1.3877551020408163) internal successors, (136), 98 states have internal predecessors, (136), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 01:38:39,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 160 transitions. [2024-11-09 01:38:39,793 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 160 transitions. Word has length 115 [2024-11-09 01:38:39,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:38:39,794 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 160 transitions. [2024-11-09 01:38:39,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:38:39,794 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 160 transitions. [2024-11-09 01:38:39,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-09 01:38:39,796 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:38:39,796 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:38:39,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 01:38:39,797 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:38:39,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:38:39,797 INFO L85 PathProgramCache]: Analyzing trace with hash -176933782, now seen corresponding path program 1 times [2024-11-09 01:38:39,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:38:39,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971078699] [2024-11-09 01:38:39,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:38:39,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:38:39,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:39,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:38:39,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:39,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:38:39,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:39,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:38:39,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:39,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:38:39,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:39,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:38:39,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:39,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:38:39,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:39,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:38:39,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:39,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:38:39,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:39,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:38:39,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:39,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:38:39,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:39,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:38:39,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:39,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:38:39,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:39,967 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:38:39,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:38:39,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971078699] [2024-11-09 01:38:39,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971078699] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:38:39,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:38:39,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 01:38:39,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977742385] [2024-11-09 01:38:39,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:38:39,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 01:38:39,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:38:39,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 01:38:39,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:38:39,972 INFO L87 Difference]: Start difference. First operand 112 states and 160 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:38:39,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:38:39,999 INFO L93 Difference]: Finished difference Result 222 states and 319 transitions. [2024-11-09 01:38:40,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 01:38:40,001 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-11-09 01:38:40,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:38:40,003 INFO L225 Difference]: With dead ends: 222 [2024-11-09 01:38:40,003 INFO L226 Difference]: Without dead ends: 113 [2024-11-09 01:38:40,003 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:38:40,007 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 0 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:38:40,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 306 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:38:40,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-09 01:38:40,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-11-09 01:38:40,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 99 states have (on average 1.3838383838383839) internal successors, (137), 99 states have internal predecessors, (137), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 01:38:40,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 161 transitions. [2024-11-09 01:38:40,023 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 161 transitions. Word has length 115 [2024-11-09 01:38:40,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:38:40,024 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 161 transitions. [2024-11-09 01:38:40,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:38:40,026 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 161 transitions. [2024-11-09 01:38:40,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-09 01:38:40,027 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:38:40,028 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:38:40,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 01:38:40,028 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:38:40,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:38:40,029 INFO L85 PathProgramCache]: Analyzing trace with hash 81231656, now seen corresponding path program 1 times [2024-11-09 01:38:40,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:38:40,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136361042] [2024-11-09 01:38:40,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:38:40,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:38:40,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:40,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:38:40,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:40,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:38:40,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:40,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:38:40,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:40,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:38:40,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:40,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:38:40,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:40,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:38:40,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:40,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:38:40,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:40,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:38:40,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:40,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:38:40,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:40,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:38:40,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:40,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:38:40,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:40,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:38:40,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:40,557 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:38:40,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:38:40,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136361042] [2024-11-09 01:38:40,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136361042] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:38:40,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:38:40,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:38:40,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210510802] [2024-11-09 01:38:40,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:38:40,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:38:40,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:38:40,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:38:40,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:38:40,564 INFO L87 Difference]: Start difference. First operand 113 states and 161 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:38:40,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:38:40,648 INFO L93 Difference]: Finished difference Result 333 states and 477 transitions. [2024-11-09 01:38:40,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:38:40,649 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-11-09 01:38:40,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:38:40,652 INFO L225 Difference]: With dead ends: 333 [2024-11-09 01:38:40,653 INFO L226 Difference]: Without dead ends: 223 [2024-11-09 01:38:40,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:38:40,656 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 152 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:38:40,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 586 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:38:40,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-11-09 01:38:40,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 218. [2024-11-09 01:38:40,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 191 states have (on average 1.387434554973822) internal successors, (265), 191 states have internal predecessors, (265), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-09 01:38:40,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 313 transitions. [2024-11-09 01:38:40,690 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 313 transitions. Word has length 115 [2024-11-09 01:38:40,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:38:40,691 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 313 transitions. [2024-11-09 01:38:40,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:38:40,692 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 313 transitions. [2024-11-09 01:38:40,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-09 01:38:40,705 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:38:40,705 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:38:40,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 01:38:40,705 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:38:40,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:38:40,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1305195944, now seen corresponding path program 1 times [2024-11-09 01:38:40,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:38:40,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052099481] [2024-11-09 01:38:40,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:38:40,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:38:40,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:41,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:38:41,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:41,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:38:41,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:41,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:38:41,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:41,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:38:41,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:41,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:38:41,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:41,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:38:41,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:41,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:38:41,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:41,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:38:41,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:41,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:38:41,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:41,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:38:41,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:41,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:38:41,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:41,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:38:41,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:41,157 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:38:41,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:38:41,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052099481] [2024-11-09 01:38:41,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052099481] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:38:41,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:38:41,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:38:41,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161740133] [2024-11-09 01:38:41,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:38:41,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:38:41,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:38:41,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:38:41,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:38:41,162 INFO L87 Difference]: Start difference. First operand 218 states and 313 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:38:41,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:38:41,336 INFO L93 Difference]: Finished difference Result 437 states and 627 transitions. [2024-11-09 01:38:41,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:38:41,336 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 116 [2024-11-09 01:38:41,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:38:41,339 INFO L225 Difference]: With dead ends: 437 [2024-11-09 01:38:41,340 INFO L226 Difference]: Without dead ends: 222 [2024-11-09 01:38:41,341 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:38:41,342 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 152 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:38:41,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 817 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:38:41,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-11-09 01:38:41,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 217. [2024-11-09 01:38:41,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 190 states have (on average 1.3842105263157896) internal successors, (263), 190 states have internal predecessors, (263), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-09 01:38:41,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 311 transitions. [2024-11-09 01:38:41,371 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 311 transitions. Word has length 116 [2024-11-09 01:38:41,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:38:41,371 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 311 transitions. [2024-11-09 01:38:41,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:38:41,372 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 311 transitions. [2024-11-09 01:38:41,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-09 01:38:41,374 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:38:41,374 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:38:41,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 01:38:41,375 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:38:41,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:38:41,376 INFO L85 PathProgramCache]: Analyzing trace with hash 635553891, now seen corresponding path program 1 times [2024-11-09 01:38:41,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:38:41,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254480234] [2024-11-09 01:38:41,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:38:41,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:38:41,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:41,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:38:41,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:41,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:38:41,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:41,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:38:41,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:41,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:38:41,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:41,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:38:41,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:41,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:38:41,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:41,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:38:41,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:41,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:38:41,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:41,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:38:41,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:41,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:38:41,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:41,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:38:41,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:41,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:38:41,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:41,933 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:38:41,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:38:41,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254480234] [2024-11-09 01:38:41,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254480234] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:38:41,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:38:41,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:38:41,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521030398] [2024-11-09 01:38:41,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:38:41,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:38:41,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:38:41,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:38:41,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:38:41,936 INFO L87 Difference]: Start difference. First operand 217 states and 311 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:38:42,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:38:42,137 INFO L93 Difference]: Finished difference Result 498 states and 713 transitions. [2024-11-09 01:38:42,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:38:42,138 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2024-11-09 01:38:42,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:38:42,140 INFO L225 Difference]: With dead ends: 498 [2024-11-09 01:38:42,140 INFO L226 Difference]: Without dead ends: 388 [2024-11-09 01:38:42,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:38:42,142 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 215 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:38:42,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 820 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:38:42,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-11-09 01:38:42,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 384. [2024-11-09 01:38:42,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 339 states have (on average 1.3893805309734513) internal successors, (471), 341 states have internal predecessors, (471), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-09 01:38:42,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 551 transitions. [2024-11-09 01:38:42,175 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 551 transitions. Word has length 117 [2024-11-09 01:38:42,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:38:42,176 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 551 transitions. [2024-11-09 01:38:42,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:38:42,176 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 551 transitions. [2024-11-09 01:38:42,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-09 01:38:42,180 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:38:42,182 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:38:42,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 01:38:42,183 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:38:42,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:38:42,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1552103804, now seen corresponding path program 1 times [2024-11-09 01:38:42,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:38:42,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378585302] [2024-11-09 01:38:42,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:38:42,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:38:42,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:42,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:38:42,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:42,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:38:42,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:42,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:38:42,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:42,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:38:42,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:42,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:38:42,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:42,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:38:42,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:42,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:38:42,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:42,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:38:42,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:42,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:38:42,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:42,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:38:42,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:42,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:38:42,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:42,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:38:42,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:42,514 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:38:42,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:38:42,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378585302] [2024-11-09 01:38:42,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378585302] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:38:42,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:38:42,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:38:42,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599282477] [2024-11-09 01:38:42,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:38:42,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:38:42,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:38:42,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:38:42,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:38:42,517 INFO L87 Difference]: Start difference. First operand 384 states and 551 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:38:42,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:38:42,647 INFO L93 Difference]: Finished difference Result 940 states and 1348 transitions. [2024-11-09 01:38:42,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:38:42,648 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2024-11-09 01:38:42,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:38:42,653 INFO L225 Difference]: With dead ends: 940 [2024-11-09 01:38:42,653 INFO L226 Difference]: Without dead ends: 559 [2024-11-09 01:38:42,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:38:42,655 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 114 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:38:42,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 990 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:38:42,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2024-11-09 01:38:42,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 409. [2024-11-09 01:38:42,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 364 states have (on average 1.3928571428571428) internal successors, (507), 366 states have internal predecessors, (507), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-09 01:38:42,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 587 transitions. [2024-11-09 01:38:42,681 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 587 transitions. Word has length 118 [2024-11-09 01:38:42,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:38:42,682 INFO L471 AbstractCegarLoop]: Abstraction has 409 states and 587 transitions. [2024-11-09 01:38:42,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:38:42,682 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 587 transitions. [2024-11-09 01:38:42,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-09 01:38:42,683 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:38:42,683 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:38:42,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 01:38:42,684 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:38:42,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:38:42,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1309316045, now seen corresponding path program 1 times [2024-11-09 01:38:42,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:38:42,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017073853] [2024-11-09 01:38:42,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:38:42,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:38:42,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:43,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:38:43,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:43,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:38:43,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:43,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:38:43,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:43,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:38:43,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:43,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:38:43,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:43,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:38:43,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:43,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:38:43,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:43,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:38:43,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:43,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:38:43,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:43,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:38:43,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:43,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:38:43,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:43,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:38:43,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:43,047 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:38:43,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:38:43,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017073853] [2024-11-09 01:38:43,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017073853] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:38:43,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:38:43,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:38:43,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466937654] [2024-11-09 01:38:43,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:38:43,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:38:43,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:38:43,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:38:43,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:38:43,050 INFO L87 Difference]: Start difference. First operand 409 states and 587 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:38:43,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:38:43,136 INFO L93 Difference]: Finished difference Result 1027 states and 1470 transitions. [2024-11-09 01:38:43,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:38:43,137 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2024-11-09 01:38:43,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:38:43,140 INFO L225 Difference]: With dead ends: 1027 [2024-11-09 01:38:43,140 INFO L226 Difference]: Without dead ends: 621 [2024-11-09 01:38:43,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:38:43,142 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 63 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:38:43,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 673 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:38:43,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2024-11-09 01:38:43,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 474. [2024-11-09 01:38:43,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 429 states have (on average 1.3986013986013985) internal successors, (600), 431 states have internal predecessors, (600), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-09 01:38:43,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 680 transitions. [2024-11-09 01:38:43,165 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 680 transitions. Word has length 118 [2024-11-09 01:38:43,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:38:43,165 INFO L471 AbstractCegarLoop]: Abstraction has 474 states and 680 transitions. [2024-11-09 01:38:43,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:38:43,166 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 680 transitions. [2024-11-09 01:38:43,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-09 01:38:43,167 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:38:43,167 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:38:43,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 01:38:43,167 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:38:43,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:38:43,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1732196226, now seen corresponding path program 1 times [2024-11-09 01:38:43,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:38:43,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18523987] [2024-11-09 01:38:43,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:38:43,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:38:43,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:43,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:38:43,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:43,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:38:43,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:43,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:38:43,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:43,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:38:43,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:43,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:38:43,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:43,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:38:43,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:43,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:38:43,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:43,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:38:43,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:43,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:38:43,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:43,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:38:43,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:43,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:38:43,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:43,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:38:43,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:43,540 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:38:43,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:38:43,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18523987] [2024-11-09 01:38:43,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18523987] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:38:43,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:38:43,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:38:43,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74869756] [2024-11-09 01:38:43,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:38:43,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:38:43,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:38:43,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:38:43,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:38:43,543 INFO L87 Difference]: Start difference. First operand 474 states and 680 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:38:43,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:38:43,634 INFO L93 Difference]: Finished difference Result 1088 states and 1553 transitions. [2024-11-09 01:38:43,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:38:43,635 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2024-11-09 01:38:43,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:38:43,638 INFO L225 Difference]: With dead ends: 1088 [2024-11-09 01:38:43,638 INFO L226 Difference]: Without dead ends: 617 [2024-11-09 01:38:43,639 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:38:43,640 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 70 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:38:43,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 657 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:38:43,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2024-11-09 01:38:43,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 473. [2024-11-09 01:38:43,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 428 states have (on average 1.394859813084112) internal successors, (597), 430 states have internal predecessors, (597), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-09 01:38:43,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 677 transitions. [2024-11-09 01:38:43,662 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 677 transitions. Word has length 118 [2024-11-09 01:38:43,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:38:43,663 INFO L471 AbstractCegarLoop]: Abstraction has 473 states and 677 transitions. [2024-11-09 01:38:43,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:38:43,663 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 677 transitions. [2024-11-09 01:38:43,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-09 01:38:43,665 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:38:43,665 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:38:43,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 01:38:43,666 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:38:43,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:38:43,667 INFO L85 PathProgramCache]: Analyzing trace with hash 914547776, now seen corresponding path program 1 times [2024-11-09 01:38:43,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:38:43,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471951642] [2024-11-09 01:38:43,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:38:43,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:38:43,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:44,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:38:44,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:44,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:38:44,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:44,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:38:44,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:44,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:38:44,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:44,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:38:44,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:44,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:38:44,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:44,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:38:44,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:44,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:38:44,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:44,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:38:44,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:44,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:38:44,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:44,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:38:44,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:44,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:38:44,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:44,075 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:38:44,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:38:44,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471951642] [2024-11-09 01:38:44,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471951642] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:38:44,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:38:44,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 01:38:44,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088987346] [2024-11-09 01:38:44,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:38:44,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 01:38:44,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:38:44,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 01:38:44,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:38:44,077 INFO L87 Difference]: Start difference. First operand 473 states and 677 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:38:44,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:38:44,211 INFO L93 Difference]: Finished difference Result 954 states and 1365 transitions. [2024-11-09 01:38:44,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 01:38:44,212 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2024-11-09 01:38:44,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:38:44,215 INFO L225 Difference]: With dead ends: 954 [2024-11-09 01:38:44,216 INFO L226 Difference]: Without dead ends: 714 [2024-11-09 01:38:44,217 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:38:44,217 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 183 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:38:44,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 630 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:38:44,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2024-11-09 01:38:44,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 684. [2024-11-09 01:38:44,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 617 states have (on average 1.3889789303079416) internal successors, (857), 620 states have internal predecessors, (857), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-09 01:38:44,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 977 transitions. [2024-11-09 01:38:44,263 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 977 transitions. Word has length 118 [2024-11-09 01:38:44,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:38:44,264 INFO L471 AbstractCegarLoop]: Abstraction has 684 states and 977 transitions. [2024-11-09 01:38:44,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:38:44,264 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 977 transitions. [2024-11-09 01:38:44,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-09 01:38:44,266 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:38:44,266 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:38:44,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 01:38:44,266 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:38:44,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:38:44,267 INFO L85 PathProgramCache]: Analyzing trace with hash -364021403, now seen corresponding path program 1 times [2024-11-09 01:38:44,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:38:44,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635574737] [2024-11-09 01:38:44,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:38:44,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:38:44,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:44,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:38:44,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:44,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:38:44,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:44,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:38:44,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:44,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:38:44,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:44,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:38:44,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:44,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:38:44,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:44,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:38:44,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:44,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:38:44,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:44,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:38:44,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:44,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:38:44,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:44,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:38:44,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:44,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:38:44,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:44,504 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:38:44,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:38:44,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635574737] [2024-11-09 01:38:44,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635574737] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:38:44,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:38:44,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:38:44,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234295225] [2024-11-09 01:38:44,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:38:44,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:38:44,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:38:44,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:38:44,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:38:44,507 INFO L87 Difference]: Start difference. First operand 684 states and 977 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:38:44,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:38:44,606 INFO L93 Difference]: Finished difference Result 1442 states and 2053 transitions. [2024-11-09 01:38:44,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:38:44,607 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 119 [2024-11-09 01:38:44,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:38:44,611 INFO L225 Difference]: With dead ends: 1442 [2024-11-09 01:38:44,611 INFO L226 Difference]: Without dead ends: 761 [2024-11-09 01:38:44,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:38:44,634 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 73 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:38:44,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 667 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:38:44,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2024-11-09 01:38:44,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 643. [2024-11-09 01:38:44,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 576 states have (on average 1.3871527777777777) internal successors, (799), 579 states have internal predecessors, (799), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-09 01:38:44,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 919 transitions. [2024-11-09 01:38:44,672 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 919 transitions. Word has length 119 [2024-11-09 01:38:44,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:38:44,672 INFO L471 AbstractCegarLoop]: Abstraction has 643 states and 919 transitions. [2024-11-09 01:38:44,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:38:44,672 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 919 transitions. [2024-11-09 01:38:44,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-09 01:38:44,674 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:38:44,674 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:38:44,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 01:38:44,675 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:38:44,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:38:44,675 INFO L85 PathProgramCache]: Analyzing trace with hash -2023782025, now seen corresponding path program 1 times [2024-11-09 01:38:44,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:38:44,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899137756] [2024-11-09 01:38:44,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:38:44,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:38:44,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:44,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:38:44,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:44,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:38:44,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:44,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:38:44,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:44,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:38:44,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:44,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:38:44,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:44,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:38:44,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:44,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:38:44,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:44,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:38:44,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:44,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:38:44,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:44,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:38:44,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:44,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:38:44,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:44,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:38:44,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:44,934 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:38:44,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:38:44,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899137756] [2024-11-09 01:38:44,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899137756] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:38:44,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:38:44,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:38:44,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549934641] [2024-11-09 01:38:44,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:38:44,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:38:44,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:38:44,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:38:44,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:38:44,936 INFO L87 Difference]: Start difference. First operand 643 states and 919 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:38:45,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:38:45,019 INFO L93 Difference]: Finished difference Result 1098 states and 1564 transitions. [2024-11-09 01:38:45,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:38:45,020 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 119 [2024-11-09 01:38:45,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:38:45,023 INFO L225 Difference]: With dead ends: 1098 [2024-11-09 01:38:45,024 INFO L226 Difference]: Without dead ends: 655 [2024-11-09 01:38:45,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:38:45,026 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 68 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:38:45,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 741 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:38:45,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2024-11-09 01:38:45,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 616. [2024-11-09 01:38:45,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 549 states have (on average 1.3825136612021858) internal successors, (759), 552 states have internal predecessors, (759), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-09 01:38:45,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 879 transitions. [2024-11-09 01:38:45,058 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 879 transitions. Word has length 119 [2024-11-09 01:38:45,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:38:45,059 INFO L471 AbstractCegarLoop]: Abstraction has 616 states and 879 transitions. [2024-11-09 01:38:45,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:38:45,059 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 879 transitions. [2024-11-09 01:38:45,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-09 01:38:45,061 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:38:45,061 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:38:45,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 01:38:45,061 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:38:45,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:38:45,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1945076014, now seen corresponding path program 1 times [2024-11-09 01:38:45,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:38:45,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058605210] [2024-11-09 01:38:45,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:38:45,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:38:45,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:45,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:38:45,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:45,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:38:45,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:45,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:38:45,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:45,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:38:45,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:45,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:38:45,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:45,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:38:45,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:45,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:38:45,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:45,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:38:45,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:45,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:38:45,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:45,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:38:45,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:45,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:38:45,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:45,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:38:45,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:45,649 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:38:45,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:38:45,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058605210] [2024-11-09 01:38:45,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058605210] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:38:45,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:38:45,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 01:38:45,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302220002] [2024-11-09 01:38:45,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:38:45,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 01:38:45,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:38:45,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 01:38:45,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:38:45,651 INFO L87 Difference]: Start difference. First operand 616 states and 879 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:38:46,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:38:46,222 INFO L93 Difference]: Finished difference Result 1344 states and 1910 transitions. [2024-11-09 01:38:46,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:38:46,223 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 119 [2024-11-09 01:38:46,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:38:46,227 INFO L225 Difference]: With dead ends: 1344 [2024-11-09 01:38:46,228 INFO L226 Difference]: Without dead ends: 731 [2024-11-09 01:38:46,230 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-11-09 01:38:46,230 INFO L432 NwaCegarLoop]: 271 mSDtfsCounter, 407 mSDsluCounter, 1156 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 1427 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 01:38:46,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 1427 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 01:38:46,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2024-11-09 01:38:46,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 716. [2024-11-09 01:38:46,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 716 states, 637 states have (on average 1.3767660910518054) internal successors, (877), 641 states have internal predecessors, (877), 70 states have call successors, (70), 8 states have call predecessors, (70), 8 states have return successors, (70), 66 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-09 01:38:46,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 1017 transitions. [2024-11-09 01:38:46,291 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 1017 transitions. Word has length 119 [2024-11-09 01:38:46,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:38:46,292 INFO L471 AbstractCegarLoop]: Abstraction has 716 states and 1017 transitions. [2024-11-09 01:38:46,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:38:46,293 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 1017 transitions. [2024-11-09 01:38:46,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-09 01:38:46,295 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:38:46,295 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:38:46,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 01:38:46,295 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:38:46,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:38:46,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1799398302, now seen corresponding path program 1 times [2024-11-09 01:38:46,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:38:46,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026614808] [2024-11-09 01:38:46,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:38:46,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:38:46,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:46,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:38:46,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:46,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:38:46,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:46,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:38:46,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:46,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:38:46,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:46,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:38:46,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:46,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:38:46,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:46,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:38:46,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:46,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:38:46,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:46,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:38:46,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:46,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:38:46,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:46,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:38:46,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:46,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:38:46,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:46,547 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:38:46,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:38:46,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026614808] [2024-11-09 01:38:46,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026614808] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:38:46,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:38:46,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:38:46,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293911409] [2024-11-09 01:38:46,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:38:46,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:38:46,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:38:46,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:38:46,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:38:46,550 INFO L87 Difference]: Start difference. First operand 716 states and 1017 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:38:46,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:38:46,645 INFO L93 Difference]: Finished difference Result 1467 states and 2081 transitions. [2024-11-09 01:38:46,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:38:46,645 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 119 [2024-11-09 01:38:46,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:38:46,649 INFO L225 Difference]: With dead ends: 1467 [2024-11-09 01:38:46,649 INFO L226 Difference]: Without dead ends: 754 [2024-11-09 01:38:46,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:38:46,652 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 62 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:38:46,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 581 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:38:46,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2024-11-09 01:38:46,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 716. [2024-11-09 01:38:46,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 716 states, 637 states have (on average 1.3642072213500784) internal successors, (869), 641 states have internal predecessors, (869), 70 states have call successors, (70), 8 states have call predecessors, (70), 8 states have return successors, (70), 66 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-09 01:38:46,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 1009 transitions. [2024-11-09 01:38:46,700 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 1009 transitions. Word has length 119 [2024-11-09 01:38:46,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:38:46,701 INFO L471 AbstractCegarLoop]: Abstraction has 716 states and 1009 transitions. [2024-11-09 01:38:46,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:38:46,701 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 1009 transitions. [2024-11-09 01:38:46,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-09 01:38:46,703 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:38:46,703 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:38:46,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 01:38:46,703 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:38:46,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:38:46,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1484451744, now seen corresponding path program 1 times [2024-11-09 01:38:46,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:38:46,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421277372] [2024-11-09 01:38:46,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:38:46,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:38:46,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:46,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:38:46,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:46,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:38:46,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:46,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:38:46,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:46,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:38:46,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:46,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:38:47,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:47,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:38:47,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:47,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:38:47,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:47,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:38:47,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:47,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:38:47,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:47,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:38:47,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:47,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:38:47,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:47,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:38:47,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:47,015 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:38:47,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:38:47,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421277372] [2024-11-09 01:38:47,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421277372] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:38:47,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:38:47,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:38:47,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039130394] [2024-11-09 01:38:47,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:38:47,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:38:47,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:38:47,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:38:47,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:38:47,017 INFO L87 Difference]: Start difference. First operand 716 states and 1009 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:38:47,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:38:47,109 INFO L93 Difference]: Finished difference Result 1262 states and 1776 transitions. [2024-11-09 01:38:47,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:38:47,109 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 119 [2024-11-09 01:38:47,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:38:47,113 INFO L225 Difference]: With dead ends: 1262 [2024-11-09 01:38:47,113 INFO L226 Difference]: Without dead ends: 817 [2024-11-09 01:38:47,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:38:47,115 INFO L432 NwaCegarLoop]: 281 mSDtfsCounter, 137 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:38:47,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 842 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:38:47,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states. [2024-11-09 01:38:47,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 807. [2024-11-09 01:38:47,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 807 states, 714 states have (on average 1.3571428571428572) internal successors, (969), 718 states have internal predecessors, (969), 82 states have call successors, (82), 10 states have call predecessors, (82), 10 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2024-11-09 01:38:47,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1133 transitions. [2024-11-09 01:38:47,160 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1133 transitions. Word has length 119 [2024-11-09 01:38:47,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:38:47,160 INFO L471 AbstractCegarLoop]: Abstraction has 807 states and 1133 transitions. [2024-11-09 01:38:47,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:38:47,160 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1133 transitions. [2024-11-09 01:38:47,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-09 01:38:47,162 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:38:47,162 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:38:47,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 01:38:47,162 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:38:47,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:38:47,162 INFO L85 PathProgramCache]: Analyzing trace with hash 829300942, now seen corresponding path program 1 times [2024-11-09 01:38:47,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:38:47,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558880881] [2024-11-09 01:38:47,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:38:47,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:38:47,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:48,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:38:48,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:48,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:38:48,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:48,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:38:48,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:48,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:38:48,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:48,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:38:48,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:48,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:38:48,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:48,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:38:48,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:48,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:38:48,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:48,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:38:48,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:48,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:38:48,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:48,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:38:48,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:48,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:38:48,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:48,097 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:38:48,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:38:48,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558880881] [2024-11-09 01:38:48,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558880881] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:38:48,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:38:48,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 01:38:48,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494968733] [2024-11-09 01:38:48,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:38:48,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 01:38:48,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:38:48,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 01:38:48,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-09 01:38:48,100 INFO L87 Difference]: Start difference. First operand 807 states and 1133 transitions. Second operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:38:49,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:38:49,151 INFO L93 Difference]: Finished difference Result 1752 states and 2457 transitions. [2024-11-09 01:38:49,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 01:38:49,152 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 119 [2024-11-09 01:38:49,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:38:49,157 INFO L225 Difference]: With dead ends: 1752 [2024-11-09 01:38:49,157 INFO L226 Difference]: Without dead ends: 948 [2024-11-09 01:38:49,159 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2024-11-09 01:38:49,159 INFO L432 NwaCegarLoop]: 325 mSDtfsCounter, 433 mSDsluCounter, 1864 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 2189 SdHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 01:38:49,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 2189 Invalid, 747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 669 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 01:38:49,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2024-11-09 01:38:49,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 841. [2024-11-09 01:38:49,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 737 states have (on average 1.3541383989145184) internal successors, (998), 742 states have internal predecessors, (998), 92 states have call successors, (92), 11 states have call predecessors, (92), 11 states have return successors, (92), 87 states have call predecessors, (92), 92 states have call successors, (92) [2024-11-09 01:38:49,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1182 transitions. [2024-11-09 01:38:49,224 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1182 transitions. Word has length 119 [2024-11-09 01:38:49,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:38:49,225 INFO L471 AbstractCegarLoop]: Abstraction has 841 states and 1182 transitions. [2024-11-09 01:38:49,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:38:49,225 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1182 transitions. [2024-11-09 01:38:49,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-09 01:38:49,227 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:38:49,227 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:38:49,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 01:38:49,228 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:38:49,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:38:49,228 INFO L85 PathProgramCache]: Analyzing trace with hash 751755826, now seen corresponding path program 1 times [2024-11-09 01:38:49,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:38:49,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584460067] [2024-11-09 01:38:49,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:38:49,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:38:49,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:49,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:38:49,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:49,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:38:49,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:49,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:38:49,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:49,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:38:49,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:49,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:38:49,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:49,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:38:49,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:49,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:38:49,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:49,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:38:49,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:49,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:38:49,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:49,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:38:49,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:49,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:38:49,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:49,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:38:49,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:49,812 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:38:49,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:38:49,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584460067] [2024-11-09 01:38:49,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584460067] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:38:49,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:38:49,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 01:38:49,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223467918] [2024-11-09 01:38:49,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:38:49,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 01:38:49,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:38:49,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 01:38:49,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:38:49,815 INFO L87 Difference]: Start difference. First operand 841 states and 1182 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:38:50,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:38:50,256 INFO L93 Difference]: Finished difference Result 1739 states and 2434 transitions. [2024-11-09 01:38:50,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:38:50,257 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 120 [2024-11-09 01:38:50,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:38:50,261 INFO L225 Difference]: With dead ends: 1739 [2024-11-09 01:38:50,262 INFO L226 Difference]: Without dead ends: 944 [2024-11-09 01:38:50,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-09 01:38:50,264 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 378 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 1075 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:38:50,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 1075 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 01:38:50,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2024-11-09 01:38:50,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 851. [2024-11-09 01:38:50,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 851 states, 747 states have (on average 1.3534136546184738) internal successors, (1011), 752 states have internal predecessors, (1011), 92 states have call successors, (92), 11 states have call predecessors, (92), 11 states have return successors, (92), 87 states have call predecessors, (92), 92 states have call successors, (92) [2024-11-09 01:38:50,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1195 transitions. [2024-11-09 01:38:50,319 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1195 transitions. Word has length 120 [2024-11-09 01:38:50,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:38:50,320 INFO L471 AbstractCegarLoop]: Abstraction has 851 states and 1195 transitions. [2024-11-09 01:38:50,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:38:50,320 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1195 transitions. [2024-11-09 01:38:50,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-09 01:38:50,322 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:38:50,322 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:38:50,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 01:38:50,322 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:38:50,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:38:50,323 INFO L85 PathProgramCache]: Analyzing trace with hash 2137959220, now seen corresponding path program 1 times [2024-11-09 01:38:50,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:38:50,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973866629] [2024-11-09 01:38:50,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:38:50,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:38:50,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:51,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:38:51,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:51,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:38:51,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:51,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:38:51,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:51,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:38:51,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:51,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:38:51,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:51,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:38:51,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:51,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:38:51,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:51,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:38:51,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:51,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:38:51,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:51,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:38:51,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:51,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:38:51,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:51,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:38:51,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:51,135 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:38:51,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:38:51,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973866629] [2024-11-09 01:38:51,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973866629] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:38:51,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:38:51,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 01:38:51,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964397306] [2024-11-09 01:38:51,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:38:51,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 01:38:51,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:38:51,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 01:38:51,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-09 01:38:51,137 INFO L87 Difference]: Start difference. First operand 851 states and 1195 transitions. Second operand has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:38:51,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:38:51,989 INFO L93 Difference]: Finished difference Result 1665 states and 2329 transitions. [2024-11-09 01:38:51,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 01:38:51,989 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 120 [2024-11-09 01:38:51,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:38:51,994 INFO L225 Difference]: With dead ends: 1665 [2024-11-09 01:38:51,995 INFO L226 Difference]: Without dead ends: 860 [2024-11-09 01:38:51,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2024-11-09 01:38:51,997 INFO L432 NwaCegarLoop]: 329 mSDtfsCounter, 490 mSDsluCounter, 1551 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 1880 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 01:38:51,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 1880 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 01:38:51,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2024-11-09 01:38:52,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 836. [2024-11-09 01:38:52,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 836 states, 732 states have (on average 1.3524590163934427) internal successors, (990), 737 states have internal predecessors, (990), 92 states have call successors, (92), 11 states have call predecessors, (92), 11 states have return successors, (92), 87 states have call predecessors, (92), 92 states have call successors, (92) [2024-11-09 01:38:52,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 1174 transitions. [2024-11-09 01:38:52,059 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 1174 transitions. Word has length 120 [2024-11-09 01:38:52,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:38:52,059 INFO L471 AbstractCegarLoop]: Abstraction has 836 states and 1174 transitions. [2024-11-09 01:38:52,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:38:52,059 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1174 transitions. [2024-11-09 01:38:52,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-09 01:38:52,061 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:38:52,061 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:38:52,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 01:38:52,061 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:38:52,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:38:52,062 INFO L85 PathProgramCache]: Analyzing trace with hash 2118823200, now seen corresponding path program 1 times [2024-11-09 01:38:52,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:38:52,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696099717] [2024-11-09 01:38:52,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:38:52,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:38:52,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:52,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:38:52,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:52,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:38:52,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:52,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:38:52,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:52,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:38:52,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:52,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:38:52,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:52,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:38:52,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:52,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:38:52,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:52,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:38:52,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:52,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:38:52,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:52,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:38:52,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:52,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:38:52,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:52,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:38:52,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:52,494 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:38:52,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:38:52,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696099717] [2024-11-09 01:38:52,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696099717] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:38:52,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:38:52,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 01:38:52,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849025827] [2024-11-09 01:38:52,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:38:52,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 01:38:52,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:38:52,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 01:38:52,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:38:52,497 INFO L87 Difference]: Start difference. First operand 836 states and 1174 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:38:52,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:38:52,720 INFO L93 Difference]: Finished difference Result 1508 states and 2115 transitions. [2024-11-09 01:38:52,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:38:52,720 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 121 [2024-11-09 01:38:52,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:38:52,725 INFO L225 Difference]: With dead ends: 1508 [2024-11-09 01:38:52,725 INFO L226 Difference]: Without dead ends: 1001 [2024-11-09 01:38:52,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:38:52,727 INFO L432 NwaCegarLoop]: 271 mSDtfsCounter, 129 mSDsluCounter, 871 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 1142 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:38:52,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 1142 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:38:52,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2024-11-09 01:38:52,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 996. [2024-11-09 01:38:52,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 996 states, 868 states have (on average 1.347926267281106) internal successors, (1170), 875 states have internal predecessors, (1170), 112 states have call successors, (112), 15 states have call predecessors, (112), 15 states have return successors, (112), 105 states have call predecessors, (112), 112 states have call successors, (112) [2024-11-09 01:38:52,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 996 states and 1394 transitions. [2024-11-09 01:38:52,802 INFO L78 Accepts]: Start accepts. Automaton has 996 states and 1394 transitions. Word has length 121 [2024-11-09 01:38:52,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:38:52,802 INFO L471 AbstractCegarLoop]: Abstraction has 996 states and 1394 transitions. [2024-11-09 01:38:52,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:38:52,802 INFO L276 IsEmpty]: Start isEmpty. Operand 996 states and 1394 transitions. [2024-11-09 01:38:52,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-09 01:38:52,804 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:38:52,804 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:38:52,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 01:38:52,804 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:38:52,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:38:52,804 INFO L85 PathProgramCache]: Analyzing trace with hash -408783257, now seen corresponding path program 1 times [2024-11-09 01:38:52,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:38:52,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390611097] [2024-11-09 01:38:52,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:38:52,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:38:52,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:53,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:38:53,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:53,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:38:53,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:53,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:38:53,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:53,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:38:53,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:53,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:38:53,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:53,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:38:53,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:53,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:38:53,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:53,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:38:53,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:53,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:38:53,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:53,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:38:53,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:53,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:38:53,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:53,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:38:53,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:53,036 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:38:53,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:38:53,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390611097] [2024-11-09 01:38:53,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390611097] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:38:53,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:38:53,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:38:53,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587657900] [2024-11-09 01:38:53,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:38:53,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:38:53,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:38:53,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:38:53,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:38:53,038 INFO L87 Difference]: Start difference. First operand 996 states and 1394 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:38:53,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:38:53,149 INFO L93 Difference]: Finished difference Result 1934 states and 2707 transitions. [2024-11-09 01:38:53,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:38:53,150 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 121 [2024-11-09 01:38:53,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:38:53,155 INFO L225 Difference]: With dead ends: 1934 [2024-11-09 01:38:53,156 INFO L226 Difference]: Without dead ends: 984 [2024-11-09 01:38:53,158 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:38:53,158 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 55 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:38:53,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 583 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:38:53,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2024-11-09 01:38:53,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 982. [2024-11-09 01:38:53,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 854 states have (on average 1.345433255269321) internal successors, (1149), 861 states have internal predecessors, (1149), 112 states have call successors, (112), 15 states have call predecessors, (112), 15 states have return successors, (112), 105 states have call predecessors, (112), 112 states have call successors, (112) [2024-11-09 01:38:53,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1373 transitions. [2024-11-09 01:38:53,233 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1373 transitions. Word has length 121 [2024-11-09 01:38:53,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:38:53,233 INFO L471 AbstractCegarLoop]: Abstraction has 982 states and 1373 transitions. [2024-11-09 01:38:53,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:38:53,233 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1373 transitions. [2024-11-09 01:38:53,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-09 01:38:53,235 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:38:53,235 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:38:53,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 01:38:53,236 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:38:53,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:38:53,236 INFO L85 PathProgramCache]: Analyzing trace with hash -8353378, now seen corresponding path program 1 times [2024-11-09 01:38:53,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:38:53,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923222509] [2024-11-09 01:38:53,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:38:53,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:38:53,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:53,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:38:53,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:53,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:38:53,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:53,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:38:53,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:53,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:38:53,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:53,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:38:53,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:53,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:38:53,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:53,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:38:53,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:53,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:38:53,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:53,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:38:53,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:53,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:38:53,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:53,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:38:53,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:53,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:38:53,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:53,435 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:38:53,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:38:53,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923222509] [2024-11-09 01:38:53,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923222509] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:38:53,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:38:53,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:38:53,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487679107] [2024-11-09 01:38:53,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:38:53,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:38:53,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:38:53,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:38:53,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:38:53,439 INFO L87 Difference]: Start difference. First operand 982 states and 1373 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:38:53,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:38:53,552 INFO L93 Difference]: Finished difference Result 1641 states and 2292 transitions. [2024-11-09 01:38:53,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:38:53,553 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 121 [2024-11-09 01:38:53,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:38:53,558 INFO L225 Difference]: With dead ends: 1641 [2024-11-09 01:38:53,559 INFO L226 Difference]: Without dead ends: 982 [2024-11-09 01:38:53,561 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:38:53,561 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 66 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:38:53,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 571 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:38:53,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2024-11-09 01:38:53,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 980. [2024-11-09 01:38:53,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 980 states, 852 states have (on average 1.3392018779342723) internal successors, (1141), 859 states have internal predecessors, (1141), 112 states have call successors, (112), 15 states have call predecessors, (112), 15 states have return successors, (112), 105 states have call predecessors, (112), 112 states have call successors, (112) [2024-11-09 01:38:53,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 1365 transitions. [2024-11-09 01:38:53,632 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 1365 transitions. Word has length 121 [2024-11-09 01:38:53,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:38:53,632 INFO L471 AbstractCegarLoop]: Abstraction has 980 states and 1365 transitions. [2024-11-09 01:38:53,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:38:53,633 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 1365 transitions. [2024-11-09 01:38:53,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-09 01:38:53,635 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:38:53,635 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:38:53,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 01:38:53,635 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:38:53,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:38:53,636 INFO L85 PathProgramCache]: Analyzing trace with hash 417061139, now seen corresponding path program 1 times [2024-11-09 01:38:53,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:38:53,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041583934] [2024-11-09 01:38:53,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:38:53,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:38:53,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:54,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:38:54,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:54,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:38:54,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:54,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:38:54,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:54,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:38:54,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:54,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:38:54,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:54,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:38:54,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:54,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:38:54,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:54,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:38:54,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:54,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:38:54,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:54,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:38:54,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:54,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:38:54,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:54,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:38:54,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:54,099 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:38:54,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:38:54,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041583934] [2024-11-09 01:38:54,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041583934] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:38:54,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:38:54,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 01:38:54,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819396073] [2024-11-09 01:38:54,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:38:54,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 01:38:54,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:38:54,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 01:38:54,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:38:54,103 INFO L87 Difference]: Start difference. First operand 980 states and 1365 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:38:54,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:38:54,435 INFO L93 Difference]: Finished difference Result 1939 states and 2691 transitions. [2024-11-09 01:38:54,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 01:38:54,436 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 121 [2024-11-09 01:38:54,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:38:54,440 INFO L225 Difference]: With dead ends: 1939 [2024-11-09 01:38:54,441 INFO L226 Difference]: Without dead ends: 1005 [2024-11-09 01:38:54,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2024-11-09 01:38:54,444 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 202 mSDsluCounter, 1061 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 1306 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:38:54,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 1306 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:38:54,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005 states. [2024-11-09 01:38:54,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005 to 994. [2024-11-09 01:38:54,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 866 states have (on average 1.3302540415704387) internal successors, (1152), 873 states have internal predecessors, (1152), 112 states have call successors, (112), 15 states have call predecessors, (112), 15 states have return successors, (112), 105 states have call predecessors, (112), 112 states have call successors, (112) [2024-11-09 01:38:54,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1376 transitions. [2024-11-09 01:38:54,507 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1376 transitions. Word has length 121 [2024-11-09 01:38:54,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:38:54,507 INFO L471 AbstractCegarLoop]: Abstraction has 994 states and 1376 transitions. [2024-11-09 01:38:54,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:38:54,507 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1376 transitions. [2024-11-09 01:38:54,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-09 01:38:54,510 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:38:54,510 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:38:54,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-09 01:38:54,510 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:38:54,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:38:54,511 INFO L85 PathProgramCache]: Analyzing trace with hash 635915857, now seen corresponding path program 1 times [2024-11-09 01:38:54,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:38:54,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289137434] [2024-11-09 01:38:54,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:38:54,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:38:54,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:54,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:38:54,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:54,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:38:54,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:54,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:38:54,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:54,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:38:54,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:54,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:38:54,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:54,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:38:54,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:54,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:38:54,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:54,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:38:54,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:54,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:38:54,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:54,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:38:54,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:54,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:38:54,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:54,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:38:54,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:54,708 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:38:54,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:38:54,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289137434] [2024-11-09 01:38:54,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289137434] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:38:54,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:38:54,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:38:54,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366268460] [2024-11-09 01:38:54,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:38:54,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:38:54,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:38:54,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:38:54,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:38:54,711 INFO L87 Difference]: Start difference. First operand 994 states and 1376 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:38:54,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:38:54,831 INFO L93 Difference]: Finished difference Result 1932 states and 2670 transitions. [2024-11-09 01:38:54,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:38:54,832 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 121 [2024-11-09 01:38:54,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:38:54,838 INFO L225 Difference]: With dead ends: 1932 [2024-11-09 01:38:54,838 INFO L226 Difference]: Without dead ends: 984 [2024-11-09 01:38:54,840 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:38:54,842 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 50 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:38:54,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 729 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:38:54,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2024-11-09 01:38:54,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 982. [2024-11-09 01:38:54,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 854 states have (on average 1.3278688524590163) internal successors, (1134), 861 states have internal predecessors, (1134), 112 states have call successors, (112), 15 states have call predecessors, (112), 15 states have return successors, (112), 105 states have call predecessors, (112), 112 states have call successors, (112) [2024-11-09 01:38:54,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1358 transitions. [2024-11-09 01:38:54,906 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1358 transitions. Word has length 121 [2024-11-09 01:38:54,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:38:54,907 INFO L471 AbstractCegarLoop]: Abstraction has 982 states and 1358 transitions. [2024-11-09 01:38:54,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:38:54,907 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1358 transitions. [2024-11-09 01:38:54,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-09 01:38:54,908 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:38:54,909 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:38:54,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-09 01:38:54,909 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:38:54,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:38:54,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1095319066, now seen corresponding path program 1 times [2024-11-09 01:38:54,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:38:54,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856278926] [2024-11-09 01:38:54,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:38:54,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:38:54,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:55,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:38:55,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:55,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:38:55,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:55,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:38:55,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:55,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:38:55,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:55,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:38:55,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:55,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:38:55,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:55,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:38:55,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:55,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:38:55,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:55,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:38:55,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:55,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:38:55,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:55,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:38:55,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:55,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:38:55,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:55,568 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:38:55,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:38:55,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856278926] [2024-11-09 01:38:55,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856278926] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:38:55,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:38:55,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 01:38:55,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124950152] [2024-11-09 01:38:55,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:38:55,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 01:38:55,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:38:55,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 01:38:55,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:38:55,570 INFO L87 Difference]: Start difference. First operand 982 states and 1358 transitions. Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:38:56,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:38:56,107 INFO L93 Difference]: Finished difference Result 1646 states and 2266 transitions. [2024-11-09 01:38:56,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 01:38:56,108 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 122 [2024-11-09 01:38:56,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:38:56,113 INFO L225 Difference]: With dead ends: 1646 [2024-11-09 01:38:56,113 INFO L226 Difference]: Without dead ends: 987 [2024-11-09 01:38:56,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-11-09 01:38:56,116 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 358 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:38:56,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 753 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 01:38:56,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2024-11-09 01:38:56,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 935. [2024-11-09 01:38:56,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 935 states, 815 states have (on average 1.3214723926380367) internal successors, (1077), 821 states have internal predecessors, (1077), 102 states have call successors, (102), 17 states have call predecessors, (102), 17 states have return successors, (102), 96 states have call predecessors, (102), 102 states have call successors, (102) [2024-11-09 01:38:56,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1281 transitions. [2024-11-09 01:38:56,192 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1281 transitions. Word has length 122 [2024-11-09 01:38:56,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:38:56,192 INFO L471 AbstractCegarLoop]: Abstraction has 935 states and 1281 transitions. [2024-11-09 01:38:56,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:38:56,193 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1281 transitions. [2024-11-09 01:38:56,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-09 01:38:56,194 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:38:56,194 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:38:56,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-09 01:38:56,195 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:38:56,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:38:56,195 INFO L85 PathProgramCache]: Analyzing trace with hash -240964163, now seen corresponding path program 1 times [2024-11-09 01:38:56,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:38:56,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391962518] [2024-11-09 01:38:56,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:38:56,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:38:56,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:56,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:38:56,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:56,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:38:56,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:56,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:38:56,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:56,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:38:56,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:56,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:38:56,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:56,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:38:56,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:56,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:38:56,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:56,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:38:56,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:56,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:38:56,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:56,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:38:56,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:56,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:38:56,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:56,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:38:56,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:56,802 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:38:56,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:38:56,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391962518] [2024-11-09 01:38:56,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391962518] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:38:56,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:38:56,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 01:38:56,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89051119] [2024-11-09 01:38:56,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:38:56,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 01:38:56,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:38:56,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 01:38:56,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:38:56,805 INFO L87 Difference]: Start difference. First operand 935 states and 1281 transitions. Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:38:57,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:38:57,190 INFO L93 Difference]: Finished difference Result 2039 states and 2783 transitions. [2024-11-09 01:38:57,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:38:57,191 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 122 [2024-11-09 01:38:57,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:38:57,196 INFO L225 Difference]: With dead ends: 2039 [2024-11-09 01:38:57,197 INFO L226 Difference]: Without dead ends: 1107 [2024-11-09 01:38:57,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-11-09 01:38:57,200 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 423 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:38:57,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 720 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:38:57,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2024-11-09 01:38:57,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 950. [2024-11-09 01:38:57,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 950 states, 830 states have (on average 1.319277108433735) internal successors, (1095), 836 states have internal predecessors, (1095), 102 states have call successors, (102), 17 states have call predecessors, (102), 17 states have return successors, (102), 96 states have call predecessors, (102), 102 states have call successors, (102) [2024-11-09 01:38:57,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1299 transitions. [2024-11-09 01:38:57,279 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1299 transitions. Word has length 122 [2024-11-09 01:38:57,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:38:57,280 INFO L471 AbstractCegarLoop]: Abstraction has 950 states and 1299 transitions. [2024-11-09 01:38:57,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:38:57,280 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1299 transitions. [2024-11-09 01:38:57,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-09 01:38:57,281 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:38:57,282 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:38:57,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-09 01:38:57,282 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:38:57,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:38:57,282 INFO L85 PathProgramCache]: Analyzing trace with hash -942028741, now seen corresponding path program 1 times [2024-11-09 01:38:57,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:38:57,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129137953] [2024-11-09 01:38:57,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:38:57,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:38:57,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:57,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:38:57,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:57,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:38:57,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:57,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:38:57,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:57,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:38:57,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:57,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:38:57,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:57,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:38:57,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:57,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:38:57,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:57,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:38:57,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:57,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:38:57,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:57,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:38:57,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:57,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:38:57,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:57,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:38:57,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:57,953 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:38:57,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:38:57,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129137953] [2024-11-09 01:38:57,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129137953] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:38:57,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:38:57,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 01:38:57,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644798658] [2024-11-09 01:38:57,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:38:57,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 01:38:57,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:38:57,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 01:38:57,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-09 01:38:57,956 INFO L87 Difference]: Start difference. First operand 950 states and 1299 transitions. Second operand has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:38:58,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:38:58,520 INFO L93 Difference]: Finished difference Result 2104 states and 2870 transitions. [2024-11-09 01:38:58,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 01:38:58,521 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 122 [2024-11-09 01:38:58,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:38:58,527 INFO L225 Difference]: With dead ends: 2104 [2024-11-09 01:38:58,528 INFO L226 Difference]: Without dead ends: 1157 [2024-11-09 01:38:58,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2024-11-09 01:38:58,531 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 393 mSDsluCounter, 1593 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 1813 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:38:58,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 1813 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 01:38:58,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2024-11-09 01:38:58,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 954. [2024-11-09 01:38:58,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 954 states, 834 states have (on average 1.3177458033573142) internal successors, (1099), 840 states have internal predecessors, (1099), 102 states have call successors, (102), 17 states have call predecessors, (102), 17 states have return successors, (102), 96 states have call predecessors, (102), 102 states have call successors, (102) [2024-11-09 01:38:58,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 1303 transitions. [2024-11-09 01:38:58,622 INFO L78 Accepts]: Start accepts. Automaton has 954 states and 1303 transitions. Word has length 122 [2024-11-09 01:38:58,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:38:58,622 INFO L471 AbstractCegarLoop]: Abstraction has 954 states and 1303 transitions. [2024-11-09 01:38:58,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:38:58,623 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1303 transitions. [2024-11-09 01:38:58,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-09 01:38:58,624 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:38:58,624 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:38:58,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-09 01:38:58,624 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:38:58,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:38:58,625 INFO L85 PathProgramCache]: Analyzing trace with hash 460635711, now seen corresponding path program 1 times [2024-11-09 01:38:58,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:38:58,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282435286] [2024-11-09 01:38:58,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:38:58,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:38:58,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:59,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:38:59,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:59,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:38:59,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:59,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:38:59,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:59,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:38:59,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:59,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:38:59,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:59,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:38:59,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:59,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:38:59,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:59,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:38:59,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:59,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:38:59,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:59,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:38:59,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:59,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:38:59,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:59,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:38:59,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:38:59,605 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:38:59,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:38:59,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282435286] [2024-11-09 01:38:59,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282435286] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:38:59,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:38:59,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 01:38:59,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528341194] [2024-11-09 01:38:59,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:38:59,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 01:38:59,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:38:59,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 01:38:59,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-09 01:38:59,609 INFO L87 Difference]: Start difference. First operand 954 states and 1303 transitions. Second operand has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:39:00,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:39:00,734 INFO L93 Difference]: Finished difference Result 2167 states and 2956 transitions. [2024-11-09 01:39:00,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 01:39:00,734 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 122 [2024-11-09 01:39:00,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:39:00,742 INFO L225 Difference]: With dead ends: 2167 [2024-11-09 01:39:00,742 INFO L226 Difference]: Without dead ends: 1216 [2024-11-09 01:39:00,745 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2024-11-09 01:39:00,746 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 389 mSDsluCounter, 1752 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 1973 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 01:39:00,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 1973 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 01:39:00,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2024-11-09 01:39:00,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 962. [2024-11-09 01:39:00,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 962 states, 842 states have (on average 1.314726840855107) internal successors, (1107), 848 states have internal predecessors, (1107), 102 states have call successors, (102), 17 states have call predecessors, (102), 17 states have return successors, (102), 96 states have call predecessors, (102), 102 states have call successors, (102) [2024-11-09 01:39:00,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1311 transitions. [2024-11-09 01:39:00,838 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1311 transitions. Word has length 122 [2024-11-09 01:39:00,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:39:00,840 INFO L471 AbstractCegarLoop]: Abstraction has 962 states and 1311 transitions. [2024-11-09 01:39:00,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:39:00,841 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1311 transitions. [2024-11-09 01:39:00,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-09 01:39:00,842 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:39:00,842 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:39:00,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-09 01:39:00,843 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:39:00,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:39:00,843 INFO L85 PathProgramCache]: Analyzing trace with hash -240428867, now seen corresponding path program 1 times [2024-11-09 01:39:00,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:39:00,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874826619] [2024-11-09 01:39:00,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:39:00,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:39:00,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:01,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:39:01,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:01,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:39:01,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:01,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:39:01,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:01,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:39:01,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:01,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:39:01,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:01,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:39:01,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:01,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:39:01,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:01,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:39:01,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:01,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:39:01,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:01,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:39:01,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:01,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:39:01,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:01,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:39:01,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:01,363 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:39:01,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:39:01,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874826619] [2024-11-09 01:39:01,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874826619] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:39:01,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:39:01,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 01:39:01,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005926392] [2024-11-09 01:39:01,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:39:01,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 01:39:01,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:39:01,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 01:39:01,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:39:01,366 INFO L87 Difference]: Start difference. First operand 962 states and 1311 transitions. Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:39:01,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:39:01,962 INFO L93 Difference]: Finished difference Result 2163 states and 2946 transitions. [2024-11-09 01:39:01,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 01:39:01,963 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 122 [2024-11-09 01:39:01,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:39:01,973 INFO L225 Difference]: With dead ends: 2163 [2024-11-09 01:39:01,973 INFO L226 Difference]: Without dead ends: 1204 [2024-11-09 01:39:01,976 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-11-09 01:39:01,986 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 346 mSDsluCounter, 906 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 1167 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 01:39:01,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 1167 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 01:39:01,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2024-11-09 01:39:02,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 950. [2024-11-09 01:39:02,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 950 states, 830 states have (on average 1.3120481927710843) internal successors, (1089), 836 states have internal predecessors, (1089), 102 states have call successors, (102), 17 states have call predecessors, (102), 17 states have return successors, (102), 96 states have call predecessors, (102), 102 states have call successors, (102) [2024-11-09 01:39:02,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1293 transitions. [2024-11-09 01:39:02,122 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1293 transitions. Word has length 122 [2024-11-09 01:39:02,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:39:02,122 INFO L471 AbstractCegarLoop]: Abstraction has 950 states and 1293 transitions. [2024-11-09 01:39:02,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:39:02,122 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1293 transitions. [2024-11-09 01:39:02,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-09 01:39:02,123 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:39:02,124 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:39:02,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-09 01:39:02,124 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:39:02,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:39:02,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1858872006, now seen corresponding path program 1 times [2024-11-09 01:39:02,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:39:02,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813126741] [2024-11-09 01:39:02,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:39:02,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:39:02,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:02,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:39:02,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:02,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:39:02,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:02,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:39:02,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:02,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:39:02,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:02,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:39:02,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:02,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:39:02,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:02,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:39:02,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:02,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:39:02,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:02,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:39:02,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:02,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:39:02,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:02,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:39:02,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:02,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:39:02,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:02,888 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:39:02,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:39:02,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813126741] [2024-11-09 01:39:02,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813126741] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:39:02,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:39:02,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 01:39:02,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313374886] [2024-11-09 01:39:02,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:39:02,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 01:39:02,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:39:02,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 01:39:02,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-09 01:39:02,891 INFO L87 Difference]: Start difference. First operand 950 states and 1293 transitions. Second operand has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:39:03,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:39:03,376 INFO L93 Difference]: Finished difference Result 1616 states and 2205 transitions. [2024-11-09 01:39:03,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 01:39:03,377 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 124 [2024-11-09 01:39:03,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:39:03,383 INFO L225 Difference]: With dead ends: 1616 [2024-11-09 01:39:03,383 INFO L226 Difference]: Without dead ends: 961 [2024-11-09 01:39:03,385 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2024-11-09 01:39:03,387 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 184 mSDsluCounter, 1159 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 1329 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:39:03,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 1329 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 01:39:03,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2024-11-09 01:39:03,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 959. [2024-11-09 01:39:03,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 959 states, 839 states have (on average 1.3087008343265794) internal successors, (1098), 845 states have internal predecessors, (1098), 102 states have call successors, (102), 17 states have call predecessors, (102), 17 states have return successors, (102), 96 states have call predecessors, (102), 102 states have call successors, (102) [2024-11-09 01:39:03,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 1302 transitions. [2024-11-09 01:39:03,496 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 1302 transitions. Word has length 124 [2024-11-09 01:39:03,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:39:03,496 INFO L471 AbstractCegarLoop]: Abstraction has 959 states and 1302 transitions. [2024-11-09 01:39:03,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:39:03,497 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 1302 transitions. [2024-11-09 01:39:03,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-09 01:39:03,499 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:39:03,499 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:39:03,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-09 01:39:03,499 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:39:03,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:39:03,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1458442127, now seen corresponding path program 1 times [2024-11-09 01:39:03,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:39:03,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446929808] [2024-11-09 01:39:03,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:39:03,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:39:03,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:03,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:39:03,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:03,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:39:03,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:03,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:39:03,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:03,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:39:03,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:03,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:39:03,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:03,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:39:03,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:03,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:39:03,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:03,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:39:03,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:03,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:39:03,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:03,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:39:03,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:03,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:39:03,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:03,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:39:03,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:03,738 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:39:03,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:39:03,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446929808] [2024-11-09 01:39:03,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446929808] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:39:03,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:39:03,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:39:03,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390622082] [2024-11-09 01:39:03,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:39:03,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:39:03,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:39:03,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:39:03,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:39:03,740 INFO L87 Difference]: Start difference. First operand 959 states and 1302 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:39:03,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:39:03,879 INFO L93 Difference]: Finished difference Result 1612 states and 2192 transitions. [2024-11-09 01:39:03,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:39:03,880 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 124 [2024-11-09 01:39:03,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:39:03,885 INFO L225 Difference]: With dead ends: 1612 [2024-11-09 01:39:03,885 INFO L226 Difference]: Without dead ends: 948 [2024-11-09 01:39:03,887 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:39:03,887 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 47 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:39:03,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 701 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:39:03,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2024-11-09 01:39:03,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 944. [2024-11-09 01:39:03,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 944 states, 824 states have (on average 1.3033980582524272) internal successors, (1074), 830 states have internal predecessors, (1074), 102 states have call successors, (102), 17 states have call predecessors, (102), 17 states have return successors, (102), 96 states have call predecessors, (102), 102 states have call successors, (102) [2024-11-09 01:39:03,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1278 transitions. [2024-11-09 01:39:03,976 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1278 transitions. Word has length 124 [2024-11-09 01:39:03,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:39:03,977 INFO L471 AbstractCegarLoop]: Abstraction has 944 states and 1278 transitions. [2024-11-09 01:39:03,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:39:03,977 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1278 transitions. [2024-11-09 01:39:03,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-09 01:39:03,978 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:39:03,978 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:39:03,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-09 01:39:03,979 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:39:03,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:39:03,979 INFO L85 PathProgramCache]: Analyzing trace with hash 570259053, now seen corresponding path program 1 times [2024-11-09 01:39:03,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:39:03,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522652098] [2024-11-09 01:39:03,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:39:03,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:39:04,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:04,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:39:04,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:04,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:39:04,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:04,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:39:04,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:04,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:39:04,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:04,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:39:04,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:04,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:39:04,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:04,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:39:04,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:04,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:39:04,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:04,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:39:04,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:04,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:39:04,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:04,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:39:04,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:04,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:39:04,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:04,146 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:39:04,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:39:04,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522652098] [2024-11-09 01:39:04,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522652098] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:39:04,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:39:04,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:39:04,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058642356] [2024-11-09 01:39:04,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:39:04,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:39:04,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:39:04,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:39:04,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:39:04,149 INFO L87 Difference]: Start difference. First operand 944 states and 1278 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:39:04,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:39:04,281 INFO L93 Difference]: Finished difference Result 1915 states and 2593 transitions. [2024-11-09 01:39:04,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:39:04,282 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 124 [2024-11-09 01:39:04,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:39:04,287 INFO L225 Difference]: With dead ends: 1915 [2024-11-09 01:39:04,287 INFO L226 Difference]: Without dead ends: 974 [2024-11-09 01:39:04,290 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:39:04,290 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:39:04,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 596 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:39:04,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2024-11-09 01:39:04,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 974. [2024-11-09 01:39:04,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 974 states, 854 states have (on average 1.2927400468384076) internal successors, (1104), 860 states have internal predecessors, (1104), 102 states have call successors, (102), 17 states have call predecessors, (102), 17 states have return successors, (102), 96 states have call predecessors, (102), 102 states have call successors, (102) [2024-11-09 01:39:04,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1308 transitions. [2024-11-09 01:39:04,380 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1308 transitions. Word has length 124 [2024-11-09 01:39:04,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:39:04,380 INFO L471 AbstractCegarLoop]: Abstraction has 974 states and 1308 transitions. [2024-11-09 01:39:04,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:39:04,381 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1308 transitions. [2024-11-09 01:39:04,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-09 01:39:04,382 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:39:04,382 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:39:04,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-09 01:39:04,382 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:39:04,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:39:04,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1111849902, now seen corresponding path program 1 times [2024-11-09 01:39:04,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:39:04,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852835659] [2024-11-09 01:39:04,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:39:04,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:39:04,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:04,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:39:04,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:04,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:39:04,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:04,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:39:04,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:04,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:39:04,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:04,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:39:04,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:04,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:39:04,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:04,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:39:04,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:04,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:39:04,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:04,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:39:04,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:04,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:39:04,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:04,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:39:04,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:04,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:39:04,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:04,578 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:39:04,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:39:04,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852835659] [2024-11-09 01:39:04,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852835659] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:39:04,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:39:04,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:39:04,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729203482] [2024-11-09 01:39:04,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:39:04,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:39:04,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:39:04,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:39:04,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:39:04,580 INFO L87 Difference]: Start difference. First operand 974 states and 1308 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:39:04,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:39:04,735 INFO L93 Difference]: Finished difference Result 1922 states and 2579 transitions. [2024-11-09 01:39:04,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:39:04,736 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 126 [2024-11-09 01:39:04,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:39:04,741 INFO L225 Difference]: With dead ends: 1922 [2024-11-09 01:39:04,742 INFO L226 Difference]: Without dead ends: 951 [2024-11-09 01:39:04,744 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:39:04,745 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 39 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:39:04,745 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 581 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:39:04,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2024-11-09 01:39:04,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 947. [2024-11-09 01:39:04,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 947 states, 827 states have (on average 1.2817412333736398) internal successors, (1060), 833 states have internal predecessors, (1060), 102 states have call successors, (102), 17 states have call predecessors, (102), 17 states have return successors, (102), 96 states have call predecessors, (102), 102 states have call successors, (102) [2024-11-09 01:39:04,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1264 transitions. [2024-11-09 01:39:04,837 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1264 transitions. Word has length 126 [2024-11-09 01:39:04,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:39:04,837 INFO L471 AbstractCegarLoop]: Abstraction has 947 states and 1264 transitions. [2024-11-09 01:39:04,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:39:04,838 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1264 transitions. [2024-11-09 01:39:04,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-09 01:39:04,839 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:39:04,839 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:39:04,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-09 01:39:04,840 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:39:04,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:39:04,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1911816657, now seen corresponding path program 1 times [2024-11-09 01:39:04,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:39:04,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155283562] [2024-11-09 01:39:04,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:39:04,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:39:04,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:06,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:39:06,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:06,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:39:06,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:06,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:39:06,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:06,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:39:06,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:06,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:39:06,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:06,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:39:06,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:06,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:39:06,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:06,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:39:06,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:06,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:39:06,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:06,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:39:06,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:06,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:39:06,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:06,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:39:06,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:06,623 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:39:06,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:39:06,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155283562] [2024-11-09 01:39:06,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155283562] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:39:06,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:39:06,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-09 01:39:06,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097310385] [2024-11-09 01:39:06,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:39:06,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 01:39:06,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:39:06,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 01:39:06,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2024-11-09 01:39:06,627 INFO L87 Difference]: Start difference. First operand 947 states and 1264 transitions. Second operand has 14 states, 14 states have (on average 5.071428571428571) internal successors, (71), 14 states have internal predecessors, (71), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-09 01:39:07,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:39:07,940 INFO L93 Difference]: Finished difference Result 1874 states and 2510 transitions. [2024-11-09 01:39:07,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 01:39:07,941 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.071428571428571) internal successors, (71), 14 states have internal predecessors, (71), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 128 [2024-11-09 01:39:07,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:39:07,951 INFO L225 Difference]: With dead ends: 1874 [2024-11-09 01:39:07,951 INFO L226 Difference]: Without dead ends: 1216 [2024-11-09 01:39:07,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2024-11-09 01:39:07,957 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 465 mSDsluCounter, 1566 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 1789 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 01:39:07,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 1789 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 01:39:07,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2024-11-09 01:39:08,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 1010. [2024-11-09 01:39:08,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1010 states, 890 states have (on average 1.2797752808988765) internal successors, (1139), 896 states have internal predecessors, (1139), 102 states have call successors, (102), 17 states have call predecessors, (102), 17 states have return successors, (102), 96 states have call predecessors, (102), 102 states have call successors, (102) [2024-11-09 01:39:08,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 1343 transitions. [2024-11-09 01:39:08,068 INFO L78 Accepts]: Start accepts. Automaton has 1010 states and 1343 transitions. Word has length 128 [2024-11-09 01:39:08,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:39:08,069 INFO L471 AbstractCegarLoop]: Abstraction has 1010 states and 1343 transitions. [2024-11-09 01:39:08,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.071428571428571) internal successors, (71), 14 states have internal predecessors, (71), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-09 01:39:08,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 1343 transitions. [2024-11-09 01:39:08,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-09 01:39:08,070 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:39:08,071 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:39:08,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-09 01:39:08,071 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:39:08,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:39:08,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1703092269, now seen corresponding path program 1 times [2024-11-09 01:39:08,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:39:08,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713878655] [2024-11-09 01:39:08,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:39:08,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:39:08,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:08,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:39:08,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:08,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:39:08,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:08,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:39:08,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:08,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:39:08,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:08,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:39:08,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:08,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:39:08,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:08,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:39:08,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:08,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:39:08,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:08,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:39:08,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:08,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:39:08,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:08,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:39:08,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:08,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:39:08,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:08,414 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:39:08,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:39:08,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713878655] [2024-11-09 01:39:08,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713878655] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:39:08,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:39:08,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 01:39:08,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023285117] [2024-11-09 01:39:08,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:39:08,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 01:39:08,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:39:08,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 01:39:08,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:39:08,417 INFO L87 Difference]: Start difference. First operand 1010 states and 1343 transitions. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:39:08,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:39:08,764 INFO L93 Difference]: Finished difference Result 1847 states and 2468 transitions. [2024-11-09 01:39:08,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:39:08,765 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 128 [2024-11-09 01:39:08,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:39:08,772 INFO L225 Difference]: With dead ends: 1847 [2024-11-09 01:39:08,775 INFO L226 Difference]: Without dead ends: 1126 [2024-11-09 01:39:08,777 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:39:08,777 INFO L432 NwaCegarLoop]: 243 mSDtfsCounter, 218 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 1021 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:39:08,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 1021 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:39:08,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1126 states. [2024-11-09 01:39:08,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1126 to 1010. [2024-11-09 01:39:08,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1010 states, 890 states have (on average 1.2775280898876404) internal successors, (1137), 896 states have internal predecessors, (1137), 102 states have call successors, (102), 17 states have call predecessors, (102), 17 states have return successors, (102), 96 states have call predecessors, (102), 102 states have call successors, (102) [2024-11-09 01:39:08,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 1341 transitions. [2024-11-09 01:39:08,895 INFO L78 Accepts]: Start accepts. Automaton has 1010 states and 1341 transitions. Word has length 128 [2024-11-09 01:39:08,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:39:08,895 INFO L471 AbstractCegarLoop]: Abstraction has 1010 states and 1341 transitions. [2024-11-09 01:39:08,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:39:08,896 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 1341 transitions. [2024-11-09 01:39:08,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-09 01:39:08,897 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:39:08,897 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:39:08,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-09 01:39:08,898 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:39:08,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:39:08,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1839430099, now seen corresponding path program 1 times [2024-11-09 01:39:08,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:39:08,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728847439] [2024-11-09 01:39:08,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:39:08,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:39:08,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:09,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:39:09,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:09,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:39:09,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:09,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:39:09,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:09,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:39:09,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:09,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:39:09,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:09,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:39:09,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:09,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:39:09,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:09,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:39:09,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:09,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:39:09,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:09,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:39:09,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:09,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:39:09,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:09,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:39:09,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:09,281 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:39:09,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:39:09,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728847439] [2024-11-09 01:39:09,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728847439] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:39:09,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:39:09,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 01:39:09,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131995489] [2024-11-09 01:39:09,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:39:09,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 01:39:09,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:39:09,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 01:39:09,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:39:09,283 INFO L87 Difference]: Start difference. First operand 1010 states and 1341 transitions. Second operand has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:39:09,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:39:09,622 INFO L93 Difference]: Finished difference Result 1895 states and 2530 transitions. [2024-11-09 01:39:09,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:39:09,622 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 128 [2024-11-09 01:39:09,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:39:09,628 INFO L225 Difference]: With dead ends: 1895 [2024-11-09 01:39:09,628 INFO L226 Difference]: Without dead ends: 1174 [2024-11-09 01:39:09,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:39:09,631 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 300 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:39:09,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 777 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:39:09,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2024-11-09 01:39:09,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 851. [2024-11-09 01:39:09,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 851 states, 751 states have (on average 1.2756324900133156) internal successors, (958), 755 states have internal predecessors, (958), 84 states have call successors, (84), 15 states have call predecessors, (84), 15 states have return successors, (84), 80 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-09 01:39:09,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1126 transitions. [2024-11-09 01:39:09,735 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1126 transitions. Word has length 128 [2024-11-09 01:39:09,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:39:09,736 INFO L471 AbstractCegarLoop]: Abstraction has 851 states and 1126 transitions. [2024-11-09 01:39:09,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:39:09,736 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1126 transitions. [2024-11-09 01:39:09,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-09 01:39:09,737 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:39:09,738 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:39:09,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-09 01:39:09,738 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:39:09,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:39:09,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1775478827, now seen corresponding path program 1 times [2024-11-09 01:39:09,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:39:09,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332114457] [2024-11-09 01:39:09,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:39:09,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:39:09,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:10,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:39:10,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:10,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:39:10,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:10,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:39:10,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:10,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:39:10,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:10,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:39:10,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:10,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:39:10,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:10,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:39:10,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:10,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:39:10,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:10,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:39:10,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:10,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:39:10,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:10,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:39:10,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:10,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:39:10,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:10,808 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:39:10,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:39:10,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332114457] [2024-11-09 01:39:10,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332114457] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:39:10,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:39:10,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 01:39:10,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192832884] [2024-11-09 01:39:10,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:39:10,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 01:39:10,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:39:10,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 01:39:10,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-09 01:39:10,810 INFO L87 Difference]: Start difference. First operand 851 states and 1126 transitions. Second operand has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:39:11,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:39:11,563 INFO L93 Difference]: Finished difference Result 1475 states and 1957 transitions. [2024-11-09 01:39:11,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 01:39:11,564 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 128 [2024-11-09 01:39:11,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:39:11,569 INFO L225 Difference]: With dead ends: 1475 [2024-11-09 01:39:11,569 INFO L226 Difference]: Without dead ends: 913 [2024-11-09 01:39:11,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2024-11-09 01:39:11,571 INFO L432 NwaCegarLoop]: 237 mSDtfsCounter, 221 mSDsluCounter, 1466 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 1703 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 01:39:11,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 1703 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 01:39:11,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2024-11-09 01:39:11,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 847. [2024-11-09 01:39:11,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 847 states, 747 states have (on average 1.2757697456492638) internal successors, (953), 751 states have internal predecessors, (953), 84 states have call successors, (84), 15 states have call predecessors, (84), 15 states have return successors, (84), 80 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-09 01:39:11,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1121 transitions. [2024-11-09 01:39:11,714 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1121 transitions. Word has length 128 [2024-11-09 01:39:11,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:39:11,715 INFO L471 AbstractCegarLoop]: Abstraction has 847 states and 1121 transitions. [2024-11-09 01:39:11,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:39:11,715 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1121 transitions. [2024-11-09 01:39:11,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-09 01:39:11,717 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:39:11,717 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:39:11,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-09 01:39:11,717 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:39:11,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:39:11,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1480106236, now seen corresponding path program 1 times [2024-11-09 01:39:11,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:39:11,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123063988] [2024-11-09 01:39:11,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:39:11,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:39:11,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:39:11,796 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 01:39:11,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:39:11,975 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 01:39:11,976 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 01:39:11,977 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 01:39:11,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-09 01:39:11,983 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:39:12,165 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 01:39:12,170 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 01:39:12 BoogieIcfgContainer [2024-11-09 01:39:12,170 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 01:39:12,171 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 01:39:12,171 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 01:39:12,172 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 01:39:12,172 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:38:38" (3/4) ... [2024-11-09 01:39:12,175 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 01:39:12,177 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 01:39:12,177 INFO L158 Benchmark]: Toolchain (without parser) took 35350.76ms. Allocated memory was 151.0MB in the beginning and 1.1GB in the end (delta: 947.9MB). Free memory was 93.8MB in the beginning and 894.0MB in the end (delta: -800.3MB). Peak memory consumption was 148.2MB. Max. memory is 16.1GB. [2024-11-09 01:39:12,178 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 151.0MB. Free memory is still 110.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:39:12,178 INFO L158 Benchmark]: CACSL2BoogieTranslator took 387.66ms. Allocated memory is still 151.0MB. Free memory was 93.5MB in the beginning and 76.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 01:39:12,178 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.36ms. Allocated memory is still 151.0MB. Free memory was 76.7MB in the beginning and 121.6MB in the end (delta: -44.9MB). Peak memory consumption was 10.4MB. Max. memory is 16.1GB. [2024-11-09 01:39:12,178 INFO L158 Benchmark]: Boogie Preprocessor took 116.44ms. Allocated memory was 151.0MB in the beginning and 186.6MB in the end (delta: 35.7MB). Free memory was 121.5MB in the beginning and 155.7MB in the end (delta: -34.1MB). Peak memory consumption was 2.8MB. Max. memory is 16.1GB. [2024-11-09 01:39:12,179 INFO L158 Benchmark]: RCFGBuilder took 857.44ms. Allocated memory is still 186.6MB. Free memory was 155.7MB in the beginning and 116.9MB in the end (delta: 38.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-11-09 01:39:12,179 INFO L158 Benchmark]: TraceAbstraction took 33894.43ms. Allocated memory was 186.6MB in the beginning and 1.1GB in the end (delta: 912.3MB). Free memory was 115.8MB in the beginning and 894.0MB in the end (delta: -778.2MB). Peak memory consumption was 133.0MB. Max. memory is 16.1GB. [2024-11-09 01:39:12,179 INFO L158 Benchmark]: Witness Printer took 5.72ms. Allocated memory is still 1.1GB. Free memory is still 894.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:39:12,180 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.14ms. Allocated memory is still 151.0MB. Free memory is still 110.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 387.66ms. Allocated memory is still 151.0MB. Free memory was 93.5MB in the beginning and 76.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.36ms. Allocated memory is still 151.0MB. Free memory was 76.7MB in the beginning and 121.6MB in the end (delta: -44.9MB). Peak memory consumption was 10.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 116.44ms. Allocated memory was 151.0MB in the beginning and 186.6MB in the end (delta: 35.7MB). Free memory was 121.5MB in the beginning and 155.7MB in the end (delta: -34.1MB). Peak memory consumption was 2.8MB. Max. memory is 16.1GB. * RCFGBuilder took 857.44ms. Allocated memory is still 186.6MB. Free memory was 155.7MB in the beginning and 116.9MB in the end (delta: 38.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 33894.43ms. Allocated memory was 186.6MB in the beginning and 1.1GB in the end (delta: 912.3MB). Free memory was 115.8MB in the beginning and 894.0MB in the end (delta: -778.2MB). Peak memory consumption was 133.0MB. Max. memory is 16.1GB. * Witness Printer took 5.72ms. Allocated memory is still 1.1GB. Free memory is still 894.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 106, overapproximation of someBinaryArithmeticDOUBLEoperation at line 106. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L25] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer = &(BOOL_unsigned_char_Array_0[0]); [L26] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer = &(BOOL_unsigned_char_Array_0[1]); [L27-L29] double double_Array_0[5] = { 9.75, 5.1, 32.6, 128.1, 63.9 }; [L27-L29] double double_Array_0[5] = { 9.75, 5.1, 32.6, 128.1, 63.9 }; [L27-L29] double double_Array_0[5] = { 9.75, 5.1, 32.6, 128.1, 63.9 }; [L27-L29] double double_Array_0[5] = { 9.75, 5.1, 32.6, 128.1, 63.9 }; [L27-L29] double double_Array_0[5] = { 9.75, 5.1, 32.6, 128.1, 63.9 }; [L27-L29] double double_Array_0[5] = { 9.75, 5.1, 32.6, 128.1, 63.9 }; [L30] double* double_Array_0_arraydouble_Array_0arrayVar0_Pointer = &(double_Array_0[0]); [L31] double* double_Array_0_arraydouble_Array_0arrayVar1_Pointer = &(double_Array_0[1]); [L32] double* double_Array_0_arraydouble_Array_0arrayVar2_Pointer = &(double_Array_0[2]); [L33] double* double_Array_0_arraydouble_Array_0arrayVar3_Pointer = &(double_Array_0[3]); [L34] double* double_Array_0_arraydouble_Array_0arrayVar4_Pointer = &(double_Array_0[4]); [L35-L37] signed char signed_char_Array_0[2] = { 8, -128 }; [L35-L37] signed char signed_char_Array_0[2] = { 8, -128 }; [L35-L37] signed char signed_char_Array_0[2] = { 8, -128 }; [L38] signed char* signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer = &(signed_char_Array_0[0]); [L39] signed char* signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer = &(signed_char_Array_0[1]); [L40-L42] signed long int signed_long_int_Array_0[1] = { -10 }; [L40-L42] signed long int signed_long_int_Array_0[1] = { -10 }; [L43] signed long int* signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer = &(signed_long_int_Array_0[0]); [L44-L46] unsigned long int unsigned_long_int_Array_0[2] = { 1885310857, 1 }; [L44-L46] unsigned long int unsigned_long_int_Array_0[2] = { 1885310857, 1 }; [L44-L46] unsigned long int unsigned_long_int_Array_0[2] = { 1885310857, 1 }; [L47] unsigned long int* unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer = &(unsigned_long_int_Array_0[0]); [L48] unsigned long int* unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer = &(unsigned_long_int_Array_0[1]); [L49] signed long int last_1_signed_long_int_Array_0_0_ = -10; VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=0, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L110] isInitial = 1 [L111] FCALL initially() [L112] COND TRUE 1 [L113] CALL updateLastVariables() [L103] EXPR signed_long_int_Array_0[0] [L103] last_1_signed_long_int_Array_0_0_ = signed_long_int_Array_0[0] [L113] RET updateLastVariables() [L114] CALL updateVariables() [L81] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L82] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L82] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L82] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L83] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L83] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L83] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L84] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L85] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L85] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L85] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L86] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L86] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L86] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L87] double_Array_0[0] = __VERIFIER_nondet_double() [L88] EXPR double_Array_0[0] [L88] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L88] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F [L88] EXPR double_Array_0[0] [L88] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L88] EXPR (double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L88] EXPR (double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L88] CALL assume_abort_if_not((double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L88] RET assume_abort_if_not((double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L89] double_Array_0[1] = __VERIFIER_nondet_double() [L90] EXPR double_Array_0[1] [L90] EXPR double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L90] EXPR double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F [L90] EXPR double_Array_0[1] [L90] EXPR double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L90] EXPR (double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L90] EXPR (double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L90] CALL assume_abort_if_not((double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L90] RET assume_abort_if_not((double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L91] double_Array_0[3] = __VERIFIER_nondet_double() [L92] EXPR double_Array_0[3] [L92] EXPR double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L92] EXPR double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F [L92] EXPR double_Array_0[3] [L92] EXPR double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L92] EXPR (double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 4611686.018427382800e+12F && double_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L92] EXPR (double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 4611686.018427382800e+12F && double_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L92] CALL assume_abort_if_not((double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 4611686.018427382800e+12F && double_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L92] RET assume_abort_if_not((double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 4611686.018427382800e+12F && double_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L93] double_Array_0[4] = __VERIFIER_nondet_double() [L94] EXPR double_Array_0[4] [L94] EXPR double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L94] EXPR double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F [L94] EXPR double_Array_0[4] [L94] EXPR double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L94] EXPR (double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854765600e+12F && double_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L94] EXPR (double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854765600e+12F && double_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L94] CALL assume_abort_if_not((double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854765600e+12F && double_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L94] RET assume_abort_if_not((double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854765600e+12F && double_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L95] signed_char_Array_0[0] = __VERIFIER_nondet_char() [L96] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L96] CALL assume_abort_if_not(signed_char_Array_0[0] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L96] RET assume_abort_if_not(signed_char_Array_0[0] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L97] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L97] CALL assume_abort_if_not(signed_char_Array_0[0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L97] RET assume_abort_if_not(signed_char_Array_0[0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L98] unsigned_long_int_Array_0[0] = __VERIFIER_nondet_ulong() [L99] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L99] CALL assume_abort_if_not(unsigned_long_int_Array_0[0] >= 1073741824) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L99] RET assume_abort_if_not(unsigned_long_int_Array_0[0] >= 1073741824) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L100] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L100] CALL assume_abort_if_not(unsigned_long_int_Array_0[0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L100] RET assume_abort_if_not(unsigned_long_int_Array_0[0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L114] RET updateVariables() [L115] CALL step() [L53] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L53] COND FALSE !((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) [L56] EXPR \read(*unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L56] EXPR ((last_1_signed_long_int_Array_0_0_) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))) ? (last_1_signed_long_int_Array_0_0_) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) [L56] EXPR ((last_1_signed_long_int_Array_0_0_) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))) ? (last_1_signed_long_int_Array_0_0_) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L56] (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) = ((((last_1_signed_long_int_Array_0_0_) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))) ? (last_1_signed_long_int_Array_0_0_) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))))) [L58] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L58] COND FALSE !((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) [L61] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer) [L61] unsigned char stepLocal_1 = (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)); [L62] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer) [L62] signed long int stepLocal_0 = (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)); [L63] stepLocal_1 || ((~ (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) >= (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, stepLocal_0=-10, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L63] stepLocal_1 || ((~ (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) >= (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) [L63] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer) [L63] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer) [L63] stepLocal_1 || ((~ (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) >= (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, stepLocal_0=-10, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L63] COND TRUE stepLocal_1 || ((~ (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) >= (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) [L64] EXPR \read(*unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L64] COND FALSE !(stepLocal_0 < (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))) [L69] (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) = 2 VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L74] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer) [L74] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L74] COND TRUE (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) >= (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) [L75] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar0_Pointer) [L75] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar1_Pointer) [L75] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar3_Pointer) [L75] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar4_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L75] EXPR ((((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) > ((*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer)))) ? (((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) : ((*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer))) [L75] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar1_Pointer) [L75] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar3_Pointer) [L75] EXPR ((((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) > ((*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer)))) ? (((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) : ((*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L75] (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) = ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) - ((((((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) > ((*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer)))) ? (((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) : ((*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer)))))) [L115] RET step() [L116] CALL, EXPR property() [L106] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer) [L106] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) || ((~ (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) >= (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L106] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) || ((~ (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) >= (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) [L106] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer) [L106] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer) [L106] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) || ((~ (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) >= (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L106] EXPR ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) || ((~ (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) >= (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) < (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))) ? ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) : 1) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) 2))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) [L106] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer) [L106] EXPR \read(*unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L106] EXPR ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) < (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))) ? ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) : 1) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) 2)) [L106] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer) [L106] EXPR ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) < (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))) ? ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) : 1) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) 2)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L106] EXPR ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) || ((~ (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) >= (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) < (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))) ? ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) : 1) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) 2))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L106] EXPR (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) || ((~ (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) >= (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) < (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))) ? ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) : 1) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) 2))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) < 0 ) ? -((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))))) - last_1_signed_long_int_Array_0_0_))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))) ? (last_1_signed_long_int_Array_0_0_) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L106] EXPR (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) || ((~ (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) >= (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) < (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))) ? ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) : 1) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) 2))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) < 0 ) ? -((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))))) - last_1_signed_long_int_Array_0_0_))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))) ? (last_1_signed_long_int_Array_0_0_) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))))))) [L106] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L106] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) < 0 ) ? -((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))))) - last_1_signed_long_int_Array_0_0_))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))) ? (last_1_signed_long_int_Array_0_0_) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))))))) [L106] EXPR \read(*unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer) [L106] EXPR \read(*unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L106] EXPR ((last_1_signed_long_int_Array_0_0_) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))) ? (last_1_signed_long_int_Array_0_0_) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) [L106] EXPR ((last_1_signed_long_int_Array_0_0_) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))) ? (last_1_signed_long_int_Array_0_0_) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L106] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) < 0 ) ? -((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))))) - last_1_signed_long_int_Array_0_0_))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))) ? (last_1_signed_long_int_Array_0_0_) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L106] EXPR (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) || ((~ (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) >= (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) < (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))) ? ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) : 1) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) 2))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) < 0 ) ? -((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))))) - last_1_signed_long_int_Array_0_0_))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))) ? (last_1_signed_long_int_Array_0_0_) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L106] EXPR ((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) || ((~ (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) >= (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) < (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))) ? ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) : 1) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) 2))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) < 0 ) ? -((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))))) - last_1_signed_long_int_Array_0_0_))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))) ? (last_1_signed_long_int_Array_0_0_) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))))))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) + (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < 0 ) ? -((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L106] EXPR ((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) || ((~ (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) >= (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) < (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))) ? ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) : 1) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) 2))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) < 0 ) ? -((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))))) - last_1_signed_long_int_Array_0_0_))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))) ? (last_1_signed_long_int_Array_0_0_) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))))))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) + (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < 0 ) ? -((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))))))) : 1) [L106] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L106] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) + (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < 0 ) ? -((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))))))) : 1 [L106] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) + (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < 0 ) ? -((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))))))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L106] EXPR ((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) || ((~ (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) >= (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) < (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))) ? ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) : 1) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) 2))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) < 0 ) ? -((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))))) - last_1_signed_long_int_Array_0_0_))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))) ? (last_1_signed_long_int_Array_0_0_) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))))))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) + (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < 0 ) ? -((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L106] EXPR (((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) || ((~ (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) >= (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) < (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))) ? ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) : 1) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) 2))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) < 0 ) ? -((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))))) - last_1_signed_long_int_Array_0_0_))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))) ? (last_1_signed_long_int_Array_0_0_) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))))))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) + (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < 0 ) ? -((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))))))) : 1)) && (((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) >= (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) - ((((((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) > ((*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer)))) ? (((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) : ((*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer)))))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (((((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))) > ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L106] EXPR (((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) || ((~ (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) >= (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) < (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))) ? ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) : 1) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) 2))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) < 0 ) ? -((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))))) - last_1_signed_long_int_Array_0_0_))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))) ? (last_1_signed_long_int_Array_0_0_) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))))))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) + (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < 0 ) ? -((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))))))) : 1)) && (((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) >= (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) - ((((((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) > ((*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer)))) ? (((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) : ((*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer)))))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (((((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))) > ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))))))) [L106] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer) [L106] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L106] EXPR ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) >= (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) - ((((((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) > ((*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer)))) ? (((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) : ((*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer)))))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (((((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))) > ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))))) [L106] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar2_Pointer) [L106] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar0_Pointer) [L106] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar1_Pointer) [L106] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar3_Pointer) [L106] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar4_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L106] EXPR ((((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) > ((*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer)))) ? (((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) : ((*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer))) [L106] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar1_Pointer) [L106] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar3_Pointer) [L106] EXPR ((((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) > ((*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer)))) ? (((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) : ((*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L106] EXPR ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) >= (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) - ((((((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) > ((*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer)))) ? (((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) : ((*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer)))))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (((((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))) > ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L106] EXPR (((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) || ((~ (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) >= (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) < (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))) ? ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) : 1) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) 2))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) < 0 ) ? -((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))))) - last_1_signed_long_int_Array_0_0_))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))) ? (last_1_signed_long_int_Array_0_0_) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))))))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) + (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < 0 ) ? -((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))))))) : 1)) && (((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) >= (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) - ((((((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) > ((*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer)))) ? (((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) : ((*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer)))))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (((((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))) > ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L106-L107] return (((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) || ((~ (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) >= (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) < (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))) ? ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) : 1) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) 2))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) < 0 ) ? -((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))))) - last_1_signed_long_int_Array_0_0_))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) == ((unsigned long int) ((((last_1_signed_long_int_Array_0_0_) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))) ? (last_1_signed_long_int_Array_0_0_) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))))))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) + (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < 0 ) ? -((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))))))) : 1)) && (((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) >= (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) - ((((((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) > ((*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer)))) ? (((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)))) : ((*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer)))))))) : ((*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer)) == ((double) (((((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))) > ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))))))) ; [L116] RET, EXPR property() [L116] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, isInitial=1, last_1_signed_long_int_Array_0_0_=-10, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:1}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={8:4}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 113 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 33.6s, OverallIterations: 38, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 12.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6882 SdHoareTripleChecker+Valid, 7.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6882 mSDsluCounter, 35052 SdHoareTripleChecker+Invalid, 6.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 27536 mSDsCounter, 659 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6588 IncrementalHoareTripleChecker+Invalid, 7247 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 659 mSolverCounterUnsat, 7516 mSDtfsCounter, 6588 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1281 GetRequests, 985 SyntacticMatches, 0 SemanticMatches, 296 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1010occurred in iteration=34, InterpolantAutomatonStates: 254, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.3s AutomataMinimizationTime, 37 MinimizatonAttempts, 2592 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 16.1s InterpolantComputationTime, 4587 NumberOfCodeBlocks, 4587 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 4422 ConstructedInterpolants, 0 QuantifiedInterpolants, 24864 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 PerfectInterpolantSequences, 9768/9768 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 01:39:12,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-15.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1cf2833edd1cdae0e001cafaa7cd8c6b44382f8b73a263b509a9183609c6c876 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 01:39:14,659 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:39:14,747 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 01:39:14,756 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:39:14,757 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:39:14,791 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:39:14,793 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:39:14,793 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:39:14,794 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:39:14,795 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:39:14,795 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:39:14,796 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:39:14,796 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:39:14,797 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:39:14,799 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:39:14,800 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:39:14,800 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:39:14,800 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:39:14,800 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:39:14,801 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:39:14,801 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:39:14,805 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:39:14,805 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:39:14,806 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 01:39:14,806 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 01:39:14,806 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:39:14,806 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 01:39:14,806 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:39:14,807 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:39:14,807 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:39:14,807 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:39:14,807 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:39:14,808 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:39:14,808 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:39:14,809 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:39:14,810 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:39:14,811 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:39:14,811 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:39:14,811 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 01:39:14,811 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 01:39:14,812 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:39:14,812 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:39:14,813 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:39:14,813 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:39:14,813 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1cf2833edd1cdae0e001cafaa7cd8c6b44382f8b73a263b509a9183609c6c876 [2024-11-09 01:39:15,188 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:39:15,211 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:39:15,215 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:39:15,216 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:39:15,217 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:39:15,218 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-15.i [2024-11-09 01:39:16,787 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:39:17,039 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:39:17,040 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-15.i [2024-11-09 01:39:17,048 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/105d6937a/8df1abe63b3d44d8a02302877f07fb32/FLAGccd4cdf44 [2024-11-09 01:39:17,061 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/105d6937a/8df1abe63b3d44d8a02302877f07fb32 [2024-11-09 01:39:17,063 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:39:17,064 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:39:17,066 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:39:17,066 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:39:17,076 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:39:17,077 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:39:17" (1/1) ... [2024-11-09 01:39:17,078 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@452b88a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:39:17, skipping insertion in model container [2024-11-09 01:39:17,079 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:39:17" (1/1) ... [2024-11-09 01:39:17,108 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:39:17,307 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-15.i[917,930] [2024-11-09 01:39:17,390 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:39:17,419 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:39:17,432 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-15.i[917,930] [2024-11-09 01:39:17,487 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:39:17,518 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:39:17,518 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:39:17 WrapperNode [2024-11-09 01:39:17,519 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:39:17,520 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:39:17,520 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:39:17,520 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:39:17,527 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:39:17" (1/1) ... [2024-11-09 01:39:17,552 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:39:17" (1/1) ... [2024-11-09 01:39:17,617 INFO L138 Inliner]: procedures = 33, calls = 155, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 512 [2024-11-09 01:39:17,617 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:39:17,618 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:39:17,618 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:39:17,619 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:39:17,630 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:39:17" (1/1) ... [2024-11-09 01:39:17,631 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:39:17" (1/1) ... [2024-11-09 01:39:17,642 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:39:17" (1/1) ... [2024-11-09 01:39:17,685 INFO L175 MemorySlicer]: Split 127 memory accesses to 6 slices as follows [2, 16, 51, 25, 10, 23]. 40 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 2, 5, 2, 1, 2]. The 16 writes are split as follows [0, 2, 6, 4, 1, 3]. [2024-11-09 01:39:17,685 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:39:17" (1/1) ... [2024-11-09 01:39:17,685 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:39:17" (1/1) ... [2024-11-09 01:39:17,706 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:39:17" (1/1) ... [2024-11-09 01:39:17,711 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:39:17" (1/1) ... [2024-11-09 01:39:17,718 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:39:17" (1/1) ... [2024-11-09 01:39:17,722 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:39:17" (1/1) ... [2024-11-09 01:39:17,731 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:39:17,732 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:39:17,732 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:39:17,733 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:39:17,733 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:39:17" (1/1) ... [2024-11-09 01:39:17,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:39:17,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:39:17,770 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 01:39:17,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 01:39:17,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:39:17,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-09 01:39:17,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-09 01:39:17,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-09 01:39:17,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-09 01:39:17,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-11-09 01:39:17,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-11-09 01:39:17,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-09 01:39:17,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-09 01:39:17,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-09 01:39:17,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-09 01:39:17,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-11-09 01:39:17,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-11-09 01:39:17,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-09 01:39:17,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-09 01:39:17,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-09 01:39:17,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-09 01:39:17,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-09 01:39:17,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-09 01:39:17,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 01:39:17,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-09 01:39:17,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-09 01:39:17,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-09 01:39:17,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-09 01:39:17,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-09 01:39:17,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-09 01:39:17,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-09 01:39:17,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-09 01:39:17,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-09 01:39:17,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-09 01:39:17,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-09 01:39:17,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-09 01:39:17,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-09 01:39:17,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-09 01:39:17,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-09 01:39:17,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-11-09 01:39:17,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-11-09 01:39:17,821 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-09 01:39:17,821 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-09 01:39:17,821 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-09 01:39:17,821 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-09 01:39:17,821 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-09 01:39:17,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-09 01:39:17,822 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:39:17,822 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:39:17,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:39:17,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:39:17,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-09 01:39:17,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-09 01:39:17,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-09 01:39:17,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-09 01:39:17,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-09 01:39:17,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-09 01:39:17,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-09 01:39:17,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-09 01:39:17,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-09 01:39:17,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-09 01:39:17,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-09 01:39:17,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-09 01:39:18,006 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:39:18,008 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:39:20,195 INFO L? ?]: Removed 136 outVars from TransFormulas that were not future-live. [2024-11-09 01:39:20,195 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:39:20,212 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:39:20,214 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:39:20,214 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:39:20 BoogieIcfgContainer [2024-11-09 01:39:20,214 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:39:20,216 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:39:20,216 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:39:20,220 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:39:20,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:39:17" (1/3) ... [2024-11-09 01:39:20,221 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33361559 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:39:20, skipping insertion in model container [2024-11-09 01:39:20,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:39:17" (2/3) ... [2024-11-09 01:39:20,222 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33361559 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:39:20, skipping insertion in model container [2024-11-09 01:39:20,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:39:20" (3/3) ... [2024-11-09 01:39:20,224 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-15.i [2024-11-09 01:39:20,243 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:39:20,244 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:39:20,333 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:39:20,339 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;@50065ea3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:39:20,339 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:39:20,343 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 98 states have (on average 1.4489795918367347) internal successors, (142), 99 states have internal predecessors, (142), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 01:39:20,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-09 01:39:20,353 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:39:20,354 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:39:20,355 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:39:20,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:39:20,362 INFO L85 PathProgramCache]: Analyzing trace with hash 31279224, now seen corresponding path program 1 times [2024-11-09 01:39:20,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:39:20,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1605810963] [2024-11-09 01:39:20,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:39:20,375 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:39:20,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:39:20,377 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:39:20,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 01:39:20,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:20,913 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 01:39:20,921 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:39:20,954 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2024-11-09 01:39:20,955 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:39:20,955 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:39:20,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1605810963] [2024-11-09 01:39:20,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1605810963] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:39:20,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:39:20,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:39:20,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684028108] [2024-11-09 01:39:20,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:39:20,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:39:20,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:39:20,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:39:20,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:39:20,997 INFO L87 Difference]: Start difference. First operand has 113 states, 98 states have (on average 1.4489795918367347) internal successors, (142), 99 states have internal predecessors, (142), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 01:39:21,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:39:21,042 INFO L93 Difference]: Finished difference Result 219 states and 338 transitions. [2024-11-09 01:39:21,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:39:21,045 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 115 [2024-11-09 01:39:21,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:39:21,056 INFO L225 Difference]: With dead ends: 219 [2024-11-09 01:39:21,056 INFO L226 Difference]: Without dead ends: 109 [2024-11-09 01:39:21,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:39:21,066 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:39:21,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:39:21,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-09 01:39:21,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-09 01:39:21,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 95 states have (on average 1.4) internal successors, (133), 95 states have internal predecessors, (133), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 01:39:21,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 157 transitions. [2024-11-09 01:39:21,115 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 157 transitions. Word has length 115 [2024-11-09 01:39:21,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:39:21,116 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 157 transitions. [2024-11-09 01:39:21,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 01:39:21,116 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 157 transitions. [2024-11-09 01:39:21,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-09 01:39:21,120 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:39:21,120 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:39:21,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-09 01:39:21,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:39:21,321 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:39:21,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:39:21,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1829017178, now seen corresponding path program 1 times [2024-11-09 01:39:21,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:39:21,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2087096090] [2024-11-09 01:39:21,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:39:21,323 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:39:21,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:39:21,327 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:39:21,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 01:39:21,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:21,818 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 01:39:21,822 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:39:21,873 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-09 01:39:21,873 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:39:21,873 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:39:21,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2087096090] [2024-11-09 01:39:21,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2087096090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:39:21,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:39:21,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:39:21,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502894121] [2024-11-09 01:39:21,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:39:21,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:39:21,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:39:21,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:39:21,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:39:21,877 INFO L87 Difference]: Start difference. First operand 109 states and 157 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 01:39:21,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:39:21,971 INFO L93 Difference]: Finished difference Result 217 states and 314 transitions. [2024-11-09 01:39:21,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:39:21,979 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 115 [2024-11-09 01:39:21,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:39:21,981 INFO L225 Difference]: With dead ends: 217 [2024-11-09 01:39:21,981 INFO L226 Difference]: Without dead ends: 111 [2024-11-09 01:39:21,982 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:39:21,985 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:39:21,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 454 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:39:21,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-09 01:39:22,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-09 01:39:22,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 97 states have (on average 1.3917525773195876) internal successors, (135), 97 states have internal predecessors, (135), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 01:39:22,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 159 transitions. [2024-11-09 01:39:22,007 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 159 transitions. Word has length 115 [2024-11-09 01:39:22,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:39:22,009 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 159 transitions. [2024-11-09 01:39:22,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 01:39:22,010 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 159 transitions. [2024-11-09 01:39:22,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-09 01:39:22,011 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:39:22,011 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:39:22,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-09 01:39:22,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:39:22,213 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:39:22,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:39:22,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1512009960, now seen corresponding path program 1 times [2024-11-09 01:39:22,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:39:22,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [542065883] [2024-11-09 01:39:22,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:39:22,216 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:39:22,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:39:22,219 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:39:22,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-09 01:39:22,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:22,720 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 01:39:22,725 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:39:23,437 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 27 treesize of output 15 [2024-11-09 01:39:23,527 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 8 proven. 132 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-09 01:39:23,531 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:39:23,780 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:39:23,780 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:39:23,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [542065883] [2024-11-09 01:39:23,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [542065883] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 01:39:23,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 01:39:23,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2024-11-09 01:39:23,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368024272] [2024-11-09 01:39:23,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:39:23,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:39:23,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:39:23,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:39:23,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-09 01:39:23,783 INFO L87 Difference]: Start difference. First operand 111 states and 159 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:39:23,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:39:23,962 INFO L93 Difference]: Finished difference Result 271 states and 390 transitions. [2024-11-09 01:39:23,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:39:23,963 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-11-09 01:39:23,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:39:23,965 INFO L225 Difference]: With dead ends: 271 [2024-11-09 01:39:23,965 INFO L226 Difference]: Without dead ends: 163 [2024-11-09 01:39:23,966 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-09 01:39:23,967 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 75 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:39:23,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 699 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:39:23,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-11-09 01:39:23,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 113. [2024-11-09 01:39:23,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 99 states have (on average 1.3838383838383839) internal successors, (137), 99 states have internal predecessors, (137), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 01:39:23,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 161 transitions. [2024-11-09 01:39:23,977 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 161 transitions. Word has length 115 [2024-11-09 01:39:23,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:39:23,977 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 161 transitions. [2024-11-09 01:39:23,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:39:23,978 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 161 transitions. [2024-11-09 01:39:23,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-09 01:39:23,980 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:39:23,980 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:39:23,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-09 01:39:24,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:39:24,181 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:39:24,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:39:24,182 INFO L85 PathProgramCache]: Analyzing trace with hash 2140893523, now seen corresponding path program 1 times [2024-11-09 01:39:24,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:39:24,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1690666431] [2024-11-09 01:39:24,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:39:24,183 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:39:24,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:39:24,186 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:39:24,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-09 01:39:24,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:24,643 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 01:39:24,649 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:39:25,377 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 8 proven. 132 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-09 01:39:25,378 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:39:25,522 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:39:25,523 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:39:25,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1690666431] [2024-11-09 01:39:25,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1690666431] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 01:39:25,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 01:39:25,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2024-11-09 01:39:25,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114408380] [2024-11-09 01:39:25,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:39:25,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:39:25,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:39:25,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:39:25,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-09 01:39:25,526 INFO L87 Difference]: Start difference. First operand 113 states and 161 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:39:25,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:39:25,667 INFO L93 Difference]: Finished difference Result 273 states and 391 transitions. [2024-11-09 01:39:25,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:39:25,671 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-11-09 01:39:25,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:39:25,673 INFO L225 Difference]: With dead ends: 273 [2024-11-09 01:39:25,673 INFO L226 Difference]: Without dead ends: 163 [2024-11-09 01:39:25,674 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-09 01:39:25,678 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 72 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:39:25,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 578 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:39:25,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-11-09 01:39:25,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 117. [2024-11-09 01:39:25,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 103 states have (on average 1.3786407766990292) internal successors, (142), 103 states have internal predecessors, (142), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 01:39:25,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 166 transitions. [2024-11-09 01:39:25,695 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 166 transitions. Word has length 115 [2024-11-09 01:39:25,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:39:25,697 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 166 transitions. [2024-11-09 01:39:25,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:39:25,698 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 166 transitions. [2024-11-09 01:39:25,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-09 01:39:25,699 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:39:25,700 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:39:25,721 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-09 01:39:25,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:39:25,901 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:39:25,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:39:25,901 INFO L85 PathProgramCache]: Analyzing trace with hash 451949781, now seen corresponding path program 1 times [2024-11-09 01:39:25,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:39:25,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [156037016] [2024-11-09 01:39:25,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:39:25,902 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:39:25,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:39:25,905 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:39:25,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-09 01:39:26,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:26,316 INFO L255 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 01:39:26,329 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:39:26,707 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:39:26,708 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:39:26,708 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:39:26,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [156037016] [2024-11-09 01:39:26,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [156037016] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:39:26,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:39:26,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 01:39:26,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248948698] [2024-11-09 01:39:26,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:39:26,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:39:26,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:39:26,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:39:26,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:39:26,711 INFO L87 Difference]: Start difference. First operand 117 states and 166 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:39:26,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:39:26,810 INFO L93 Difference]: Finished difference Result 344 states and 491 transitions. [2024-11-09 01:39:26,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:39:26,811 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-11-09 01:39:26,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:39:26,813 INFO L225 Difference]: With dead ends: 344 [2024-11-09 01:39:26,813 INFO L226 Difference]: Without dead ends: 230 [2024-11-09 01:39:26,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:39:26,817 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 91 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:39:26,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 440 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:39:26,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-11-09 01:39:26,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 220. [2024-11-09 01:39:26,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 193 states have (on average 1.383419689119171) internal successors, (267), 193 states have internal predecessors, (267), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-09 01:39:26,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 315 transitions. [2024-11-09 01:39:26,836 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 315 transitions. Word has length 115 [2024-11-09 01:39:26,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:39:26,837 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 315 transitions. [2024-11-09 01:39:26,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:39:26,837 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 315 transitions. [2024-11-09 01:39:26,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-09 01:39:26,839 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:39:26,839 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:39:26,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-09 01:39:27,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:39:27,040 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:39:27,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:39:27,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1750063971, now seen corresponding path program 1 times [2024-11-09 01:39:27,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:39:27,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1683091983] [2024-11-09 01:39:27,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:39:27,042 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:39:27,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:39:27,043 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:39:27,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-09 01:39:27,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:27,466 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 01:39:27,471 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:39:28,090 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 8 proven. 132 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-09 01:39:28,091 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:39:28,266 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:39:28,267 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:39:28,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1683091983] [2024-11-09 01:39:28,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1683091983] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 01:39:28,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 01:39:28,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2024-11-09 01:39:28,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41147292] [2024-11-09 01:39:28,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:39:28,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:39:28,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:39:28,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:39:28,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-09 01:39:28,269 INFO L87 Difference]: Start difference. First operand 220 states and 315 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:39:28,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:39:28,429 INFO L93 Difference]: Finished difference Result 485 states and 695 transitions. [2024-11-09 01:39:28,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:39:28,431 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 116 [2024-11-09 01:39:28,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:39:28,433 INFO L225 Difference]: With dead ends: 485 [2024-11-09 01:39:28,435 INFO L226 Difference]: Without dead ends: 268 [2024-11-09 01:39:28,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-09 01:39:28,437 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 63 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:39:28,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 579 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:39:28,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-11-09 01:39:28,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 231. [2024-11-09 01:39:28,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 204 states have (on average 1.3872549019607843) internal successors, (283), 204 states have internal predecessors, (283), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-09 01:39:28,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 331 transitions. [2024-11-09 01:39:28,451 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 331 transitions. Word has length 116 [2024-11-09 01:39:28,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:39:28,451 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 331 transitions. [2024-11-09 01:39:28,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:39:28,452 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 331 transitions. [2024-11-09 01:39:28,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-09 01:39:28,453 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:39:28,453 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:39:28,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-09 01:39:28,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:39:28,654 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:39:28,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:39:28,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1491898533, now seen corresponding path program 1 times [2024-11-09 01:39:28,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:39:28,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [628115125] [2024-11-09 01:39:28,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:39:28,655 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:39:28,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:39:28,657 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:39:28,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-09 01:39:29,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:29,082 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 01:39:29,086 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:39:29,480 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:39:29,480 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:39:29,480 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:39:29,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [628115125] [2024-11-09 01:39:29,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [628115125] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:39:29,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:39:29,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 01:39:29,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024080632] [2024-11-09 01:39:29,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:39:29,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:39:29,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:39:29,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:39:29,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:39:29,485 INFO L87 Difference]: Start difference. First operand 231 states and 331 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:39:29,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:39:29,583 INFO L93 Difference]: Finished difference Result 470 states and 672 transitions. [2024-11-09 01:39:29,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:39:29,583 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 116 [2024-11-09 01:39:29,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:39:29,585 INFO L225 Difference]: With dead ends: 470 [2024-11-09 01:39:29,585 INFO L226 Difference]: Without dead ends: 242 [2024-11-09 01:39:29,586 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:39:29,587 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 81 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:39:29,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 516 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:39:29,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-11-09 01:39:29,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 232. [2024-11-09 01:39:29,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 205 states have (on average 1.3804878048780487) internal successors, (283), 205 states have internal predecessors, (283), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-09 01:39:29,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 331 transitions. [2024-11-09 01:39:29,608 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 331 transitions. Word has length 116 [2024-11-09 01:39:29,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:39:29,612 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 331 transitions. [2024-11-09 01:39:29,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:39:29,612 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 331 transitions. [2024-11-09 01:39:29,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-09 01:39:29,613 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:39:29,613 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:39:29,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-09 01:39:29,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:39:29,814 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:39:29,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:39:29,815 INFO L85 PathProgramCache]: Analyzing trace with hash 635553891, now seen corresponding path program 1 times [2024-11-09 01:39:29,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:39:29,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1022613721] [2024-11-09 01:39:29,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:39:29,815 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:39:29,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:39:29,816 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:39:29,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-09 01:39:30,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:30,257 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 01:39:30,261 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:39:30,864 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 8 proven. 132 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-09 01:39:30,865 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:39:31,048 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:39:31,049 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:39:31,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1022613721] [2024-11-09 01:39:31,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1022613721] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 01:39:31,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 01:39:31,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 12 [2024-11-09 01:39:31,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319638671] [2024-11-09 01:39:31,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:39:31,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:39:31,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:39:31,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:39:31,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-09 01:39:31,051 INFO L87 Difference]: Start difference. First operand 232 states and 331 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:39:31,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:39:31,199 INFO L93 Difference]: Finished difference Result 395 states and 561 transitions. [2024-11-09 01:39:31,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:39:31,200 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2024-11-09 01:39:31,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:39:31,202 INFO L225 Difference]: With dead ends: 395 [2024-11-09 01:39:31,202 INFO L226 Difference]: Without dead ends: 268 [2024-11-09 01:39:31,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-09 01:39:31,203 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 70 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:39:31,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 682 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:39:31,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-11-09 01:39:31,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 231. [2024-11-09 01:39:31,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 204 states have (on average 1.3725490196078431) internal successors, (280), 204 states have internal predecessors, (280), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-09 01:39:31,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 328 transitions. [2024-11-09 01:39:31,214 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 328 transitions. Word has length 117 [2024-11-09 01:39:31,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:39:31,215 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 328 transitions. [2024-11-09 01:39:31,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:39:31,215 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 328 transitions. [2024-11-09 01:39:31,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-09 01:39:31,216 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:39:31,217 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:39:31,233 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-09 01:39:31,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:39:31,418 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:39:31,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:39:31,418 INFO L85 PathProgramCache]: Analyzing trace with hash -597730802, now seen corresponding path program 1 times [2024-11-09 01:39:31,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:39:31,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1051067450] [2024-11-09 01:39:31,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:39:31,419 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:39:31,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:39:31,422 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:39:31,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-09 01:39:31,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:31,837 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 01:39:31,840 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:39:32,244 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 8 proven. 132 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-09 01:39:32,244 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:39:32,376 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:39:32,376 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:39:32,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1051067450] [2024-11-09 01:39:32,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1051067450] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 01:39:32,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 01:39:32,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2024-11-09 01:39:32,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321522677] [2024-11-09 01:39:32,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:39:32,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:39:32,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:39:32,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:39:32,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-09 01:39:32,378 INFO L87 Difference]: Start difference. First operand 231 states and 328 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:39:32,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:39:32,518 INFO L93 Difference]: Finished difference Result 392 states and 554 transitions. [2024-11-09 01:39:32,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:39:32,521 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2024-11-09 01:39:32,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:39:32,523 INFO L225 Difference]: With dead ends: 392 [2024-11-09 01:39:32,523 INFO L226 Difference]: Without dead ends: 266 [2024-11-09 01:39:32,524 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-09 01:39:32,525 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 69 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:39:32,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 645 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:39:32,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-11-09 01:39:32,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 229. [2024-11-09 01:39:32,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 202 states have (on average 1.3613861386138615) internal successors, (275), 202 states have internal predecessors, (275), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-09 01:39:32,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 323 transitions. [2024-11-09 01:39:32,535 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 323 transitions. Word has length 117 [2024-11-09 01:39:32,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:39:32,536 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 323 transitions. [2024-11-09 01:39:32,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:39:32,536 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 323 transitions. [2024-11-09 01:39:32,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-09 01:39:32,538 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:39:32,538 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:39:32,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-09 01:39:32,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:39:32,739 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:39:32,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:39:32,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1309316045, now seen corresponding path program 1 times [2024-11-09 01:39:32,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:39:32,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1493951002] [2024-11-09 01:39:32,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:39:32,740 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:39:32,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:39:32,741 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:39:32,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-09 01:39:33,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:33,180 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 01:39:33,183 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:39:33,684 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 8 proven. 132 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-09 01:39:33,685 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:39:33,872 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:39:33,872 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:39:33,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1493951002] [2024-11-09 01:39:33,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1493951002] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 01:39:33,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 01:39:33,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 12 [2024-11-09 01:39:33,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139080536] [2024-11-09 01:39:33,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:39:33,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:39:33,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:39:33,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:39:33,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-09 01:39:33,874 INFO L87 Difference]: Start difference. First operand 229 states and 323 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:39:34,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:39:34,002 INFO L93 Difference]: Finished difference Result 389 states and 546 transitions. [2024-11-09 01:39:34,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:39:34,002 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2024-11-09 01:39:34,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:39:34,004 INFO L225 Difference]: With dead ends: 389 [2024-11-09 01:39:34,004 INFO L226 Difference]: Without dead ends: 265 [2024-11-09 01:39:34,005 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-09 01:39:34,005 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 60 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:39:34,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 668 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:39:34,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2024-11-09 01:39:34,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 229. [2024-11-09 01:39:34,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 202 states have (on average 1.3564356435643565) internal successors, (274), 202 states have internal predecessors, (274), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-09 01:39:34,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 322 transitions. [2024-11-09 01:39:34,021 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 322 transitions. Word has length 118 [2024-11-09 01:39:34,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:39:34,022 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 322 transitions. [2024-11-09 01:39:34,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:39:34,022 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 322 transitions. [2024-11-09 01:39:34,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-09 01:39:34,023 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:39:34,023 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:39:34,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-09 01:39:34,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:39:34,225 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:39:34,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:39:34,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1182721453, now seen corresponding path program 1 times [2024-11-09 01:39:34,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:39:34,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1084495916] [2024-11-09 01:39:34,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:39:34,226 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:39:34,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:39:34,227 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:39:34,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-09 01:39:34,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:34,656 INFO L255 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 01:39:34,659 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:39:34,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-09 01:39:34,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2024-11-09 01:39:34,782 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:39:34,782 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:39:34,782 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:39:34,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1084495916] [2024-11-09 01:39:34,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1084495916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:39:34,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:39:34,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:39:34,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049535964] [2024-11-09 01:39:34,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:39:34,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:39:34,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:39:34,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:39:34,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:39:34,784 INFO L87 Difference]: Start difference. First operand 229 states and 322 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:39:35,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:39:35,061 INFO L93 Difference]: Finished difference Result 638 states and 899 transitions. [2024-11-09 01:39:35,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:39:35,062 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2024-11-09 01:39:35,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:39:35,067 INFO L225 Difference]: With dead ends: 638 [2024-11-09 01:39:35,067 INFO L226 Difference]: Without dead ends: 412 [2024-11-09 01:39:35,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:39:35,068 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 114 mSDsluCounter, 823 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:39:35,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 1058 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:39:35,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2024-11-09 01:39:35,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 408. [2024-11-09 01:39:35,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 363 states have (on average 1.3636363636363635) internal successors, (495), 365 states have internal predecessors, (495), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-09 01:39:35,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 575 transitions. [2024-11-09 01:39:35,090 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 575 transitions. Word has length 118 [2024-11-09 01:39:35,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:39:35,090 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 575 transitions. [2024-11-09 01:39:35,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:39:35,091 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 575 transitions. [2024-11-09 01:39:35,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-09 01:39:35,092 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:39:35,092 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:39:35,108 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-09 01:39:35,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:39:35,293 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:39:35,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:39:35,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1338774032, now seen corresponding path program 1 times [2024-11-09 01:39:35,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:39:35,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1210556251] [2024-11-09 01:39:35,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:39:35,294 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:39:35,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:39:35,295 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:39:35,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-09 01:39:35,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:35,760 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 01:39:35,764 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:39:36,485 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 11 treesize of output 9 [2024-11-09 01:39:36,585 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:39:36,586 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:39:36,586 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:39:36,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1210556251] [2024-11-09 01:39:36,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1210556251] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:39:36,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:39:36,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 01:39:36,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013474648] [2024-11-09 01:39:36,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:39:36,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 01:39:36,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:39:36,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 01:39:36,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:39:36,588 INFO L87 Difference]: Start difference. First operand 408 states and 575 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:39:37,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:39:37,352 INFO L93 Difference]: Finished difference Result 924 states and 1294 transitions. [2024-11-09 01:39:37,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:39:37,353 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 119 [2024-11-09 01:39:37,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:39:37,357 INFO L225 Difference]: With dead ends: 924 [2024-11-09 01:39:37,359 INFO L226 Difference]: Without dead ends: 519 [2024-11-09 01:39:37,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-11-09 01:39:37,360 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 396 mSDsluCounter, 1009 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 1240 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 01:39:37,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 1240 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 01:39:37,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2024-11-09 01:39:37,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 508. [2024-11-09 01:39:37,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 451 states have (on average 1.3547671840354767) internal successors, (611), 454 states have internal predecessors, (611), 50 states have call successors, (50), 6 states have call predecessors, (50), 6 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-09 01:39:37,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 711 transitions. [2024-11-09 01:39:37,391 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 711 transitions. Word has length 119 [2024-11-09 01:39:37,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:39:37,392 INFO L471 AbstractCegarLoop]: Abstraction has 508 states and 711 transitions. [2024-11-09 01:39:37,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:39:37,392 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 711 transitions. [2024-11-09 01:39:37,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-09 01:39:37,393 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:39:37,394 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:39:37,413 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-09 01:39:37,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:39:37,594 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:39:37,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:39:37,595 INFO L85 PathProgramCache]: Analyzing trace with hash 829300942, now seen corresponding path program 1 times [2024-11-09 01:39:37,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:39:37,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [958088284] [2024-11-09 01:39:37,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:39:37,595 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:39:37,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:39:37,597 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:39:37,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-09 01:39:38,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:39:38,018 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 01:39:38,021 INFO L278 TraceCheckSpWp]: Computing forward predicates...