./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-18.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc 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-18.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 e68bf11432a02c4ee2bd8f03ee2807d4845705e500d61756e972fae2c63173ed --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:42:48,681 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:42:48,760 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 00:42:48,767 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:42:48,768 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:42:48,797 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:42:48,798 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:42:48,798 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:42:48,799 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:42:48,799 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:42:48,800 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:42:48,800 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:42:48,801 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:42:48,803 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:42:48,804 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:42:48,804 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:42:48,804 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:42:48,805 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:42:48,805 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 00:42:48,805 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:42:48,805 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:42:48,809 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:42:48,810 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:42:48,810 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:42:48,810 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:42:48,810 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:42:48,811 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:42:48,811 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:42:48,811 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:42:48,811 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:42:48,812 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:42:48,812 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:42:48,812 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:42:48,812 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:42:48,813 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:42:48,813 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:42:48,813 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 00:42:48,813 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 00:42:48,814 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:42:48,814 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:42:48,814 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:42:48,815 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:42:48,815 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 -> e68bf11432a02c4ee2bd8f03ee2807d4845705e500d61756e972fae2c63173ed [2024-11-19 00:42:49,054 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:42:49,080 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:42:49,084 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:42:49,085 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:42:49,086 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:42:49,087 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-18.i [2024-11-19 00:42:50,486 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:42:50,681 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:42:50,684 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-18.i [2024-11-19 00:42:50,698 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d4b08922/74d70e42a388419ca06733b7964281eb/FLAG07d0a4381 [2024-11-19 00:42:50,710 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d4b08922/74d70e42a388419ca06733b7964281eb [2024-11-19 00:42:50,712 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:42:50,713 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:42:50,715 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:42:50,715 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:42:50,719 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:42:50,720 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:42:50" (1/1) ... [2024-11-19 00:42:50,721 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e56a33d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:42:50, skipping insertion in model container [2024-11-19 00:42:50,721 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:42:50" (1/1) ... [2024-11-19 00:42:50,755 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:42:50,915 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-18.i[917,930] [2024-11-19 00:42:50,969 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:42:50,984 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:42:50,998 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-18.i[917,930] [2024-11-19 00:42:51,037 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:42:51,086 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:42:51,090 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:42:51 WrapperNode [2024-11-19 00:42:51,090 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:42:51,092 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:42:51,092 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:42:51,092 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:42:51,103 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:42:51" (1/1) ... [2024-11-19 00:42:51,125 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:42:51" (1/1) ... [2024-11-19 00:42:51,184 INFO L138 Inliner]: procedures = 29, calls = 143, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 491 [2024-11-19 00:42:51,185 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:42:51,185 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:42:51,185 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:42:51,186 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:42:51,199 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:42:51" (1/1) ... [2024-11-19 00:42:51,200 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:42:51" (1/1) ... [2024-11-19 00:42:51,207 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:42:51" (1/1) ... [2024-11-19 00:42:51,232 INFO L175 MemorySlicer]: Split 115 memory accesses to 6 slices as follows [2, 6, 29, 22, 46, 10]. 40 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 3, 2, 3, 1]. The 13 writes are split as follows [0, 1, 4, 2, 4, 2]. [2024-11-19 00:42:51,233 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:42:51" (1/1) ... [2024-11-19 00:42:51,233 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:42:51" (1/1) ... [2024-11-19 00:42:51,249 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:42:51" (1/1) ... [2024-11-19 00:42:51,254 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:42:51" (1/1) ... [2024-11-19 00:42:51,261 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:42:51" (1/1) ... [2024-11-19 00:42:51,267 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:42:51" (1/1) ... [2024-11-19 00:42:51,278 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:42:51,279 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:42:51,280 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:42:51,280 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:42:51,280 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:42:51" (1/1) ... [2024-11-19 00:42:51,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:42:51,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:42:51,316 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-19 00:42:51,319 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-19 00:42:51,368 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:42:51,369 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-19 00:42:51,369 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-19 00:42:51,370 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-19 00:42:51,370 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-19 00:42:51,370 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-19 00:42:51,370 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-19 00:42:51,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 00:42:51,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 00:42:51,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 00:42:51,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-19 00:42:51,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-19 00:42:51,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-19 00:42:51,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-19 00:42:51,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-19 00:42:51,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-19 00:42:51,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-19 00:42:51,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-19 00:42:51,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-19 00:42:51,373 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 00:42:51,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 00:42:51,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 00:42:51,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-19 00:42:51,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-19 00:42:51,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-19 00:42:51,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-19 00:42:51,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-19 00:42:51,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-19 00:42:51,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-19 00:42:51,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-19 00:42:51,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-19 00:42:51,377 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:42:51,377 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:42:51,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 00:42:51,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 00:42:51,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 00:42:51,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-19 00:42:51,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-19 00:42:51,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-19 00:42:51,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:42:51,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:42:51,545 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:42:51,547 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:42:52,139 INFO L? ?]: Removed 145 outVars from TransFormulas that were not future-live. [2024-11-19 00:42:52,139 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:42:52,153 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:42:52,153 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:42:52,154 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:42:52 BoogieIcfgContainer [2024-11-19 00:42:52,154 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:42:52,155 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:42:52,155 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:42:52,158 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:42:52,159 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:42:50" (1/3) ... [2024-11-19 00:42:52,159 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f54ef2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:42:52, skipping insertion in model container [2024-11-19 00:42:52,159 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:42:51" (2/3) ... [2024-11-19 00:42:52,160 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f54ef2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:42:52, skipping insertion in model container [2024-11-19 00:42:52,160 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:42:52" (3/3) ... [2024-11-19 00:42:52,161 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-18.i [2024-11-19 00:42:52,175 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:42:52,175 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:42:52,241 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:42:52,250 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;@44d7f13f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:42:52,250 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:42:52,254 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 93 states have (on average 1.4623655913978495) internal successors, (136), 94 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-19 00:42:52,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-19 00:42:52,265 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:42:52,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] [2024-11-19 00:42:52,267 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:42:52,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:42:52,273 INFO L85 PathProgramCache]: Analyzing trace with hash 2059805146, now seen corresponding path program 1 times [2024-11-19 00:42:52,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:42:52,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065625848] [2024-11-19 00:42:52,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:42:52,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:42:52,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:42:52,659 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2024-11-19 00:42:52,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:42:52,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065625848] [2024-11-19 00:42:52,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065625848] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:42:52,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716750995] [2024-11-19 00:42:52,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:42:52,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:42:52,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:42:52,664 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:42:52,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 00:42:52,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:42:52,977 INFO L255 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:42:52,985 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:42:53,010 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2024-11-19 00:42:53,012 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:42:53,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716750995] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:42:53,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:42:53,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-19 00:42:53,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193079146] [2024-11-19 00:42:53,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:42:53,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:42:53,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:42:53,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:42:53,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:42:53,050 INFO L87 Difference]: Start difference. First operand has 108 states, 93 states have (on average 1.4623655913978495) internal successors, (136), 94 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) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (12), 2 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-19 00:42:53,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:42:53,088 INFO L93 Difference]: Finished difference Result 209 states and 326 transitions. [2024-11-19 00:42:53,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:42:53,091 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (12), 2 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 107 [2024-11-19 00:42:53,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:42:53,100 INFO L225 Difference]: With dead ends: 209 [2024-11-19 00:42:53,100 INFO L226 Difference]: Without dead ends: 104 [2024-11-19 00:42:53,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 108 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-19 00:42:53,109 INFO L432 NwaCegarLoop]: 153 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, 153 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-19 00:42:53,110 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:42:53,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-19 00:42:53,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-19 00:42:53,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 90 states have (on average 1.4333333333333333) internal successors, (129), 90 states have internal predecessors, (129), 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-19 00:42:53,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 153 transitions. [2024-11-19 00:42:53,161 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 153 transitions. Word has length 107 [2024-11-19 00:42:53,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:42:53,164 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 153 transitions. [2024-11-19 00:42:53,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (12), 2 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-19 00:42:53,165 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 153 transitions. [2024-11-19 00:42:53,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-19 00:42:53,168 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:42:53,169 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] [2024-11-19 00:42:53,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-19 00:42:53,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-19 00:42:53,370 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:42:53,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:42:53,371 INFO L85 PathProgramCache]: Analyzing trace with hash -528351354, now seen corresponding path program 1 times [2024-11-19 00:42:53,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:42:53,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837007559] [2024-11-19 00:42:53,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:42:53,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:42:53,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:42:53,659 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-19 00:42:53,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:42:53,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837007559] [2024-11-19 00:42:53,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837007559] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:42:53,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:42:53,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:42:53,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551204799] [2024-11-19 00:42:53,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:42:53,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:42:53,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:42:53,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:42:53,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:42:53,664 INFO L87 Difference]: Start difference. First operand 104 states and 153 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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-19 00:42:53,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:42:53,718 INFO L93 Difference]: Finished difference Result 207 states and 306 transitions. [2024-11-19 00:42:53,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:42:53,720 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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 107 [2024-11-19 00:42:53,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:42:53,722 INFO L225 Difference]: With dead ends: 207 [2024-11-19 00:42:53,723 INFO L226 Difference]: Without dead ends: 106 [2024-11-19 00:42:53,725 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-19 00:42:53,726 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 442 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-19 00:42:53,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 442 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:42:53,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-19 00:42:53,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-19 00:42:53,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 92 states have (on average 1.423913043478261) internal successors, (131), 92 states have internal predecessors, (131), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 00:42:53,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 155 transitions. [2024-11-19 00:42:53,747 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 155 transitions. Word has length 107 [2024-11-19 00:42:53,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:42:53,749 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 155 transitions. [2024-11-19 00:42:53,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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-19 00:42:53,750 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 155 transitions. [2024-11-19 00:42:53,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-19 00:42:53,752 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:42:53,753 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] [2024-11-19 00:42:53,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 00:42:53,753 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:42:53,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:42:53,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1889552712, now seen corresponding path program 1 times [2024-11-19 00:42:53,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:42:53,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240500787] [2024-11-19 00:42:53,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:42:53,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:42:53,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:42:54,491 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-19 00:42:54,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:42:54,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240500787] [2024-11-19 00:42:54,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240500787] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:42:54,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:42:54,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:42:54,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156622879] [2024-11-19 00:42:54,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:42:54,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:42:54,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:42:54,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:42:54,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:42:54,496 INFO L87 Difference]: Start difference. First operand 106 states and 155 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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-19 00:42:54,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:42:54,611 INFO L93 Difference]: Finished difference Result 210 states and 309 transitions. [2024-11-19 00:42:54,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:42:54,612 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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 107 [2024-11-19 00:42:54,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:42:54,615 INFO L225 Difference]: With dead ends: 210 [2024-11-19 00:42:54,617 INFO L226 Difference]: Without dead ends: 107 [2024-11-19 00:42:54,618 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:42:54,619 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 5 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:42:54,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 523 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:42:54,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-19 00:42:54,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-11-19 00:42:54,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 93 states have (on average 1.4193548387096775) internal successors, (132), 93 states have internal predecessors, (132), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 00:42:54,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 156 transitions. [2024-11-19 00:42:54,637 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 156 transitions. Word has length 107 [2024-11-19 00:42:54,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:42:54,638 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 156 transitions. [2024-11-19 00:42:54,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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-19 00:42:54,638 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 156 transitions. [2024-11-19 00:42:54,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-19 00:42:54,640 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:42:54,640 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] [2024-11-19 00:42:54,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 00:42:54,643 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:42:54,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:42:54,644 INFO L85 PathProgramCache]: Analyzing trace with hash 301204810, now seen corresponding path program 1 times [2024-11-19 00:42:54,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:42:54,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128224526] [2024-11-19 00:42:54,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:42:54,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:42:54,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:42:55,122 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-19 00:42:55,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:42:55,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128224526] [2024-11-19 00:42:55,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128224526] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:42:55,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:42:55,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:42:55,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009164665] [2024-11-19 00:42:55,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:42:55,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:42:55,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:42:55,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:42:55,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:42:55,125 INFO L87 Difference]: Start difference. First operand 107 states and 156 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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-19 00:42:55,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:42:55,358 INFO L93 Difference]: Finished difference Result 287 states and 418 transitions. [2024-11-19 00:42:55,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:42:55,359 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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 107 [2024-11-19 00:42:55,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:42:55,361 INFO L225 Difference]: With dead ends: 287 [2024-11-19 00:42:55,361 INFO L226 Difference]: Without dead ends: 183 [2024-11-19 00:42:55,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:42:55,362 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 109 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:42:55,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 706 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:42:55,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-19 00:42:55,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 180. [2024-11-19 00:42:55,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 157 states have (on average 1.414012738853503) internal successors, (222), 158 states have internal predecessors, (222), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-19 00:42:55,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 262 transitions. [2024-11-19 00:42:55,375 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 262 transitions. Word has length 107 [2024-11-19 00:42:55,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:42:55,375 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 262 transitions. [2024-11-19 00:42:55,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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-19 00:42:55,376 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 262 transitions. [2024-11-19 00:42:55,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-19 00:42:55,377 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:42:55,377 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] [2024-11-19 00:42:55,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 00:42:55,378 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:42:55,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:42:55,378 INFO L85 PathProgramCache]: Analyzing trace with hash 559370248, now seen corresponding path program 1 times [2024-11-19 00:42:55,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:42:55,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803899657] [2024-11-19 00:42:55,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:42:55,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:42:55,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:42:55,966 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-19 00:42:55,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:42:55,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803899657] [2024-11-19 00:42:55,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803899657] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:42:55,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:42:55,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:42:55,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289672100] [2024-11-19 00:42:55,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:42:55,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:42:55,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:42:55,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:42:55,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:42:55,969 INFO L87 Difference]: Start difference. First operand 180 states and 262 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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-19 00:42:56,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:42:56,203 INFO L93 Difference]: Finished difference Result 461 states and 674 transitions. [2024-11-19 00:42:56,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:42:56,204 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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 107 [2024-11-19 00:42:56,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:42:56,207 INFO L225 Difference]: With dead ends: 461 [2024-11-19 00:42:56,207 INFO L226 Difference]: Without dead ends: 284 [2024-11-19 00:42:56,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:42:56,208 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 222 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:42:56,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 445 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:42:56,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-11-19 00:42:56,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 278. [2024-11-19 00:42:56,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 242 states have (on average 1.4173553719008265) internal successors, (343), 243 states have internal predecessors, (343), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-19 00:42:56,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 407 transitions. [2024-11-19 00:42:56,228 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 407 transitions. Word has length 107 [2024-11-19 00:42:56,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:42:56,228 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 407 transitions. [2024-11-19 00:42:56,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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-19 00:42:56,228 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 407 transitions. [2024-11-19 00:42:56,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-19 00:42:56,229 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:42:56,230 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] [2024-11-19 00:42:56,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 00:42:56,230 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:42:56,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:42:56,231 INFO L85 PathProgramCache]: Analyzing trace with hash 724231687, now seen corresponding path program 1 times [2024-11-19 00:42:56,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:42:56,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423958655] [2024-11-19 00:42:56,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:42:56,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:42:56,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:42:56,887 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-19 00:42:56,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:42:56,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423958655] [2024-11-19 00:42:56,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423958655] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:42:56,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:42:56,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 00:42:56,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007843407] [2024-11-19 00:42:56,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:42:56,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 00:42:56,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:42:56,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 00:42:56,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:42:56,890 INFO L87 Difference]: Start difference. First operand 278 states and 407 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 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-19 00:42:57,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:42:57,787 INFO L93 Difference]: Finished difference Result 1230 states and 1775 transitions. [2024-11-19 00:42:57,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 00:42:57,789 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 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 108 [2024-11-19 00:42:57,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:42:57,796 INFO L225 Difference]: With dead ends: 1230 [2024-11-19 00:42:57,796 INFO L226 Difference]: Without dead ends: 955 [2024-11-19 00:42:57,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2024-11-19 00:42:57,799 INFO L432 NwaCegarLoop]: 246 mSDtfsCounter, 568 mSDsluCounter, 944 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 1190 SdHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 00:42:57,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 1190 Invalid, 652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 00:42:57,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2024-11-19 00:42:57,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 800. [2024-11-19 00:42:57,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 699 states have (on average 1.4091559370529327) internal successors, (985), 706 states have internal predecessors, (985), 84 states have call successors, (84), 16 states have call predecessors, (84), 16 states have return successors, (84), 77 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-19 00:42:57,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1153 transitions. [2024-11-19 00:42:57,863 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1153 transitions. Word has length 108 [2024-11-19 00:42:57,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:42:57,865 INFO L471 AbstractCegarLoop]: Abstraction has 800 states and 1153 transitions. [2024-11-19 00:42:57,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 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-19 00:42:57,866 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1153 transitions. [2024-11-19 00:42:57,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-19 00:42:57,867 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:42:57,868 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] [2024-11-19 00:42:57,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 00:42:57,868 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:42:57,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:42:57,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1269913019, now seen corresponding path program 1 times [2024-11-19 00:42:57,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:42:57,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37730822] [2024-11-19 00:42:57,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:42:57,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:42:57,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:42:58,232 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-19 00:42:58,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:42:58,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37730822] [2024-11-19 00:42:58,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37730822] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:42:58,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:42:58,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:42:58,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768541568] [2024-11-19 00:42:58,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:42:58,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:42:58,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:42:58,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:42:58,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:42:58,234 INFO L87 Difference]: Start difference. First operand 800 states and 1153 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 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-19 00:42:58,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:42:58,491 INFO L93 Difference]: Finished difference Result 1616 states and 2317 transitions. [2024-11-19 00:42:58,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 00:42:58,492 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 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 108 [2024-11-19 00:42:58,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:42:58,498 INFO L225 Difference]: With dead ends: 1616 [2024-11-19 00:42:58,499 INFO L226 Difference]: Without dead ends: 819 [2024-11-19 00:42:58,501 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:42:58,501 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 132 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:42:58,502 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 704 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:42:58,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2024-11-19 00:42:58,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 585. [2024-11-19 00:42:58,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 510 states have (on average 1.3980392156862744) internal successors, (713), 514 states have internal predecessors, (713), 60 states have call successors, (60), 14 states have call predecessors, (60), 14 states have return successors, (60), 56 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-19 00:42:58,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 833 transitions. [2024-11-19 00:42:58,576 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 833 transitions. Word has length 108 [2024-11-19 00:42:58,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:42:58,577 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 833 transitions. [2024-11-19 00:42:58,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 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-19 00:42:58,577 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 833 transitions. [2024-11-19 00:42:58,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-19 00:42:58,580 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:42:58,580 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] [2024-11-19 00:42:58,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 00:42:58,581 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:42:58,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:42:58,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1532353785, now seen corresponding path program 1 times [2024-11-19 00:42:58,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:42:58,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826546949] [2024-11-19 00:42:58,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:42:58,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:42:58,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:42:59,495 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 18 proven. 15 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-19 00:42:59,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:42:59,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826546949] [2024-11-19 00:42:59,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826546949] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:42:59,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973933273] [2024-11-19 00:42:59,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:42:59,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:42:59,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:42:59,499 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:42:59,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 00:42:59,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:42:59,714 INFO L255 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-19 00:42:59,722 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:43:00,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 00:43:00,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 00:43:00,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-19 00:43:00,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-11-19 00:43:00,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-19 00:43:00,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-19 00:43:00,652 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 24 proven. 140 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-19 00:43:00,652 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:43:01,210 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 38 treesize of output 34 [2024-11-19 00:43:01,368 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 18 proven. 15 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-19 00:43:01,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [973933273] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 00:43:01,368 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 00:43:01,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 33 [2024-11-19 00:43:01,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356011089] [2024-11-19 00:43:01,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 00:43:01,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-19 00:43:01,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:43:01,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-19 00:43:01,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=931, Unknown=0, NotChecked=0, Total=1056 [2024-11-19 00:43:01,371 INFO L87 Difference]: Start difference. First operand 585 states and 833 transitions. Second operand has 33 states, 30 states have (on average 3.933333333333333) internal successors, (118), 30 states have internal predecessors, (118), 7 states have call successors, (36), 4 states have call predecessors, (36), 6 states have return successors, (36), 6 states have call predecessors, (36), 7 states have call successors, (36) [2024-11-19 00:43:03,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:43:03,867 INFO L93 Difference]: Finished difference Result 1509 states and 2128 transitions. [2024-11-19 00:43:03,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-11-19 00:43:03,869 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 3.933333333333333) internal successors, (118), 30 states have internal predecessors, (118), 7 states have call successors, (36), 4 states have call predecessors, (36), 6 states have return successors, (36), 6 states have call predecessors, (36), 7 states have call successors, (36) Word has length 108 [2024-11-19 00:43:03,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:43:03,876 INFO L225 Difference]: With dead ends: 1509 [2024-11-19 00:43:03,876 INFO L226 Difference]: Without dead ends: 927 [2024-11-19 00:43:03,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 911 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=815, Invalid=3741, Unknown=0, NotChecked=0, Total=4556 [2024-11-19 00:43:03,879 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 504 mSDsluCounter, 2428 mSDsCounter, 0 mSdLazyCounter, 1609 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 2616 SdHoareTripleChecker+Invalid, 1713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 1609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:43:03,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 2616 Invalid, 1713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 1609 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-19 00:43:03,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2024-11-19 00:43:03,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 851. [2024-11-19 00:43:03,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 851 states, 746 states have (on average 1.3699731903485255) internal successors, (1022), 750 states have internal predecessors, (1022), 80 states have call successors, (80), 24 states have call predecessors, (80), 24 states have return successors, (80), 76 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-19 00:43:03,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1182 transitions. [2024-11-19 00:43:03,956 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1182 transitions. Word has length 108 [2024-11-19 00:43:03,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:43:03,956 INFO L471 AbstractCegarLoop]: Abstraction has 851 states and 1182 transitions. [2024-11-19 00:43:03,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 3.933333333333333) internal successors, (118), 30 states have internal predecessors, (118), 7 states have call successors, (36), 4 states have call predecessors, (36), 6 states have return successors, (36), 6 states have call predecessors, (36), 7 states have call successors, (36) [2024-11-19 00:43:03,957 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1182 transitions. [2024-11-19 00:43:03,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-19 00:43:03,958 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:43:03,959 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] [2024-11-19 00:43:03,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-19 00:43:04,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-19 00:43:04,163 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:43:04,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:43:04,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1402162163, now seen corresponding path program 1 times [2024-11-19 00:43:04,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:43:04,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089784571] [2024-11-19 00:43:04,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:43:04,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:43:04,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:43:04,487 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-19 00:43:04,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:43:04,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089784571] [2024-11-19 00:43:04,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089784571] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:43:04,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:43:04,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 00:43:04,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621677482] [2024-11-19 00:43:04,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:43:04,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 00:43:04,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:43:04,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 00:43:04,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:43:04,490 INFO L87 Difference]: Start difference. First operand 851 states and 1182 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 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-19 00:43:04,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:43:04,755 INFO L93 Difference]: Finished difference Result 1699 states and 2360 transitions. [2024-11-19 00:43:04,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:43:04,755 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 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 110 [2024-11-19 00:43:04,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:43:04,760 INFO L225 Difference]: With dead ends: 1699 [2024-11-19 00:43:04,760 INFO L226 Difference]: Without dead ends: 851 [2024-11-19 00:43:04,762 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-19 00:43:04,764 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 150 mSDsluCounter, 977 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 1181 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:43:04,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 1181 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:43:04,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2024-11-19 00:43:04,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 849. [2024-11-19 00:43:04,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 849 states, 744 states have (on average 1.3521505376344085) internal successors, (1006), 748 states have internal predecessors, (1006), 80 states have call successors, (80), 24 states have call predecessors, (80), 24 states have return successors, (80), 76 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-19 00:43:04,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1166 transitions. [2024-11-19 00:43:04,825 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1166 transitions. Word has length 110 [2024-11-19 00:43:04,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:43:04,826 INFO L471 AbstractCegarLoop]: Abstraction has 849 states and 1166 transitions. [2024-11-19 00:43:04,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 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-19 00:43:04,826 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1166 transitions. [2024-11-19 00:43:04,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-19 00:43:04,828 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:43:04,828 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] [2024-11-19 00:43:04,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 00:43:04,828 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:43:04,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:43:04,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1221526159, now seen corresponding path program 1 times [2024-11-19 00:43:04,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:43:04,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888384950] [2024-11-19 00:43:04,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:43:04,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:43:04,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:43:05,280 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-19 00:43:05,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:43:05,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888384950] [2024-11-19 00:43:05,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888384950] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:43:05,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:43:05,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 00:43:05,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450665094] [2024-11-19 00:43:05,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:43:05,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 00:43:05,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:43:05,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 00:43:05,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:43:05,284 INFO L87 Difference]: Start difference. First operand 849 states and 1166 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 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-19 00:43:05,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:43:05,752 INFO L93 Difference]: Finished difference Result 1379 states and 1881 transitions. [2024-11-19 00:43:05,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 00:43:05,753 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 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 111 [2024-11-19 00:43:05,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:43:05,758 INFO L225 Difference]: With dead ends: 1379 [2024-11-19 00:43:05,758 INFO L226 Difference]: Without dead ends: 940 [2024-11-19 00:43:05,759 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-19 00:43:05,759 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 295 mSDsluCounter, 870 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 1041 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:43:05,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 1041 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:43:05,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2024-11-19 00:43:05,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 852. [2024-11-19 00:43:05,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 852 states, 747 states have (on average 1.3453815261044177) internal successors, (1005), 751 states have internal predecessors, (1005), 80 states have call successors, (80), 24 states have call predecessors, (80), 24 states have return successors, (80), 76 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-19 00:43:05,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1165 transitions. [2024-11-19 00:43:05,821 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1165 transitions. Word has length 111 [2024-11-19 00:43:05,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:43:05,823 INFO L471 AbstractCegarLoop]: Abstraction has 852 states and 1165 transitions. [2024-11-19 00:43:05,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 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-19 00:43:05,823 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1165 transitions. [2024-11-19 00:43:05,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-19 00:43:05,825 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:43:05,825 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] [2024-11-19 00:43:05,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 00:43:05,825 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:43:05,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:43:05,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1897731394, now seen corresponding path program 1 times [2024-11-19 00:43:05,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:43:05,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746284493] [2024-11-19 00:43:05,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:43:05,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:43:05,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:43:05,985 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-19 00:43:05,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:43:05,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746284493] [2024-11-19 00:43:05,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746284493] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:43:05,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33454785] [2024-11-19 00:43:05,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:43:05,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:43:05,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:43:05,988 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:43:06,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 00:43:06,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:43:06,204 INFO L255 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 00:43:06,212 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:43:06,239 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-19 00:43:06,240 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:43:06,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [33454785] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:43:06,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:43:06,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2024-11-19 00:43:06,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734806897] [2024-11-19 00:43:06,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:43:06,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:43:06,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:43:06,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:43:06,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:43:06,242 INFO L87 Difference]: Start difference. First operand 852 states and 1165 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (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-19 00:43:06,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:43:06,313 INFO L93 Difference]: Finished difference Result 1725 states and 2359 transitions. [2024-11-19 00:43:06,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:43:06,314 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (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 111 [2024-11-19 00:43:06,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:43:06,318 INFO L225 Difference]: With dead ends: 1725 [2024-11-19 00:43:06,318 INFO L226 Difference]: Without dead ends: 876 [2024-11-19 00:43:06,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:43:06,322 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:43:06,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 573 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:43:06,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2024-11-19 00:43:06,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 876. [2024-11-19 00:43:06,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 876 states, 771 states have (on average 1.3346303501945525) internal successors, (1029), 775 states have internal predecessors, (1029), 80 states have call successors, (80), 24 states have call predecessors, (80), 24 states have return successors, (80), 76 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-19 00:43:06,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1189 transitions. [2024-11-19 00:43:06,381 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1189 transitions. Word has length 111 [2024-11-19 00:43:06,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:43:06,381 INFO L471 AbstractCegarLoop]: Abstraction has 876 states and 1189 transitions. [2024-11-19 00:43:06,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (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-19 00:43:06,381 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1189 transitions. [2024-11-19 00:43:06,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-19 00:43:06,383 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:43:06,384 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] [2024-11-19 00:43:06,403 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 00:43:06,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:43:06,585 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:43:06,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:43:06,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1867335442, now seen corresponding path program 1 times [2024-11-19 00:43:06,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:43:06,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335749089] [2024-11-19 00:43:06,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:43:06,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:43:06,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:43:06,832 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-19 00:43:06,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:43:06,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335749089] [2024-11-19 00:43:06,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335749089] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:43:06,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:43:06,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 00:43:06,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578303358] [2024-11-19 00:43:06,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:43:06,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 00:43:06,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:43:06,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 00:43:06,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:43:06,834 INFO L87 Difference]: Start difference. First operand 876 states and 1189 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 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-19 00:43:07,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:43:07,089 INFO L93 Difference]: Finished difference Result 1769 states and 2403 transitions. [2024-11-19 00:43:07,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:43:07,090 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 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 111 [2024-11-19 00:43:07,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:43:07,095 INFO L225 Difference]: With dead ends: 1769 [2024-11-19 00:43:07,095 INFO L226 Difference]: Without dead ends: 896 [2024-11-19 00:43:07,097 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:43:07,098 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 245 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:43:07,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 832 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:43:07,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2024-11-19 00:43:07,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 890. [2024-11-19 00:43:07,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 890 states, 785 states have (on average 1.3286624203821655) internal successors, (1043), 789 states have internal predecessors, (1043), 80 states have call successors, (80), 24 states have call predecessors, (80), 24 states have return successors, (80), 76 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-19 00:43:07,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1203 transitions. [2024-11-19 00:43:07,177 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1203 transitions. Word has length 111 [2024-11-19 00:43:07,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:43:07,177 INFO L471 AbstractCegarLoop]: Abstraction has 890 states and 1203 transitions. [2024-11-19 00:43:07,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 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-19 00:43:07,178 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1203 transitions. [2024-11-19 00:43:07,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-19 00:43:07,179 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:43:07,179 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] [2024-11-19 00:43:07,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 00:43:07,180 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:43:07,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:43:07,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1565691096, now seen corresponding path program 1 times [2024-11-19 00:43:07,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:43:07,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819869335] [2024-11-19 00:43:07,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:43:07,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:43:07,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:43:07,683 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-19 00:43:07,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:43:07,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819869335] [2024-11-19 00:43:07,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819869335] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:43:07,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:43:07,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 00:43:07,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461231724] [2024-11-19 00:43:07,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:43:07,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 00:43:07,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:43:07,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 00:43:07,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:43:07,685 INFO L87 Difference]: Start difference. First operand 890 states and 1203 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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-19 00:43:08,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:43:08,380 INFO L93 Difference]: Finished difference Result 1916 states and 2590 transitions. [2024-11-19 00:43:08,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 00:43:08,381 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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 112 [2024-11-19 00:43:08,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:43:08,387 INFO L225 Difference]: With dead ends: 1916 [2024-11-19 00:43:08,388 INFO L226 Difference]: Without dead ends: 1467 [2024-11-19 00:43:08,389 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2024-11-19 00:43:08,390 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 404 mSDsluCounter, 1084 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 1309 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 00:43:08,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 1309 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 00:43:08,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states. [2024-11-19 00:43:08,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 1260. [2024-11-19 00:43:08,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1260 states, 1135 states have (on average 1.3409691629955947) internal successors, (1522), 1143 states have internal predecessors, (1522), 96 states have call successors, (96), 28 states have call predecessors, (96), 28 states have return successors, (96), 88 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-19 00:43:08,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1260 states to 1260 states and 1714 transitions. [2024-11-19 00:43:08,472 INFO L78 Accepts]: Start accepts. Automaton has 1260 states and 1714 transitions. Word has length 112 [2024-11-19 00:43:08,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:43:08,474 INFO L471 AbstractCegarLoop]: Abstraction has 1260 states and 1714 transitions. [2024-11-19 00:43:08,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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-19 00:43:08,474 INFO L276 IsEmpty]: Start isEmpty. Operand 1260 states and 1714 transitions. [2024-11-19 00:43:08,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-19 00:43:08,478 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:43:08,478 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] [2024-11-19 00:43:08,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 00:43:08,478 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:43:08,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:43:08,479 INFO L85 PathProgramCache]: Analyzing trace with hash -222667446, now seen corresponding path program 1 times [2024-11-19 00:43:08,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:43:08,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822207572] [2024-11-19 00:43:08,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:43:08,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:43:08,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:43:08,944 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-19 00:43:08,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:43:08,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822207572] [2024-11-19 00:43:08,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822207572] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:43:08,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:43:08,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 00:43:08,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416421020] [2024-11-19 00:43:08,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:43:08,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 00:43:08,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:43:08,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 00:43:08,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:43:08,949 INFO L87 Difference]: Start difference. First operand 1260 states and 1714 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 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-19 00:43:09,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:43:09,499 INFO L93 Difference]: Finished difference Result 1812 states and 2459 transitions. [2024-11-19 00:43:09,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 00:43:09,500 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 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 112 [2024-11-19 00:43:09,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:43:09,507 INFO L225 Difference]: With dead ends: 1812 [2024-11-19 00:43:09,507 INFO L226 Difference]: Without dead ends: 1470 [2024-11-19 00:43:09,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2024-11-19 00:43:09,510 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 234 mSDsluCounter, 906 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 1132 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 00:43:09,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 1132 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 00:43:09,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1470 states. [2024-11-19 00:43:09,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1470 to 1268. [2024-11-19 00:43:09,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1268 states, 1143 states have (on average 1.3403324584426948) internal successors, (1532), 1151 states have internal predecessors, (1532), 96 states have call successors, (96), 28 states have call predecessors, (96), 28 states have return successors, (96), 88 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-19 00:43:09,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1268 states to 1268 states and 1724 transitions. [2024-11-19 00:43:09,590 INFO L78 Accepts]: Start accepts. Automaton has 1268 states and 1724 transitions. Word has length 112 [2024-11-19 00:43:09,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:43:09,591 INFO L471 AbstractCegarLoop]: Abstraction has 1268 states and 1724 transitions. [2024-11-19 00:43:09,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 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-19 00:43:09,591 INFO L276 IsEmpty]: Start isEmpty. Operand 1268 states and 1724 transitions. [2024-11-19 00:43:09,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-19 00:43:09,593 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:43:09,593 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] [2024-11-19 00:43:09,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 00:43:09,593 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:43:09,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:43:09,594 INFO L85 PathProgramCache]: Analyzing trace with hash 960739243, now seen corresponding path program 1 times [2024-11-19 00:43:09,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:43:09,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032515914] [2024-11-19 00:43:09,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:43:09,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:43:09,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:43:09,820 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-19 00:43:09,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:43:09,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032515914] [2024-11-19 00:43:09,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032515914] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:43:09,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:43:09,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:43:09,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080031499] [2024-11-19 00:43:09,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:43:09,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:43:09,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:43:09,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:43:09,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:43:09,824 INFO L87 Difference]: Start difference. First operand 1268 states and 1724 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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-19 00:43:10,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:43:10,006 INFO L93 Difference]: Finished difference Result 2517 states and 3416 transitions. [2024-11-19 00:43:10,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:43:10,007 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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 113 [2024-11-19 00:43:10,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:43:10,013 INFO L225 Difference]: With dead ends: 2517 [2024-11-19 00:43:10,014 INFO L226 Difference]: Without dead ends: 1252 [2024-11-19 00:43:10,018 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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-19 00:43:10,019 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 142 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 856 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-19 00:43:10,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 856 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:43:10,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2024-11-19 00:43:10,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 1240. [2024-11-19 00:43:10,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1240 states, 1115 states have (on average 1.3291479820627803) internal successors, (1482), 1123 states have internal predecessors, (1482), 96 states have call successors, (96), 28 states have call predecessors, (96), 28 states have return successors, (96), 88 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-19 00:43:10,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1240 states to 1240 states and 1674 transitions. [2024-11-19 00:43:10,097 INFO L78 Accepts]: Start accepts. Automaton has 1240 states and 1674 transitions. Word has length 113 [2024-11-19 00:43:10,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:43:10,098 INFO L471 AbstractCegarLoop]: Abstraction has 1240 states and 1674 transitions. [2024-11-19 00:43:10,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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-19 00:43:10,098 INFO L276 IsEmpty]: Start isEmpty. Operand 1240 states and 1674 transitions. [2024-11-19 00:43:10,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-19 00:43:10,100 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:43:10,100 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] [2024-11-19 00:43:10,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 00:43:10,100 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:43:10,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:43:10,101 INFO L85 PathProgramCache]: Analyzing trace with hash 133419348, now seen corresponding path program 1 times [2024-11-19 00:43:10,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:43:10,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644951551] [2024-11-19 00:43:10,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:43:10,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:43:10,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:43:10,303 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-19 00:43:10,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:43:10,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644951551] [2024-11-19 00:43:10,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644951551] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:43:10,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:43:10,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:43:10,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114974162] [2024-11-19 00:43:10,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:43:10,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:43:10,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:43:10,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:43:10,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:43:10,306 INFO L87 Difference]: Start difference. First operand 1240 states and 1674 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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-19 00:43:10,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:43:10,573 INFO L93 Difference]: Finished difference Result 2058 states and 2773 transitions. [2024-11-19 00:43:10,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:43:10,574 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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 113 [2024-11-19 00:43:10,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:43:10,581 INFO L225 Difference]: With dead ends: 2058 [2024-11-19 00:43:10,581 INFO L226 Difference]: Without dead ends: 1400 [2024-11-19 00:43:10,583 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:43:10,583 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 112 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:43:10,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 616 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:43:10,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2024-11-19 00:43:10,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 1240. [2024-11-19 00:43:10,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1240 states, 1115 states have (on average 1.325560538116592) internal successors, (1478), 1123 states have internal predecessors, (1478), 96 states have call successors, (96), 28 states have call predecessors, (96), 28 states have return successors, (96), 88 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-19 00:43:10,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1240 states to 1240 states and 1670 transitions. [2024-11-19 00:43:10,692 INFO L78 Accepts]: Start accepts. Automaton has 1240 states and 1670 transitions. Word has length 113 [2024-11-19 00:43:10,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:43:10,693 INFO L471 AbstractCegarLoop]: Abstraction has 1240 states and 1670 transitions. [2024-11-19 00:43:10,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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-19 00:43:10,693 INFO L276 IsEmpty]: Start isEmpty. Operand 1240 states and 1670 transitions. [2024-11-19 00:43:10,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-19 00:43:10,695 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:43:10,695 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] [2024-11-19 00:43:10,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 00:43:10,695 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:43:10,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:43:10,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1373369687, now seen corresponding path program 1 times [2024-11-19 00:43:10,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:43:10,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951510236] [2024-11-19 00:43:10,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:43:10,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:43:10,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:43:10,846 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-19 00:43:10,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:43:10,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951510236] [2024-11-19 00:43:10,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951510236] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:43:10,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676169900] [2024-11-19 00:43:10,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:43:10,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:43:10,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:43:10,849 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:43:10,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 00:43:11,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:43:11,072 INFO L255 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 00:43:11,075 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:43:11,098 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-19 00:43:11,098 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:43:11,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [676169900] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:43:11,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:43:11,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2024-11-19 00:43:11,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19192092] [2024-11-19 00:43:11,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:43:11,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:43:11,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:43:11,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:43:11,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:43:11,101 INFO L87 Difference]: Start difference. First operand 1240 states and 1670 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (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-19 00:43:11,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:43:11,173 INFO L93 Difference]: Finished difference Result 2513 states and 3385 transitions. [2024-11-19 00:43:11,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:43:11,173 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (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 113 [2024-11-19 00:43:11,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:43:11,179 INFO L225 Difference]: With dead ends: 2513 [2024-11-19 00:43:11,179 INFO L226 Difference]: Without dead ends: 1276 [2024-11-19 00:43:11,182 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:43:11,182 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 572 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-19 00:43:11,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 572 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:43:11,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1276 states. [2024-11-19 00:43:11,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1276 to 1276. [2024-11-19 00:43:11,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1276 states, 1151 states have (on average 1.315377932232841) internal successors, (1514), 1159 states have internal predecessors, (1514), 96 states have call successors, (96), 28 states have call predecessors, (96), 28 states have return successors, (96), 88 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-19 00:43:11,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1276 states to 1276 states and 1706 transitions. [2024-11-19 00:43:11,257 INFO L78 Accepts]: Start accepts. Automaton has 1276 states and 1706 transitions. Word has length 113 [2024-11-19 00:43:11,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:43:11,257 INFO L471 AbstractCegarLoop]: Abstraction has 1276 states and 1706 transitions. [2024-11-19 00:43:11,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (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-19 00:43:11,259 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 1706 transitions. [2024-11-19 00:43:11,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-19 00:43:11,261 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:43:11,261 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] [2024-11-19 00:43:11,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-19 00:43:11,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-19 00:43:11,462 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:43:11,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:43:11,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1912099421, now seen corresponding path program 1 times [2024-11-19 00:43:11,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:43:11,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467340665] [2024-11-19 00:43:11,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:43:11,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:43:11,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:43:12,689 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-19 00:43:12,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:43:12,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467340665] [2024-11-19 00:43:12,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467340665] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:43:12,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:43:12,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-19 00:43:12,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382574565] [2024-11-19 00:43:12,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:43:12,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 00:43:12,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:43:12,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 00:43:12,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-19 00:43:12,693 INFO L87 Difference]: Start difference. First operand 1276 states and 1706 transitions. Second operand has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 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-19 00:43:13,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:43:13,806 INFO L93 Difference]: Finished difference Result 1832 states and 2449 transitions. [2024-11-19 00:43:13,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 00:43:13,807 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 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 113 [2024-11-19 00:43:13,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:43:13,814 INFO L225 Difference]: With dead ends: 1832 [2024-11-19 00:43:13,814 INFO L226 Difference]: Without dead ends: 1474 [2024-11-19 00:43:13,815 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2024-11-19 00:43:13,816 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 362 mSDsluCounter, 1698 mSDsCounter, 0 mSdLazyCounter, 820 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 1912 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 00:43:13,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 1912 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 820 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 00:43:13,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states. [2024-11-19 00:43:13,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 1339. [2024-11-19 00:43:13,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1339 states, 1206 states have (on average 1.314262023217247) internal successors, (1585), 1215 states have internal predecessors, (1585), 102 states have call successors, (102), 30 states have call predecessors, (102), 30 states have return successors, (102), 93 states have call predecessors, (102), 102 states have call successors, (102) [2024-11-19 00:43:13,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1339 states to 1339 states and 1789 transitions. [2024-11-19 00:43:13,920 INFO L78 Accepts]: Start accepts. Automaton has 1339 states and 1789 transitions. Word has length 113 [2024-11-19 00:43:13,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:43:13,920 INFO L471 AbstractCegarLoop]: Abstraction has 1339 states and 1789 transitions. [2024-11-19 00:43:13,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 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-19 00:43:13,921 INFO L276 IsEmpty]: Start isEmpty. Operand 1339 states and 1789 transitions. [2024-11-19 00:43:13,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-19 00:43:13,923 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:43:13,923 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] [2024-11-19 00:43:13,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 00:43:13,924 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:43:13,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:43:13,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1573379601, now seen corresponding path program 1 times [2024-11-19 00:43:13,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:43:13,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640127360] [2024-11-19 00:43:13,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:43:13,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:43:13,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:43:14,098 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-19 00:43:14,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:43:14,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640127360] [2024-11-19 00:43:14,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640127360] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:43:14,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:43:14,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:43:14,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66598888] [2024-11-19 00:43:14,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:43:14,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:43:14,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:43:14,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:43:14,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:43:14,100 INFO L87 Difference]: Start difference. First operand 1339 states and 1789 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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-19 00:43:14,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:43:14,301 INFO L93 Difference]: Finished difference Result 2213 states and 2956 transitions. [2024-11-19 00:43:14,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:43:14,302 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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 113 [2024-11-19 00:43:14,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:43:14,308 INFO L225 Difference]: With dead ends: 2213 [2024-11-19 00:43:14,308 INFO L226 Difference]: Without dead ends: 1485 [2024-11-19 00:43:14,310 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:43:14,311 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 125 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:43:14,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 593 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:43:14,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1485 states. [2024-11-19 00:43:14,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1485 to 1319. [2024-11-19 00:43:14,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1319 states, 1186 states have (on average 1.3119730185497471) internal successors, (1556), 1195 states have internal predecessors, (1556), 102 states have call successors, (102), 30 states have call predecessors, (102), 30 states have return successors, (102), 93 states have call predecessors, (102), 102 states have call successors, (102) [2024-11-19 00:43:14,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1319 states to 1319 states and 1760 transitions. [2024-11-19 00:43:14,389 INFO L78 Accepts]: Start accepts. Automaton has 1319 states and 1760 transitions. Word has length 113 [2024-11-19 00:43:14,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:43:14,390 INFO L471 AbstractCegarLoop]: Abstraction has 1319 states and 1760 transitions. [2024-11-19 00:43:14,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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-19 00:43:14,390 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 1760 transitions. [2024-11-19 00:43:14,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-19 00:43:14,392 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:43:14,392 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] [2024-11-19 00:43:14,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 00:43:14,392 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:43:14,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:43:14,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1865350813, now seen corresponding path program 1 times [2024-11-19 00:43:14,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:43:14,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013111261] [2024-11-19 00:43:14,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:43:14,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:43:14,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:43:14,998 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-19 00:43:14,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:43:14,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013111261] [2024-11-19 00:43:14,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013111261] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:43:14,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:43:14,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 00:43:14,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002796584] [2024-11-19 00:43:14,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:43:14,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 00:43:14,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:43:15,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 00:43:15,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:43:15,000 INFO L87 Difference]: Start difference. First operand 1319 states and 1760 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 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-19 00:43:15,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:43:15,464 INFO L93 Difference]: Finished difference Result 2054 states and 2735 transitions. [2024-11-19 00:43:15,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 00:43:15,465 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 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 114 [2024-11-19 00:43:15,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:43:15,471 INFO L225 Difference]: With dead ends: 2054 [2024-11-19 00:43:15,471 INFO L226 Difference]: Without dead ends: 1299 [2024-11-19 00:43:15,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-19 00:43:15,475 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 136 mSDsluCounter, 870 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 1084 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:43:15,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 1084 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:43:15,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1299 states. [2024-11-19 00:43:15,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1299 to 1293. [2024-11-19 00:43:15,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1293 states, 1160 states have (on average 1.306896551724138) internal successors, (1516), 1169 states have internal predecessors, (1516), 102 states have call successors, (102), 30 states have call predecessors, (102), 30 states have return successors, (102), 93 states have call predecessors, (102), 102 states have call successors, (102) [2024-11-19 00:43:15,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1293 states to 1293 states and 1720 transitions. [2024-11-19 00:43:15,558 INFO L78 Accepts]: Start accepts. Automaton has 1293 states and 1720 transitions. Word has length 114 [2024-11-19 00:43:15,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:43:15,559 INFO L471 AbstractCegarLoop]: Abstraction has 1293 states and 1720 transitions. [2024-11-19 00:43:15,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 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-19 00:43:15,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1293 states and 1720 transitions. [2024-11-19 00:43:15,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-19 00:43:15,560 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:43:15,561 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] [2024-11-19 00:43:15,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-19 00:43:15,561 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:43:15,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:43:15,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1605124284, now seen corresponding path program 1 times [2024-11-19 00:43:15,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:43:15,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508896665] [2024-11-19 00:43:15,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:43:15,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:43:15,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:43:15,665 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-19 00:43:15,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:43:15,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508896665] [2024-11-19 00:43:15,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508896665] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:43:15,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:43:15,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:43:15,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590263183] [2024-11-19 00:43:15,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:43:15,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:43:15,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:43:15,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:43:15,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:43:15,668 INFO L87 Difference]: Start difference. First operand 1293 states and 1720 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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-19 00:43:15,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:43:15,721 INFO L93 Difference]: Finished difference Result 2187 states and 2909 transitions. [2024-11-19 00:43:15,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:43:15,722 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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 114 [2024-11-19 00:43:15,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:43:15,726 INFO L225 Difference]: With dead ends: 2187 [2024-11-19 00:43:15,726 INFO L226 Difference]: Without dead ends: 893 [2024-11-19 00:43:15,728 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-19 00:43:15,729 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 290 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-19 00:43:15,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 290 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:43:15,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2024-11-19 00:43:15,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 891. [2024-11-19 00:43:15,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 891 states, 798 states have (on average 1.300751879699248) internal successors, (1038), 803 states have internal predecessors, (1038), 72 states have call successors, (72), 20 states have call predecessors, (72), 20 states have return successors, (72), 67 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-19 00:43:15,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 1182 transitions. [2024-11-19 00:43:15,802 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 1182 transitions. Word has length 114 [2024-11-19 00:43:15,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:43:15,802 INFO L471 AbstractCegarLoop]: Abstraction has 891 states and 1182 transitions. [2024-11-19 00:43:15,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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-19 00:43:15,802 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1182 transitions. [2024-11-19 00:43:15,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-19 00:43:15,804 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:43:15,805 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-19 00:43:15,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-19 00:43:15,805 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:43:15,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:43:15,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1121599383, now seen corresponding path program 1 times [2024-11-19 00:43:15,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:43:15,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980019562] [2024-11-19 00:43:15,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:43:15,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:43:15,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:43:16,197 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-19 00:43:16,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:43:16,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980019562] [2024-11-19 00:43:16,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980019562] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:43:16,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:43:16,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 00:43:16,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630786665] [2024-11-19 00:43:16,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:43:16,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 00:43:16,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:43:16,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 00:43:16,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:43:16,199 INFO L87 Difference]: Start difference. First operand 891 states and 1182 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 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-19 00:43:16,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:43:16,572 INFO L93 Difference]: Finished difference Result 1370 states and 1817 transitions. [2024-11-19 00:43:16,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:43:16,574 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 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-19 00:43:16,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:43:16,579 INFO L225 Difference]: With dead ends: 1370 [2024-11-19 00:43:16,579 INFO L226 Difference]: Without dead ends: 871 [2024-11-19 00:43:16,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:43:16,582 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 106 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:43:16,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 617 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:43:16,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2024-11-19 00:43:16,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 482. [2024-11-19 00:43:16,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 429 states have (on average 1.2913752913752914) internal successors, (554), 432 states have internal predecessors, (554), 40 states have call successors, (40), 12 states have call predecessors, (40), 12 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-19 00:43:16,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 634 transitions. [2024-11-19 00:43:16,626 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 634 transitions. Word has length 115 [2024-11-19 00:43:16,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:43:16,627 INFO L471 AbstractCegarLoop]: Abstraction has 482 states and 634 transitions. [2024-11-19 00:43:16,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 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-19 00:43:16,627 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 634 transitions. [2024-11-19 00:43:16,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-19 00:43:16,629 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:43:16,629 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-19 00:43:16,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-19 00:43:16,629 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:43:16,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:43:16,630 INFO L85 PathProgramCache]: Analyzing trace with hash -158264295, now seen corresponding path program 1 times [2024-11-19 00:43:16,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:43:16,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195105285] [2024-11-19 00:43:16,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:43:16,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:43:16,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 00:43:16,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1175947039] [2024-11-19 00:43:16,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:43:16,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:43:16,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:43:16,741 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:43:16,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 00:43:16,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 00:43:16,985 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 00:43:17,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 00:43:17,295 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 00:43:17,295 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 00:43:17,296 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 00:43:17,309 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-19 00:43:17,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-19 00:43:17,503 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] [2024-11-19 00:43:17,668 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 00:43:17,671 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 12:43:17 BoogieIcfgContainer [2024-11-19 00:43:17,671 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 00:43:17,672 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 00:43:17,672 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 00:43:17,672 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 00:43:17,673 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:42:52" (3/4) ... [2024-11-19 00:43:17,675 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 00:43:17,676 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 00:43:17,677 INFO L158 Benchmark]: Toolchain (without parser) took 26963.85ms. Allocated memory was 172.0MB in the beginning and 648.0MB in the end (delta: 476.1MB). Free memory was 102.3MB in the beginning and 594.3MB in the end (delta: -492.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 00:43:17,677 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 172.0MB. Free memory is still 129.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 00:43:17,680 INFO L158 Benchmark]: CACSL2BoogieTranslator took 376.09ms. Allocated memory is still 172.0MB. Free memory was 102.1MB in the beginning and 141.7MB in the end (delta: -39.5MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. [2024-11-19 00:43:17,681 INFO L158 Benchmark]: Boogie Procedure Inliner took 93.15ms. Allocated memory is still 172.0MB. Free memory was 141.7MB in the beginning and 137.5MB in the end (delta: 4.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-19 00:43:17,681 INFO L158 Benchmark]: Boogie Preprocessor took 93.45ms. Allocated memory is still 172.0MB. Free memory was 137.5MB in the beginning and 132.7MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 00:43:17,681 INFO L158 Benchmark]: RCFGBuilder took 874.40ms. Allocated memory is still 172.0MB. Free memory was 132.7MB in the beginning and 91.4MB in the end (delta: 41.3MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-11-19 00:43:17,681 INFO L158 Benchmark]: TraceAbstraction took 25516.05ms. Allocated memory was 172.0MB in the beginning and 648.0MB in the end (delta: 476.1MB). Free memory was 90.7MB in the beginning and 595.4MB in the end (delta: -504.6MB). Peak memory consumption was 347.0MB. Max. memory is 16.1GB. [2024-11-19 00:43:17,681 INFO L158 Benchmark]: Witness Printer took 4.54ms. Allocated memory is still 648.0MB. Free memory was 595.4MB in the beginning and 594.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 00:43:17,683 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 172.0MB. Free memory is still 129.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 376.09ms. Allocated memory is still 172.0MB. Free memory was 102.1MB in the beginning and 141.7MB in the end (delta: -39.5MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 93.15ms. Allocated memory is still 172.0MB. Free memory was 141.7MB in the beginning and 137.5MB in the end (delta: 4.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 93.45ms. Allocated memory is still 172.0MB. Free memory was 137.5MB in the beginning and 132.7MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 874.40ms. Allocated memory is still 172.0MB. Free memory was 132.7MB in the beginning and 91.4MB in the end (delta: 41.3MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 25516.05ms. Allocated memory was 172.0MB in the beginning and 648.0MB in the end (delta: 476.1MB). Free memory was 90.7MB in the beginning and 595.4MB in the end (delta: -504.6MB). Peak memory consumption was 347.0MB. Max. memory is 16.1GB. * Witness Printer took 4.54ms. Allocated memory is still 648.0MB. Free memory was 595.4MB in the beginning and 594.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 104, overapproximation of bitwiseOr at line 104, overapproximation of bitwiseAnd at line 61. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 0 }; [L25] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer = &(BOOL_unsigned_char_Array_0[0]); [L26-L28] float float_Array_0[3] = { 5.8, 0.5, 99.25 }; [L26-L28] float float_Array_0[3] = { 5.8, 0.5, 99.25 }; [L26-L28] float float_Array_0[3] = { 5.8, 0.5, 99.25 }; [L26-L28] float float_Array_0[3] = { 5.8, 0.5, 99.25 }; [L29] float* float_Array_0_arrayfloat_Array_0arrayVar0_Pointer = &(float_Array_0[0]); [L30] float* float_Array_0_arrayfloat_Array_0arrayVar1_Pointer = &(float_Array_0[1]); [L31] float* float_Array_0_arrayfloat_Array_0arrayVar2_Pointer = &(float_Array_0[2]); [L32-L34] signed short int signed_short_int_Array_0[2] = { 5, 18477 }; [L32-L34] signed short int signed_short_int_Array_0[2] = { 5, 18477 }; [L32-L34] signed short int signed_short_int_Array_0[2] = { 5, 18477 }; [L35] signed short int* signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer = &(signed_short_int_Array_0[0]); [L36] signed short int* signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer = &(signed_short_int_Array_0[1]); [L37-L39] unsigned char unsigned_char_Array_0[3] = { 50, 1, 16 }; [L37-L39] unsigned char unsigned_char_Array_0[3] = { 50, 1, 16 }; [L37-L39] unsigned char unsigned_char_Array_0[3] = { 50, 1, 16 }; [L37-L39] unsigned char unsigned_char_Array_0[3] = { 50, 1, 16 }; [L40] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer = &(unsigned_char_Array_0[0]); [L41] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer = &(unsigned_char_Array_0[1]); [L42] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer = &(unsigned_char_Array_0[2]); [L43-L45] unsigned long int unsigned_long_int_Array_0[1] = { 256 }; [L43-L45] unsigned long int unsigned_long_int_Array_0[1] = { 256 }; [L46] unsigned long int* unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer = &(unsigned_long_int_Array_0[0]); [L47] unsigned char last_1_unsigned_char_Array_0_2_ = 16; [L48] unsigned long int last_1_unsigned_long_int_Array_0_0_ = 256; VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=0, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L108] isInitial = 1 [L109] FCALL initially() [L110] COND TRUE 1 [L111] CALL updateLastVariables() [L100] EXPR unsigned_char_Array_0[2] [L100] last_1_unsigned_char_Array_0_2_ = unsigned_char_Array_0[2] [L101] EXPR unsigned_long_int_Array_0[0] [L101] last_1_unsigned_long_int_Array_0_0_ = unsigned_long_int_Array_0[0] [L111] RET updateLastVariables() [L112] CALL updateVariables() [L79] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L80] 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}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L80] 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}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [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}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L80] 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}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L81] 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}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L81] 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}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [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}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L81] 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}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L82] float_Array_0[0] = __VERIFIER_nondet_float() [L83] EXPR float_Array_0[0] [L83] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_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}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L83] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F [L83] EXPR float_Array_0[0] [L83] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_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}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L83] EXPR (float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_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}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L83] EXPR (float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_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}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L83] CALL assume_abort_if_not((float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_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}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [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}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L83] RET assume_abort_if_not((float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_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}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L84] float_Array_0[1] = __VERIFIER_nondet_float() [L85] EXPR float_Array_0[1] [L85] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_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}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L85] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F [L85] EXPR float_Array_0[1] [L85] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_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}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L85] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_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}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L85] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_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}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L85] CALL assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_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}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [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}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L85] RET assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_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}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L86] signed_short_int_Array_0[0] = __VERIFIER_nondet_short() [L87] EXPR signed_short_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}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L87] CALL assume_abort_if_not(signed_short_int_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}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [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}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L87] RET assume_abort_if_not(signed_short_int_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}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L88] EXPR signed_short_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}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L88] CALL assume_abort_if_not(signed_short_int_Array_0[0] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [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}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L88] RET assume_abort_if_not(signed_short_int_Array_0[0] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L89] signed_short_int_Array_0[1] = __VERIFIER_nondet_short() [L90] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L90] CALL assume_abort_if_not(signed_short_int_Array_0[1] >= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [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}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L90] RET assume_abort_if_not(signed_short_int_Array_0[1] >= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L91] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L91] CALL assume_abort_if_not(signed_short_int_Array_0[1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [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}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L91] RET assume_abort_if_not(signed_short_int_Array_0[1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L92] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L93] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L93] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [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}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L93] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L94] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L94] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [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}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L94] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L95] unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L96] EXPR 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}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L96] CALL assume_abort_if_not(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}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [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}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L96] RET assume_abort_if_not(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}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L97] EXPR 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}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L97] CALL assume_abort_if_not(unsigned_char_Array_0[1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [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}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L97] RET assume_abort_if_not(unsigned_char_Array_0[1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L112] RET updateVariables() [L113] CALL step() [L52] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer) [L52] signed short int stepLocal_3 = (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)); [L53] unsigned long int stepLocal_2 = last_1_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}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, stepLocal_2=256, stepLocal_3=256, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L54] COND FALSE !(last_1_unsigned_long_int_Array_0_0_ > stepLocal_3) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L61] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer) [L61] EXPR \read(*signed_short_int_Array_0_arraysigned_short_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}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L61] EXPR (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) & (*(signed_short_int_Array_0_arraysigned_short_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}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, stepLocal_2=256, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L61] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer) [L61] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer) [L61] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L61] COND FALSE !(((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) & (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) > (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) * last_1_unsigned_long_int_Array_0_0_) * ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))))) [L66] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer) [L66] (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) = (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) [L68] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer) [L68] unsigned char stepLocal_1 = (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)); [L69] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer) [L69] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer) [L69] 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}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L69] EXPR (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) [L69] EXPR \read(*unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer) [L69] EXPR (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) : ((*(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}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, stepLocal_1=16, stepLocal_2=256, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L69] EXPR (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) ^ (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) : ((*(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}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, stepLocal_1=16, stepLocal_2=256, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L69] unsigned long int stepLocal_0 = (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) ^ (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))))); [L70] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L70] COND FALSE !(stepLocal_0 != (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) [L75] (*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) = 10.5f VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L113] RET step() [L114] CALL, EXPR property() [L104] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer) [L104] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer) [L104] 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}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L104] EXPR (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) [L104] EXPR \read(*unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer) [L104] EXPR (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) : ((*(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}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L104] EXPR (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) ^ (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) : ((*(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}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L104] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L104] EXPR (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) ^ (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))))) != (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) - ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) < ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))))) : 1) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) 10.5f)) [L104] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar2_Pointer) [L104] EXPR (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) ^ (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))))) != (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) - ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) < ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))))) : 1) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) 10.5f)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L104] EXPR ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) ^ (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))))) != (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) - ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) < ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))))) : 1) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) 10.5f))) && ((last_1_unsigned_long_int_Array_0_0_ > (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) ? ((((last_1_unsigned_char_Array_0_2_ - (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) > last_1_unsigned_long_int_Array_0_0_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_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}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L104] EXPR ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) ^ (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))))) != (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) - ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) < ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))))) : 1) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) 10.5f))) && ((last_1_unsigned_long_int_Array_0_0_ > (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) ? ((((last_1_unsigned_char_Array_0_2_ - (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) > last_1_unsigned_long_int_Array_0_0_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_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}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L104] EXPR (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) ^ (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))))) != (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) - ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) < ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))))) : 1) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) 10.5f))) && ((last_1_unsigned_long_int_Array_0_0_ > (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) ? ((((last_1_unsigned_char_Array_0_2_ - (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) > last_1_unsigned_long_int_Array_0_0_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))) : 1)) && ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) & (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) > (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) * last_1_unsigned_long_int_Array_0_0_) * ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) > (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))) : 1) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) (*(signed_short_int_Array_0_arraysigned_short_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}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L104] EXPR (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) ^ (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))))) != (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) - ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) < ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))))) : 1) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) 10.5f))) && ((last_1_unsigned_long_int_Array_0_0_ > (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) ? ((((last_1_unsigned_char_Array_0_2_ - (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) > last_1_unsigned_long_int_Array_0_0_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))) : 1)) && ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) & (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) > (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) * last_1_unsigned_long_int_Array_0_0_) * ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) > (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))) : 1) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) (*(signed_short_int_Array_0_arraysigned_short_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}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L104-L105] return (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) ^ (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))))) != (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) - ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) < ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))))) : 1) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) 10.5f))) && ((last_1_unsigned_long_int_Array_0_0_ > (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) ? ((((last_1_unsigned_char_Array_0_2_ - (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) > last_1_unsigned_long_int_Array_0_0_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))) : 1)) && ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) & (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) > (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) * last_1_unsigned_long_int_Array_0_0_) * ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) > (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))) : 1) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))))) ; [L114] RET, EXPR property() [L114] 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}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 108 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 25.3s, OverallIterations: 23, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 9.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3863 SdHoareTripleChecker+Valid, 5.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3851 mSDsluCounter, 19387 SdHoareTripleChecker+Invalid, 4.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15451 mSDsCounter, 238 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6303 IncrementalHoareTripleChecker+Invalid, 6541 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 238 mSolverCounterUnsat, 3936 mSDtfsCounter, 6303 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 816 GetRequests, 593 SyntacticMatches, 1 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1043 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1339occurred in iteration=18, InterpolantAutomatonStates: 190, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 22 MinimizatonAttempts, 1849 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 10.0s InterpolantComputationTime, 3103 NumberOfCodeBlocks, 3103 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 2954 ConstructedInterpolants, 0 QuantifiedInterpolants, 9653 SizeOfPredicates, 15 NumberOfNonLiveVariables, 1795 ConjunctsInSsa, 46 ConjunctsInUnsatCore, 27 InterpolantComputations, 21 PerfectInterpolantSequences, 6870/7128 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-19 00:43:17,747 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-18.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 e68bf11432a02c4ee2bd8f03ee2807d4845705e500d61756e972fae2c63173ed --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:43:19,924 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:43:19,991 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-19 00:43:19,998 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:43:19,999 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:43:20,032 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:43:20,035 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:43:20,035 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:43:20,036 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:43:20,036 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:43:20,036 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:43:20,037 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:43:20,037 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:43:20,039 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:43:20,040 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:43:20,040 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:43:20,040 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:43:20,040 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:43:20,041 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:43:20,041 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:43:20,041 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:43:20,045 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:43:20,045 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:43:20,045 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 00:43:20,045 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 00:43:20,046 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:43:20,046 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 00:43:20,046 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:43:20,046 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:43:20,046 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:43:20,047 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:43:20,047 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:43:20,047 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:43:20,047 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:43:20,047 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:43:20,048 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:43:20,048 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:43:20,048 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:43:20,049 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 00:43:20,050 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 00:43:20,050 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:43:20,050 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:43:20,051 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:43:20,051 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:43:20,051 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 -> e68bf11432a02c4ee2bd8f03ee2807d4845705e500d61756e972fae2c63173ed [2024-11-19 00:43:20,363 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:43:20,383 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:43:20,385 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:43:20,387 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:43:20,387 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:43:20,388 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-18.i [2024-11-19 00:43:21,886 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:43:22,120 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:43:22,121 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-18.i [2024-11-19 00:43:22,136 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04412062d/ac8d755a694a4bfab7b93c9bbaf7ea5f/FLAG9002d1df1 [2024-11-19 00:43:22,450 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04412062d/ac8d755a694a4bfab7b93c9bbaf7ea5f [2024-11-19 00:43:22,452 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:43:22,453 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:43:22,456 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:43:22,456 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:43:22,462 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:43:22,462 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:43:22" (1/1) ... [2024-11-19 00:43:22,465 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@140cb144 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:43:22, skipping insertion in model container [2024-11-19 00:43:22,465 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:43:22" (1/1) ... [2024-11-19 00:43:22,494 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:43:22,686 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-18.i[917,930] [2024-11-19 00:43:22,765 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:43:22,790 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:43:22,805 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-18.i[917,930] [2024-11-19 00:43:22,852 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:43:22,881 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:43:22,882 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:43:22 WrapperNode [2024-11-19 00:43:22,882 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:43:22,883 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:43:22,883 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:43:22,883 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:43:22,890 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:43:22" (1/1) ... [2024-11-19 00:43:22,914 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:43:22" (1/1) ... [2024-11-19 00:43:22,959 INFO L138 Inliner]: procedures = 36, calls = 143, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 450 [2024-11-19 00:43:22,963 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:43:22,964 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:43:22,964 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:43:22,964 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:43:22,976 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:43:22" (1/1) ... [2024-11-19 00:43:22,977 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:43:22" (1/1) ... [2024-11-19 00:43:22,988 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:43:22" (1/1) ... [2024-11-19 00:43:23,023 INFO L175 MemorySlicer]: Split 115 memory accesses to 6 slices as follows [2, 6, 29, 22, 46, 10]. 40 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 3, 2, 3, 1]. The 13 writes are split as follows [0, 1, 4, 2, 4, 2]. [2024-11-19 00:43:23,025 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:43:22" (1/1) ... [2024-11-19 00:43:23,026 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:43:22" (1/1) ... [2024-11-19 00:43:23,045 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:43:22" (1/1) ... [2024-11-19 00:43:23,056 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:43:22" (1/1) ... [2024-11-19 00:43:23,062 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:43:22" (1/1) ... [2024-11-19 00:43:23,069 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:43:22" (1/1) ... [2024-11-19 00:43:23,100 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:43:23,101 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:43:23,101 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:43:23,101 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:43:23,102 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:43:22" (1/1) ... [2024-11-19 00:43:23,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:43:23,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:43:23,139 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-19 00:43:23,144 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-19 00:43:23,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:43:23,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-19 00:43:23,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-19 00:43:23,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-19 00:43:23,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-19 00:43:23,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-19 00:43:23,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-19 00:43:23,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-19 00:43:23,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-19 00:43:23,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-19 00:43:23,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-19 00:43:23,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-19 00:43:23,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-19 00:43:23,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 00:43:23,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 00:43:23,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-19 00:43:23,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-19 00:43:23,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-19 00:43:23,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-19 00:43:23,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-19 00:43:23,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-19 00:43:23,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-19 00:43:23,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-19 00:43:23,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-19 00:43:23,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-19 00:43:23,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-19 00:43:23,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-19 00:43:23,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-19 00:43:23,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-19 00:43:23,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-19 00:43:23,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-11-19 00:43:23,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-19 00:43:23,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-19 00:43:23,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-19 00:43:23,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-19 00:43:23,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-19 00:43:23,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-19 00:43:23,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-19 00:43:23,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-19 00:43:23,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-19 00:43:23,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-19 00:43:23,208 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-19 00:43:23,208 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-11-19 00:43:23,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-19 00:43:23,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-19 00:43:23,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-19 00:43:23,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-19 00:43:23,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-19 00:43:23,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-11-19 00:43:23,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-19 00:43:23,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-19 00:43:23,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-19 00:43:23,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-19 00:43:23,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-19 00:43:23,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-11-19 00:43:23,210 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:43:23,210 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:43:23,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:43:23,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:43:23,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-19 00:43:23,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-19 00:43:23,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-19 00:43:23,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-19 00:43:23,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-19 00:43:23,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-19 00:43:23,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-19 00:43:23,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-19 00:43:23,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-19 00:43:23,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-19 00:43:23,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-19 00:43:23,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-11-19 00:43:23,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-19 00:43:23,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-19 00:43:23,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-19 00:43:23,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-19 00:43:23,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-19 00:43:23,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-19 00:43:23,378 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:43:23,380 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:43:24,111 INFO L? ?]: Removed 124 outVars from TransFormulas that were not future-live. [2024-11-19 00:43:24,114 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:43:24,139 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:43:24,140 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:43:24,140 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:43:24 BoogieIcfgContainer [2024-11-19 00:43:24,140 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:43:24,143 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:43:24,143 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:43:24,146 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:43:24,146 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:43:22" (1/3) ... [2024-11-19 00:43:24,147 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68d7446e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:43:24, skipping insertion in model container [2024-11-19 00:43:24,148 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:43:22" (2/3) ... [2024-11-19 00:43:24,148 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68d7446e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:43:24, skipping insertion in model container [2024-11-19 00:43:24,149 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:43:24" (3/3) ... [2024-11-19 00:43:24,150 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-18.i [2024-11-19 00:43:24,167 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:43:24,168 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:43:24,244 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:43:24,252 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;@6041b306, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:43:24,252 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:43:24,256 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 77 states have (on average 1.4285714285714286) internal successors, (110), 78 states have internal predecessors, (110), 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-19 00:43:24,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-19 00:43:24,268 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:43:24,269 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:43:24,269 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:43:24,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:43:24,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1283831834, now seen corresponding path program 1 times [2024-11-19 00:43:24,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:43:24,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [907722668] [2024-11-19 00:43:24,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:43:24,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-19 00:43:24,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:43:24,296 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-19 00:43:24,297 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-19 00:43:24,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:43:24,622 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:43:24,630 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:43:24,673 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2024-11-19 00:43:24,674 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:43:24,674 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:43:24,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [907722668] [2024-11-19 00:43:24,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [907722668] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:43:24,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:43:24,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 00:43:24,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246047756] [2024-11-19 00:43:24,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:43:24,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:43:24,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:43:24,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:43:24,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:43:24,711 INFO L87 Difference]: Start difference. First operand has 92 states, 77 states have (on average 1.4285714285714286) internal successors, (110), 78 states have internal predecessors, (110), 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 25.0) internal successors, (50), 2 states have internal predecessors, (50), 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-19 00:43:24,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:43:24,736 INFO L93 Difference]: Finished difference Result 177 states and 274 transitions. [2024-11-19 00:43:24,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:43:24,738 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 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 103 [2024-11-19 00:43:24,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:43:24,744 INFO L225 Difference]: With dead ends: 177 [2024-11-19 00:43:24,745 INFO L226 Difference]: Without dead ends: 88 [2024-11-19 00:43:24,748 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 102 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-19 00:43:24,750 INFO L432 NwaCegarLoop]: 127 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, 127 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-19 00:43:24,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:43:24,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-19 00:43:24,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-19 00:43:24,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 74 states have (on average 1.3918918918918919) internal successors, (103), 74 states have internal predecessors, (103), 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-19 00:43:24,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 127 transitions. [2024-11-19 00:43:24,787 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 127 transitions. Word has length 103 [2024-11-19 00:43:24,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:43:24,787 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 127 transitions. [2024-11-19 00:43:24,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 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-19 00:43:24,788 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 127 transitions. [2024-11-19 00:43:24,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-19 00:43:24,791 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:43:24,791 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:43:24,801 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-19 00:43:24,991 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-19 00:43:24,992 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:43:24,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:43:24,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1144304698, now seen corresponding path program 1 times [2024-11-19 00:43:24,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:43:24,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [148759772] [2024-11-19 00:43:24,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:43:24,995 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-19 00:43:24,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:43:24,996 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-19 00:43:24,997 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-19 00:43:25,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:43:25,316 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 00:43:25,321 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:43:25,365 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-19 00:43:25,369 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:43:25,369 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:43:25,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [148759772] [2024-11-19 00:43:25,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [148759772] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:43:25,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:43:25,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:43:25,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990148747] [2024-11-19 00:43:25,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:43:25,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:43:25,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:43:25,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:43:25,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:43:25,377 INFO L87 Difference]: Start difference. First operand 88 states and 127 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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-19 00:43:25,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:43:25,434 INFO L93 Difference]: Finished difference Result 175 states and 254 transitions. [2024-11-19 00:43:25,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:43:25,435 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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 103 [2024-11-19 00:43:25,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:43:25,437 INFO L225 Difference]: With dead ends: 175 [2024-11-19 00:43:25,437 INFO L226 Difference]: Without dead ends: 90 [2024-11-19 00:43:25,440 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 100 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-19 00:43:25,441 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 364 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-19 00:43:25,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 364 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:43:25,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-19 00:43:25,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-19 00:43:25,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 76 states have (on average 1.381578947368421) internal successors, (105), 76 states have internal predecessors, (105), 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-19 00:43:25,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 129 transitions. [2024-11-19 00:43:25,452 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 129 transitions. Word has length 103 [2024-11-19 00:43:25,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:43:25,453 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 129 transitions. [2024-11-19 00:43:25,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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-19 00:43:25,454 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 129 transitions. [2024-11-19 00:43:25,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-19 00:43:25,456 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:43:25,456 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:43:25,466 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-19 00:43:25,660 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-19 00:43:25,661 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:43:25,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:43:25,662 INFO L85 PathProgramCache]: Analyzing trace with hash 814270088, now seen corresponding path program 1 times [2024-11-19 00:43:25,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:43:25,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [115377189] [2024-11-19 00:43:25,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:43:25,663 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-19 00:43:25,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:43:25,668 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-19 00:43:25,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-19 00:43:25,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:43:25,947 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 00:43:25,961 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:43:26,730 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 19 [2024-11-19 00:43:26,742 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 13 treesize of output 9 [2024-11-19 00:43:26,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-19 00:43:26,839 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 5 proven. 159 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-19 00:43:26,840 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:43:26,985 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:43:26,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [115377189] [2024-11-19 00:43:26,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [115377189] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:43:26,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1987306247] [2024-11-19 00:43:26,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:43:26,986 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-19 00:43:26,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-19 00:43:26,989 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-19 00:43:26,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-11-19 00:43:27,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:43:27,560 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-19 00:43:27,566 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:43:28,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 00:43:28,479 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 17 treesize of output 13 [2024-11-19 00:43:28,482 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 23 treesize of output 15 [2024-11-19 00:43:28,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-19 00:43:28,521 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 5 proven. 159 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-19 00:43:28,522 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:43:28,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1987306247] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:43:28,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 00:43:28,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2024-11-19 00:43:28,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236572241] [2024-11-19 00:43:28,557 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 00:43:28,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-19 00:43:28,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:43:28,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-19 00:43:28,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2024-11-19 00:43:28,561 INFO L87 Difference]: Start difference. First operand 90 states and 129 transitions. Second operand has 15 states, 13 states have (on average 6.769230769230769) internal successors, (88), 13 states have internal predecessors, (88), 6 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) [2024-11-19 00:43:30,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:43:30,441 INFO L93 Difference]: Finished difference Result 276 states and 391 transitions. [2024-11-19 00:43:30,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-19 00:43:30,442 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 6.769230769230769) internal successors, (88), 13 states have internal predecessors, (88), 6 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) Word has length 103 [2024-11-19 00:43:30,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:43:30,447 INFO L225 Difference]: With dead ends: 276 [2024-11-19 00:43:30,449 INFO L226 Difference]: Without dead ends: 189 [2024-11-19 00:43:30,450 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 231 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=276, Invalid=984, Unknown=0, NotChecked=0, Total=1260 [2024-11-19 00:43:30,451 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 378 mSDsluCounter, 814 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 955 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:43:30,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 955 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-19 00:43:30,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-11-19 00:43:30,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 183. [2024-11-19 00:43:30,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 154 states have (on average 1.37012987012987) internal successors, (211), 154 states have internal predecessors, (211), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-19 00:43:30,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 259 transitions. [2024-11-19 00:43:30,488 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 259 transitions. Word has length 103 [2024-11-19 00:43:30,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:43:30,489 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 259 transitions. [2024-11-19 00:43:30,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 6.769230769230769) internal successors, (88), 13 states have internal predecessors, (88), 6 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) [2024-11-19 00:43:30,489 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 259 transitions. [2024-11-19 00:43:30,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-19 00:43:30,491 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:43:30,491 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:43:30,501 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-19 00:43:30,700 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2024-11-19 00:43:30,892 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,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-19 00:43:30,893 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:43:30,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:43:30,893 INFO L85 PathProgramCache]: Analyzing trace with hash -465593590, now seen corresponding path program 1 times [2024-11-19 00:43:30,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:43:30,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1472082527] [2024-11-19 00:43:30,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:43:30,894 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-19 00:43:30,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:43:30,896 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-19 00:43:30,898 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-19 00:43:31,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:43:31,130 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-19 00:43:31,135 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:43:31,527 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 19 [2024-11-19 00:43:31,530 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 13 treesize of output 9 [2024-11-19 00:43:31,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-19 00:43:31,648 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 5 proven. 159 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-19 00:43:31,648 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:43:31,799 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:43:31,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1472082527] [2024-11-19 00:43:31,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1472082527] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:43:31,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1591587500] [2024-11-19 00:43:31,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:43:31,800 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-19 00:43:31,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-19 00:43:31,803 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-19 00:43:31,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-11-19 00:43:32,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:43:32,271 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-19 00:43:32,275 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:43:32,662 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-19 00:43:33,139 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 17 treesize of output 13 [2024-11-19 00:43:33,142 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 31 treesize of output 19 [2024-11-19 00:43:33,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-19 00:43:33,225 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 5 proven. 159 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-19 00:43:33,226 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:43:33,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1591587500] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:43:33,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 00:43:33,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2024-11-19 00:43:33,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268489263] [2024-11-19 00:43:33,267 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 00:43:33,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-19 00:43:33,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:43:33,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-19 00:43:33,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2024-11-19 00:43:33,270 INFO L87 Difference]: Start difference. First operand 183 states and 259 transitions. Second operand has 16 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 states have internal predecessors, (88), 6 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) [2024-11-19 00:43:35,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:43:35,040 INFO L93 Difference]: Finished difference Result 280 states and 392 transitions. [2024-11-19 00:43:35,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-19 00:43:35,041 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 states have internal predecessors, (88), 6 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) Word has length 103 [2024-11-19 00:43:35,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:43:35,043 INFO L225 Difference]: With dead ends: 280 [2024-11-19 00:43:35,043 INFO L226 Difference]: Without dead ends: 189 [2024-11-19 00:43:35,044 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 228 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=319, Invalid=1241, Unknown=0, NotChecked=0, Total=1560 [2024-11-19 00:43:35,045 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 374 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 973 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:43:35,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 973 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-19 00:43:35,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-11-19 00:43:35,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 183. [2024-11-19 00:43:35,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 154 states have (on average 1.3636363636363635) internal successors, (210), 154 states have internal predecessors, (210), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-19 00:43:35,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 258 transitions. [2024-11-19 00:43:35,082 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 258 transitions. Word has length 103 [2024-11-19 00:43:35,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:43:35,083 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 258 transitions. [2024-11-19 00:43:35,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 states have internal predecessors, (88), 6 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) [2024-11-19 00:43:35,084 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 258 transitions. [2024-11-19 00:43:35,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-19 00:43:35,085 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:43:35,086 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:43:35,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2024-11-19 00:43:35,292 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-19 00:43:35,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-19 00:43:35,487 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:43:35,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:43:35,487 INFO L85 PathProgramCache]: Analyzing trace with hash 58106553, now seen corresponding path program 1 times [2024-11-19 00:43:35,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:43:35,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1420351353] [2024-11-19 00:43:35,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:43:35,488 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-19 00:43:35,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:43:35,491 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-19 00:43:35,492 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-19 00:43:35,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:43:35,711 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 00:43:35,714 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:43:35,784 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 30 treesize of output 22 [2024-11-19 00:43:35,802 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 35 treesize of output 19 [2024-11-19 00:43:35,840 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-19 00:43:35,840 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:43:35,840 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:43:35,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1420351353] [2024-11-19 00:43:35,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1420351353] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:43:35,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:43:35,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 00:43:35,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675634815] [2024-11-19 00:43:35,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:43:35,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 00:43:35,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:43:35,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 00:43:35,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:43:35,843 INFO L87 Difference]: Start difference. First operand 183 states and 258 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 00:43:36,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:43:36,438 INFO L93 Difference]: Finished difference Result 373 states and 526 transitions. [2024-11-19 00:43:36,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 00:43:36,439 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2024-11-19 00:43:36,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:43:36,441 INFO L225 Difference]: With dead ends: 373 [2024-11-19 00:43:36,441 INFO L226 Difference]: Without dead ends: 193 [2024-11-19 00:43:36,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-11-19 00:43:36,442 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 122 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 00:43:36,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 472 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 00:43:36,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-19 00:43:36,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 189. [2024-11-19 00:43:36,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 160 states have (on average 1.35) internal successors, (216), 160 states have internal predecessors, (216), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-19 00:43:36,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 264 transitions. [2024-11-19 00:43:36,471 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 264 transitions. Word has length 104 [2024-11-19 00:43:36,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:43:36,471 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 264 transitions. [2024-11-19 00:43:36,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 00:43:36,472 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 264 transitions. [2024-11-19 00:43:36,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-19 00:43:36,473 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:43:36,473 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:43:36,484 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-19 00:43:36,674 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-19 00:43:36,674 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:43:36,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:43:36,675 INFO L85 PathProgramCache]: Analyzing trace with hash -642958025, now seen corresponding path program 1 times [2024-11-19 00:43:36,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:43:36,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1047816617] [2024-11-19 00:43:36,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:43:36,676 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-19 00:43:36,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:43:36,679 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-19 00:43:36,680 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-19 00:43:36,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:43:36,900 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 00:43:36,903 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:43:37,250 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 19 [2024-11-19 00:43:37,253 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 13 treesize of output 9 [2024-11-19 00:43:37,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-19 00:43:37,356 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 5 proven. 159 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-19 00:43:37,357 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:43:37,481 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:43:37,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1047816617] [2024-11-19 00:43:37,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1047816617] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:43:37,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1954114371] [2024-11-19 00:43:37,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:43:37,482 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-19 00:43:37,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-19 00:43:37,485 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-19 00:43:37,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2024-11-19 00:43:37,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:43:37,955 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-19 00:43:37,958 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:43:38,309 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-19 00:43:38,744 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 17 treesize of output 13 [2024-11-19 00:43:38,746 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 31 treesize of output 19 [2024-11-19 00:43:38,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-19 00:43:38,801 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 5 proven. 159 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-19 00:43:38,801 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:43:38,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1954114371] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:43:38,828 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 00:43:38,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2024-11-19 00:43:38,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521476726] [2024-11-19 00:43:38,829 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 00:43:38,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-19 00:43:38,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:43:38,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-19 00:43:38,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2024-11-19 00:43:38,830 INFO L87 Difference]: Start difference. First operand 189 states and 264 transitions. Second operand has 15 states, 13 states have (on average 6.846153846153846) internal successors, (89), 13 states have internal predecessors, (89), 6 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) [2024-11-19 00:43:40,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:43:40,225 INFO L93 Difference]: Finished difference Result 286 states and 395 transitions. [2024-11-19 00:43:40,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-19 00:43:40,225 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 6.846153846153846) internal successors, (89), 13 states have internal predecessors, (89), 6 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) Word has length 104 [2024-11-19 00:43:40,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:43:40,227 INFO L225 Difference]: With dead ends: 286 [2024-11-19 00:43:40,227 INFO L226 Difference]: Without dead ends: 193 [2024-11-19 00:43:40,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 235 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=298, Invalid=1034, Unknown=0, NotChecked=0, Total=1332 [2024-11-19 00:43:40,229 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 306 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 980 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 00:43:40,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 980 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 00:43:40,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-19 00:43:40,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 187. [2024-11-19 00:43:40,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 158 states have (on average 1.3417721518987342) internal successors, (212), 158 states have internal predecessors, (212), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-19 00:43:40,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 260 transitions. [2024-11-19 00:43:40,254 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 260 transitions. Word has length 104 [2024-11-19 00:43:40,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:43:40,255 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 260 transitions. [2024-11-19 00:43:40,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 6.846153846153846) internal successors, (89), 13 states have internal predecessors, (89), 6 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) [2024-11-19 00:43:40,255 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 260 transitions. [2024-11-19 00:43:40,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-19 00:43:40,259 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:43:40,259 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:43:40,269 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 (9)] Forceful destruction successful, exit code 0 [2024-11-19 00:43:40,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2024-11-19 00:43:40,660 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,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-19 00:43:40,660 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:43:40,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:43:40,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1803994592, now seen corresponding path program 1 times [2024-11-19 00:43:40,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:43:40,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [324174445] [2024-11-19 00:43:40,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:43:40,662 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-19 00:43:40,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:43:40,665 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-19 00:43:40,670 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-19 00:43:40,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:43:40,889 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 00:43:40,891 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:43:41,035 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-19 00:43:41,036 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:43:41,036 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:43:41,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [324174445] [2024-11-19 00:43:41,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [324174445] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:43:41,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:43:41,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:43:41,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46624525] [2024-11-19 00:43:41,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:43:41,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:43:41,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:43:41,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:43:41,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:43:41,038 INFO L87 Difference]: Start difference. First operand 187 states and 260 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 00:43:41,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:43:41,144 INFO L93 Difference]: Finished difference Result 371 states and 515 transitions. [2024-11-19 00:43:41,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:43:41,146 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 105 [2024-11-19 00:43:41,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:43:41,148 INFO L225 Difference]: With dead ends: 371 [2024-11-19 00:43:41,148 INFO L226 Difference]: Without dead ends: 187 [2024-11-19 00:43:41,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 102 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-19 00:43:41,150 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 67 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:43:41,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 375 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:43:41,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-19 00:43:41,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2024-11-19 00:43:41,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 156 states have (on average 1.3333333333333333) internal successors, (208), 156 states have internal predecessors, (208), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-19 00:43:41,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 256 transitions. [2024-11-19 00:43:41,174 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 256 transitions. Word has length 105 [2024-11-19 00:43:41,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:43:41,174 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 256 transitions. [2024-11-19 00:43:41,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 00:43:41,174 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 256 transitions. [2024-11-19 00:43:41,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-19 00:43:41,175 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:43:41,176 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] [2024-11-19 00:43:41,184 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 (11)] Ended with exit code 0 [2024-11-19 00:43:41,376 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-19 00:43:41,376 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:43:41,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:43:41,377 INFO L85 PathProgramCache]: Analyzing trace with hash 231895965, now seen corresponding path program 1 times [2024-11-19 00:43:41,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:43:41,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [777137395] [2024-11-19 00:43:41,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:43:41,377 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-19 00:43:41,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:43:41,380 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-19 00:43:41,381 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-19 00:43:41,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:43:41,586 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 00:43:41,589 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:43:41,785 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-19 00:43:41,786 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:43:41,786 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:43:41,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [777137395] [2024-11-19 00:43:41,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [777137395] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:43:41,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:43:41,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:43:41,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979595500] [2024-11-19 00:43:41,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:43:41,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:43:41,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:43:41,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:43:41,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:43:41,787 INFO L87 Difference]: Start difference. First operand 185 states and 256 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 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-19 00:43:41,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:43:41,911 INFO L93 Difference]: Finished difference Result 367 states and 507 transitions. [2024-11-19 00:43:41,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:43:41,912 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 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 106 [2024-11-19 00:43:41,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:43:41,915 INFO L225 Difference]: With dead ends: 367 [2024-11-19 00:43:41,915 INFO L226 Difference]: Without dead ends: 185 [2024-11-19 00:43:41,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 103 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-19 00:43:41,916 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 60 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:43:41,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 429 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:43:41,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-19 00:43:41,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 94. [2024-11-19 00:43:41,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 79 states have (on average 1.3164556962025316) internal successors, (104), 79 states have internal predecessors, (104), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 00:43:41,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 128 transitions. [2024-11-19 00:43:41,930 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 128 transitions. Word has length 106 [2024-11-19 00:43:41,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:43:41,932 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 128 transitions. [2024-11-19 00:43:41,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 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-19 00:43:41,932 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 128 transitions. [2024-11-19 00:43:41,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-19 00:43:41,933 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:43:41,933 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] [2024-11-19 00:43:41,943 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 (12)] Forceful destruction successful, exit code 0 [2024-11-19 00:43:42,133 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-19 00:43:42,134 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:43:42,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:43:42,134 INFO L85 PathProgramCache]: Analyzing trace with hash 2031708747, now seen corresponding path program 1 times [2024-11-19 00:43:42,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:43:42,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1238545084] [2024-11-19 00:43:42,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:43:42,135 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-19 00:43:42,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:43:42,136 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-19 00:43:42,137 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-19 00:43:42,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:43:42,333 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 00:43:42,335 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:43:42,350 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-19 00:43:42,350 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:43:42,350 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:43:42,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1238545084] [2024-11-19 00:43:42,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1238545084] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:43:42,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:43:42,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:43:42,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552309619] [2024-11-19 00:43:42,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:43:42,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:43:42,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:43:42,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:43:42,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:43:42,352 INFO L87 Difference]: Start difference. First operand 94 states and 128 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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-19 00:43:42,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:43:42,387 INFO L93 Difference]: Finished difference Result 188 states and 257 transitions. [2024-11-19 00:43:42,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:43:42,387 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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 106 [2024-11-19 00:43:42,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:43:42,388 INFO L225 Difference]: With dead ends: 188 [2024-11-19 00:43:42,388 INFO L226 Difference]: Without dead ends: 97 [2024-11-19 00:43:42,389 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 102 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-19 00:43:42,389 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:43:42,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 466 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:43:42,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-19 00:43:42,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-19 00:43:42,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 82 states have (on average 1.3048780487804879) internal successors, (107), 82 states have internal predecessors, (107), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 00:43:42,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 131 transitions. [2024-11-19 00:43:42,401 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 131 transitions. Word has length 106 [2024-11-19 00:43:42,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:43:42,402 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 131 transitions. [2024-11-19 00:43:42,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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-19 00:43:42,402 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 131 transitions. [2024-11-19 00:43:42,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-19 00:43:42,403 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:43:42,403 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] [2024-11-19 00:43:42,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-11-19 00:43:42,603 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-19 00:43:42,604 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:43:42,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:43:42,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1432824362, now seen corresponding path program 1 times [2024-11-19 00:43:42,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:43:42,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1932804500] [2024-11-19 00:43:42,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:43:42,605 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-19 00:43:42,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:43:42,606 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-19 00:43:42,607 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-19 00:43:42,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:43:42,816 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 00:43:42,818 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:43:42,842 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-19 00:43:42,843 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:43:42,843 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:43:42,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1932804500] [2024-11-19 00:43:42,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1932804500] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:43:42,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:43:42,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:43:42,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843499222] [2024-11-19 00:43:42,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:43:42,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:43:42,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:43:42,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:43:42,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:43:42,845 INFO L87 Difference]: Start difference. First operand 97 states and 131 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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-19 00:43:42,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:43:42,883 INFO L93 Difference]: Finished difference Result 194 states and 263 transitions. [2024-11-19 00:43:42,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:43:42,883 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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 108 [2024-11-19 00:43:42,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:43:42,884 INFO L225 Difference]: With dead ends: 194 [2024-11-19 00:43:42,884 INFO L226 Difference]: Without dead ends: 100 [2024-11-19 00:43:42,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 104 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-19 00:43:42,885 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 464 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-19 00:43:42,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 464 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:43:42,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-19 00:43:42,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-19 00:43:42,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 85 states have (on average 1.2941176470588236) internal successors, (110), 85 states have internal predecessors, (110), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 00:43:42,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 134 transitions. [2024-11-19 00:43:42,902 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 134 transitions. Word has length 108 [2024-11-19 00:43:42,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:43:42,902 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 134 transitions. [2024-11-19 00:43:42,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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-19 00:43:42,903 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 134 transitions. [2024-11-19 00:43:42,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-19 00:43:42,904 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:43:42,905 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] [2024-11-19 00:43:42,913 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 (14)] Ended with exit code 0 [2024-11-19 00:43:43,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:43:43,105 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:43:43,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:43:43,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1971554096, now seen corresponding path program 1 times [2024-11-19 00:43:43,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:43:43,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1835684830] [2024-11-19 00:43:43,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:43:43,107 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-19 00:43:43,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:43:43,108 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:43:43,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-19 00:43:43,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:43:43,330 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-19 00:43:43,333 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:43:43,672 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 45 treesize of output 29 [2024-11-19 00:43:43,676 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 25 treesize of output 17 [2024-11-19 00:43:43,719 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-19 00:43:43,720 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:43:43,878 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-19 00:43:43,878 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:43:43,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1835684830] [2024-11-19 00:43:43,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1835684830] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 00:43:43,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:43:43,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 10 [2024-11-19 00:43:43,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364323326] [2024-11-19 00:43:43,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:43:43,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:43:43,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:43:43,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:43:43,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:43:43,880 INFO L87 Difference]: Start difference. First operand 100 states and 134 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 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-19 00:43:44,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:43:44,219 INFO L93 Difference]: Finished difference Result 253 states and 338 transitions. [2024-11-19 00:43:44,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:43:44,220 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 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 108 [2024-11-19 00:43:44,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:43:44,221 INFO L225 Difference]: With dead ends: 253 [2024-11-19 00:43:44,221 INFO L226 Difference]: Without dead ends: 156 [2024-11-19 00:43:44,221 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-19 00:43:44,222 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 66 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:43:44,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 456 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:43:44,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-19 00:43:44,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 153. [2024-11-19 00:43:44,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 133 states have (on average 1.2932330827067668) internal successors, (172), 134 states have internal predecessors, (172), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 00:43:44,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 204 transitions. [2024-11-19 00:43:44,244 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 204 transitions. Word has length 108 [2024-11-19 00:43:44,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:43:44,244 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 204 transitions. [2024-11-19 00:43:44,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 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-19 00:43:44,245 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 204 transitions. [2024-11-19 00:43:44,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-19 00:43:44,246 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:43:44,246 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] [2024-11-19 00:43:44,255 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 (15)] Ended with exit code 0 [2024-11-19 00:43:44,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /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-19 00:43:44,447 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:43:44,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:43:44,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1042120196, now seen corresponding path program 1 times [2024-11-19 00:43:44,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:43:44,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [571146132] [2024-11-19 00:43:44,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:43:44,448 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-19 00:43:44,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:43:44,449 INFO L229 MonitoredProcess]: Starting monitored process 16 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-19 00:43:44,450 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 (16)] Waiting until timeout for monitored process [2024-11-19 00:43:44,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:43:44,653 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 00:43:44,655 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:43:44,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-19 00:43:44,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-19 00:43:44,933 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:43:44,933 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:43:44,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [571146132] [2024-11-19 00:43:44,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [571146132] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:43:44,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:43:44,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:43:44,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995439212] [2024-11-19 00:43:44,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:43:44,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 00:43:44,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:43:44,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 00:43:44,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:43:44,935 INFO L87 Difference]: Start difference. First operand 153 states and 204 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 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-19 00:43:47,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 00:43:49,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 00:43:51,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 00:43:55,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 00:43:58,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:43:58,423 INFO L93 Difference]: Finished difference Result 698 states and 922 transitions. [2024-11-19 00:43:58,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 00:43:58,426 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 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 110 [2024-11-19 00:43:58,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:43:58,431 INFO L225 Difference]: With dead ends: 698 [2024-11-19 00:43:58,431 INFO L226 Difference]: Without dead ends: 548 [2024-11-19 00:43:58,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-11-19 00:43:58,432 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 303 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 34 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.4s IncrementalHoareTripleChecker+Time [2024-11-19 00:43:58,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 748 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 275 Invalid, 1 Unknown, 0 Unchecked, 13.4s Time] [2024-11-19 00:43:58,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2024-11-19 00:43:58,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 361. [2024-11-19 00:43:58,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 322 states have (on average 1.2826086956521738) internal successors, (413), 324 states have internal predecessors, (413), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-19 00:43:58,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 477 transitions. [2024-11-19 00:43:58,469 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 477 transitions. Word has length 110 [2024-11-19 00:43:58,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:43:58,470 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 477 transitions. [2024-11-19 00:43:58,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 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-19 00:43:58,470 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 477 transitions. [2024-11-19 00:43:58,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-19 00:43:58,471 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:43:58,471 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] [2024-11-19 00:43:58,481 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 (16)] Ended with exit code 0 [2024-11-19 00:43:58,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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-19 00:43:58,672 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:43:58,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:43:58,672 INFO L85 PathProgramCache]: Analyzing trace with hash -782383678, now seen corresponding path program 1 times [2024-11-19 00:43:58,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:43:58,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1040301976] [2024-11-19 00:43:58,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:43:58,673 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-19 00:43:58,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:43:58,674 INFO L229 MonitoredProcess]: Starting monitored process 17 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-19 00:43:58,675 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 (17)] Waiting until timeout for monitored process [2024-11-19 00:43:58,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:43:58,927 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-19 00:43:58,930 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:43:59,126 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 17 treesize of output 13 [2024-11-19 00:43:59,234 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-19 00:43:59,234 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:43:59,372 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-19 00:43:59,372 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:43:59,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1040301976] [2024-11-19 00:43:59,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1040301976] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 00:43:59,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:43:59,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 11 [2024-11-19 00:43:59,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483370526] [2024-11-19 00:43:59,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:43:59,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 00:43:59,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:43:59,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 00:43:59,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:43:59,374 INFO L87 Difference]: Start difference. First operand 361 states and 477 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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-19 00:43:59,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:43:59,732 INFO L93 Difference]: Finished difference Result 492 states and 647 transitions. [2024-11-19 00:43:59,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:43:59,733 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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 110 [2024-11-19 00:43:59,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:43:59,737 INFO L225 Difference]: With dead ends: 492 [2024-11-19 00:43:59,737 INFO L226 Difference]: Without dead ends: 490 [2024-11-19 00:43:59,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2024-11-19 00:43:59,738 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 67 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:43:59,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 791 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:43:59,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2024-11-19 00:43:59,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 398. [2024-11-19 00:43:59,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 359 states have (on average 1.2813370473537604) internal successors, (460), 361 states have internal predecessors, (460), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-19 00:43:59,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 524 transitions. [2024-11-19 00:43:59,777 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 524 transitions. Word has length 110 [2024-11-19 00:43:59,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:43:59,780 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 524 transitions. [2024-11-19 00:43:59,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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-19 00:43:59,781 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 524 transitions. [2024-11-19 00:43:59,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-19 00:43:59,782 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:43:59,782 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] [2024-11-19 00:43:59,793 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 (17)] Forceful destruction successful, exit code 0 [2024-11-19 00:43:59,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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-19 00:43:59,983 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:43:59,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:43:59,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1695174517, now seen corresponding path program 1 times [2024-11-19 00:43:59,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:43:59,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [370289272] [2024-11-19 00:43:59,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:43:59,985 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-19 00:43:59,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:43:59,988 INFO L229 MonitoredProcess]: Starting monitored process 18 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-19 00:43:59,989 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 (18)] Waiting until timeout for monitored process [2024-11-19 00:44:00,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:44:00,228 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 00:44:00,231 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:44:00,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-19 00:44:00,628 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 5 proven. 159 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-19 00:44:00,628 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:44:00,770 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:44:00,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [370289272] [2024-11-19 00:44:00,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [370289272] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:44:00,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [103224378] [2024-11-19 00:44:00,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:44:00,771 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-19 00:44:00,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-19 00:44:00,774 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-19 00:44:00,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2024-11-19 00:44:01,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:44:01,568 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 00:44:01,571 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:44:01,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 00:44:02,144 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 18 treesize of output 10 [2024-11-19 00:44:02,162 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 5 proven. 159 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-19 00:44:02,163 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:44:02,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [103224378] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:44:02,218 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 00:44:02,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-19 00:44:02,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867402442] [2024-11-19 00:44:02,218 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 00:44:02,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 00:44:02,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:44:02,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 00:44:02,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-11-19 00:44:02,220 INFO L87 Difference]: Start difference. First operand 398 states and 524 transitions. Second operand has 14 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 6 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24)