./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-67.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-67.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd --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 2bfc3a2327f8b20a29fd925460a8337c18b9a784fffca7c1ea577a58172303bb --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 15:23:47,708 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 15:23:47,780 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 15:23:47,785 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 15:23:47,785 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 15:23:47,806 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 15:23:47,807 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 15:23:47,807 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 15:23:47,808 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 15:23:47,808 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 15:23:47,808 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 15:23:47,808 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 15:23:47,808 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 15:23:47,808 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 15:23:47,808 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 15:23:47,809 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 15:23:47,809 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 15:23:47,809 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 15:23:47,809 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 15:23:47,809 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 15:23:47,809 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 15:23:47,809 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 15:23:47,809 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 15:23:47,809 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 15:23:47,810 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 15:23:47,810 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 15:23:47,810 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 15:23:47,810 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 15:23:47,810 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 15:23:47,810 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 15:23:47,810 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 15:23:47,810 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 15:23:47,810 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:23:47,811 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 15:23:47,811 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 15:23:47,811 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 15:23:47,811 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 15:23:47,811 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 15:23:47,811 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 15:23:47,811 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 15:23:47,811 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 15:23:47,811 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 15:23:47,812 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd 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 -> 2bfc3a2327f8b20a29fd925460a8337c18b9a784fffca7c1ea577a58172303bb [2024-11-13 15:23:48,092 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 15:23:48,100 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 15:23:48,103 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 15:23:48,104 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 15:23:48,104 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 15:23:48,106 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-67.i Unable to find full path for "g++" [2024-11-13 15:23:50,103 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 15:23:50,486 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 15:23:50,486 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-67.i [2024-11-13 15:23:50,496 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/data/5a15e2fbf/8c08d0c48e97424c834bfe3436849331/FLAG13e9b2c98 [2024-11-13 15:23:50,511 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/data/5a15e2fbf/8c08d0c48e97424c834bfe3436849331 [2024-11-13 15:23:50,514 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 15:23:50,516 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 15:23:50,518 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 15:23:50,518 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 15:23:50,523 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 15:23:50,524 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:23:50" (1/1) ... [2024-11-13 15:23:50,526 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5714b9a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:23:50, skipping insertion in model container [2024-11-13 15:23:50,526 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:23:50" (1/1) ... [2024-11-13 15:23:50,552 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 15:23:50,707 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-67.i[917,930] [2024-11-13 15:23:50,777 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:23:50,790 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 15:23:50,803 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-67.i[917,930] [2024-11-13 15:23:50,843 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:23:50,875 INFO L204 MainTranslator]: Completed translation [2024-11-13 15:23:50,876 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:23:50 WrapperNode [2024-11-13 15:23:50,876 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 15:23:50,880 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 15:23:50,881 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 15:23:50,881 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 15:23:50,888 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:23:50" (1/1) ... [2024-11-13 15:23:50,901 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:23:50" (1/1) ... [2024-11-13 15:23:50,966 INFO L138 Inliner]: procedures = 30, calls = 130, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 412 [2024-11-13 15:23:50,967 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 15:23:50,967 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 15:23:50,968 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 15:23:50,968 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 15:23:50,981 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:23:50" (1/1) ... [2024-11-13 15:23:50,982 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:23:50" (1/1) ... [2024-11-13 15:23:50,993 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:23:50" (1/1) ... [2024-11-13 15:23:51,006 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-13 15:23:51,008 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:23:50" (1/1) ... [2024-11-13 15:23:51,008 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:23:50" (1/1) ... [2024-11-13 15:23:51,034 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:23:50" (1/1) ... [2024-11-13 15:23:51,038 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:23:50" (1/1) ... [2024-11-13 15:23:51,041 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:23:50" (1/1) ... [2024-11-13 15:23:51,043 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:23:50" (1/1) ... [2024-11-13 15:23:51,047 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 15:23:51,048 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 15:23:51,049 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 15:23:51,049 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 15:23:51,050 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:23:50" (1/1) ... [2024-11-13 15:23:51,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:23:51,071 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:23:51,091 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 15:23:51,101 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 15:23:51,132 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 15:23:51,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-13 15:23:51,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-13 15:23:51,136 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-13 15:23:51,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-13 15:23:51,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-13 15:23:51,136 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-13 15:23:51,136 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 15:23:51,136 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 15:23:51,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 15:23:51,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 15:23:51,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 15:23:51,329 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 15:23:51,332 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 15:23:52,125 INFO L? ?]: Removed 96 outVars from TransFormulas that were not future-live. [2024-11-13 15:23:52,125 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 15:23:52,143 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 15:23:52,145 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 15:23:52,146 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:23:52 BoogieIcfgContainer [2024-11-13 15:23:52,146 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 15:23:52,149 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 15:23:52,149 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 15:23:52,155 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 15:23:52,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 03:23:50" (1/3) ... [2024-11-13 15:23:52,156 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@876657a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:23:52, skipping insertion in model container [2024-11-13 15:23:52,157 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:23:50" (2/3) ... [2024-11-13 15:23:52,158 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@876657a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:23:52, skipping insertion in model container [2024-11-13 15:23:52,159 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:23:52" (3/3) ... [2024-11-13 15:23:52,160 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-67.i [2024-11-13 15:23:52,180 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 15:23:52,181 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-67.i that has 2 procedures, 93 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 15:23:52,288 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 15:23:52,308 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;@74c6604d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 15:23:52,309 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 15:23:52,314 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 78 states have (on average 1.3974358974358974) internal successors, (109), 79 states have internal predecessors, (109), 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-13 15:23:52,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-13 15:23:52,329 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:23:52,330 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:23:52,334 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:23:52,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:23:52,340 INFO L85 PathProgramCache]: Analyzing trace with hash -30023356, now seen corresponding path program 1 times [2024-11-13 15:23:52,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:23:52,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104919886] [2024-11-13 15:23:52,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:23:52,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:23:52,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:23:52,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:23:52,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:23:52,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 15:23:52,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:23:52,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:23:52,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:23:52,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:23:52,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:23:52,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 15:23:52,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:23:52,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 15:23:52,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:23:52,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 15:23:52,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:23:52,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 15:23:52,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:23:52,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 15:23:52,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:23:52,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 15:23:52,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:23:52,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:23:52,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:23:52,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 15:23:52,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:23:52,896 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-13 15:23:52,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:23:52,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104919886] [2024-11-13 15:23:52,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104919886] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:23:52,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:23:52,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:23:52,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835966781] [2024-11-13 15:23:52,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:23:52,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 15:23:52,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:23:52,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 15:23:52,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 15:23:52,948 INFO L87 Difference]: Start difference. First operand has 93 states, 78 states have (on average 1.3974358974358974) internal successors, (109), 79 states have internal predecessors, (109), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-13 15:23:52,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:23:52,994 INFO L93 Difference]: Finished difference Result 179 states and 272 transitions. [2024-11-13 15:23:52,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 15:23:52,998 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 104 [2024-11-13 15:23:52,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:23:53,006 INFO L225 Difference]: With dead ends: 179 [2024-11-13 15:23:53,007 INFO L226 Difference]: Without dead ends: 89 [2024-11-13 15:23:53,013 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 15:23:53,018 INFO L432 NwaCegarLoop]: 126 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, 126 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-13 15:23:53,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:23:53,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-13 15:23:53,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-13 15:23:53,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 75 states have (on average 1.36) internal successors, (102), 75 states have internal predecessors, (102), 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-13 15:23:53,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 126 transitions. [2024-11-13 15:23:53,075 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 126 transitions. Word has length 104 [2024-11-13 15:23:53,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:23:53,077 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 126 transitions. [2024-11-13 15:23:53,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-13 15:23:53,078 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 126 transitions. [2024-11-13 15:23:53,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-13 15:23:53,086 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:23:53,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-13 15:23:53,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 15:23:53,087 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:23:53,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:23:53,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1205498520, now seen corresponding path program 1 times [2024-11-13 15:23:53,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:23:53,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684556383] [2024-11-13 15:23:53,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:23:53,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:23:53,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:23:53,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:23:53,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:23:53,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 15:23:53,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:23:53,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:23:53,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:23:53,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:23:53,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:23:53,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 15:23:53,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:23:53,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 15:23:53,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:23:53,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 15:23:53,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:23:53,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 15:23:53,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:23:53,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 15:23:53,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:23:53,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 15:23:53,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:23:53,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:23:53,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:23:53,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 15:23:53,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:23:53,693 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-13 15:23:53,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:23:53,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684556383] [2024-11-13 15:23:53,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684556383] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:23:53,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:23:53,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:23:53,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330084339] [2024-11-13 15:23:53,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:23:53,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:23:53,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:23:53,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:23:53,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:23:53,698 INFO L87 Difference]: Start difference. First operand 89 states and 126 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 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-13 15:23:53,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:23:53,783 INFO L93 Difference]: Finished difference Result 225 states and 321 transitions. [2024-11-13 15:23:53,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:23:53,784 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 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-13 15:23:53,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:23:53,787 INFO L225 Difference]: With dead ends: 225 [2024-11-13 15:23:53,787 INFO L226 Difference]: Without dead ends: 139 [2024-11-13 15:23:53,788 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:23:53,789 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 63 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:23:53,789 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 246 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:23:53,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-13 15:23:53,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 105. [2024-11-13 15:23:53,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 91 states have (on average 1.3846153846153846) internal successors, (126), 91 states have internal predecessors, (126), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-13 15:23:53,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 150 transitions. [2024-11-13 15:23:53,804 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 150 transitions. Word has length 104 [2024-11-13 15:23:53,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:23:53,807 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 150 transitions. [2024-11-13 15:23:53,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 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-13 15:23:53,808 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 150 transitions. [2024-11-13 15:23:53,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-13 15:23:53,810 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:23:53,810 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-13 15:23:53,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 15:23:53,810 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:23:53,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:23:53,811 INFO L85 PathProgramCache]: Analyzing trace with hash -74365158, now seen corresponding path program 1 times [2024-11-13 15:23:53,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:23:53,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828789753] [2024-11-13 15:23:53,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:23:53,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:23:53,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:23:54,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:23:54,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:23:54,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 15:23:54,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:23:54,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:23:54,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:23:54,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:23:54,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:23:54,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 15:23:54,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:23:54,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 15:23:54,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:23:54,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 15:23:54,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:23:54,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 15:23:54,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:23:54,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 15:23:54,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:23:54,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 15:23:54,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:23:54,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:23:54,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:23:54,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 15:23:54,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:23:54,392 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-13 15:23:54,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:23:54,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828789753] [2024-11-13 15:23:54,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828789753] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:23:54,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:23:54,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:23:54,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129086672] [2024-11-13 15:23:54,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:23:54,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:23:54,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:23:54,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:23:54,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:23:54,395 INFO L87 Difference]: Start difference. First operand 105 states and 150 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 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-13 15:23:54,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:23:54,460 INFO L93 Difference]: Finished difference Result 209 states and 300 transitions. [2024-11-13 15:23:54,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:23:54,461 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 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-13 15:23:54,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:23:54,463 INFO L225 Difference]: With dead ends: 209 [2024-11-13 15:23:54,463 INFO L226 Difference]: Without dead ends: 107 [2024-11-13 15:23:54,464 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:23:54,465 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 361 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-13 15:23:54,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 361 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:23:54,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-13 15:23:54,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-11-13 15:23:54,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 93 states have (on average 1.3763440860215055) internal successors, (128), 93 states have internal predecessors, (128), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-13 15:23:54,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 152 transitions. [2024-11-13 15:23:54,476 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 152 transitions. Word has length 104 [2024-11-13 15:23:54,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:23:54,477 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 152 transitions. [2024-11-13 15:23:54,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 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-13 15:23:54,477 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 152 transitions. [2024-11-13 15:23:54,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-13 15:23:54,479 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:23:54,479 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-13 15:23:54,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 15:23:54,480 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:23:54,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:23:54,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1284030442, now seen corresponding path program 1 times [2024-11-13 15:23:54,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:23:54,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036842839] [2024-11-13 15:23:54,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:23:54,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:23:54,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:23:54,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:23:54,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:23:54,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 15:23:54,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:23:54,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:23:54,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:23:54,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:23:54,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:23:54,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 15:23:54,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:23:54,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 15:23:54,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:23:54,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 15:23:54,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:23:54,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 15:23:54,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:23:54,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 15:23:54,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:23:54,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 15:23:54,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:23:54,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:23:54,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:23:54,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 15:23:54,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:23:54,813 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-13 15:23:54,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:23:54,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036842839] [2024-11-13 15:23:54,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036842839] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:23:54,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:23:54,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:23:54,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463782392] [2024-11-13 15:23:54,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:23:54,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:23:54,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:23:54,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:23:54,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:23:54,817 INFO L87 Difference]: Start difference. First operand 107 states and 152 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 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-13 15:23:54,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:23:54,884 INFO L93 Difference]: Finished difference Result 214 states and 305 transitions. [2024-11-13 15:23:54,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:23:54,887 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 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-13 15:23:54,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:23:54,889 INFO L225 Difference]: With dead ends: 214 [2024-11-13 15:23:54,893 INFO L226 Difference]: Without dead ends: 110 [2024-11-13 15:23:54,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:23:54,894 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 1 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:23:54,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 358 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:23:54,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-13 15:23:54,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2024-11-13 15:23:54,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 95 states have (on average 1.368421052631579) internal successors, (130), 95 states have internal predecessors, (130), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-13 15:23:54,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 154 transitions. [2024-11-13 15:23:54,917 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 154 transitions. Word has length 104 [2024-11-13 15:23:54,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:23:54,918 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 154 transitions. [2024-11-13 15:23:54,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 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-13 15:23:54,918 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 154 transitions. [2024-11-13 15:23:54,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-13 15:23:54,919 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:23:54,920 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-13 15:23:54,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 15:23:54,920 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:23:54,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:23:54,920 INFO L85 PathProgramCache]: Analyzing trace with hash -603972072, now seen corresponding path program 1 times [2024-11-13 15:23:54,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:23:54,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708427890] [2024-11-13 15:23:54,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:23:54,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:23:55,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:23:55,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:23:55,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:23:55,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 15:23:55,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:23:55,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:23:55,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:23:55,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:23:55,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:23:55,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 15:23:55,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:23:55,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 15:23:55,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:23:55,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 15:23:55,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:23:55,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 15:23:55,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:23:55,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 15:23:55,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:23:55,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 15:23:55,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:23:55,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:23:55,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:23:55,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 15:23:55,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:23:55,288 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-13 15:23:55,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:23:55,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708427890] [2024-11-13 15:23:55,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708427890] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:23:55,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:23:55,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:23:55,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514114122] [2024-11-13 15:23:55,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:23:55,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:23:55,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:23:55,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:23:55,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:23:55,293 INFO L87 Difference]: Start difference. First operand 109 states and 154 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 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-13 15:23:55,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:23:55,340 INFO L93 Difference]: Finished difference Result 218 states and 309 transitions. [2024-11-13 15:23:55,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:23:55,341 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 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-13 15:23:55,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:23:55,345 INFO L225 Difference]: With dead ends: 218 [2024-11-13 15:23:55,345 INFO L226 Difference]: Without dead ends: 112 [2024-11-13 15:23:55,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:23:55,346 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 1 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:23:55,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 359 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:23:55,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-13 15:23:55,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2024-11-13 15:23:55,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 97 states have (on average 1.3608247422680413) internal successors, (132), 97 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-13 15:23:55,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 156 transitions. [2024-11-13 15:23:55,368 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 156 transitions. Word has length 104 [2024-11-13 15:23:55,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:23:55,369 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 156 transitions. [2024-11-13 15:23:55,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 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-13 15:23:55,372 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 156 transitions. [2024-11-13 15:23:55,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-13 15:23:55,373 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:23:55,373 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-13 15:23:55,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 15:23:55,374 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:23:55,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:23:55,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1171035290, now seen corresponding path program 1 times [2024-11-13 15:23:55,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:23:55,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441333043] [2024-11-13 15:23:55,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:23:55,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:23:55,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:23:55,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:23:55,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:23:55,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 15:23:55,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:23:55,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:23:55,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:23:55,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:23:55,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:23:55,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 15:23:55,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:23:55,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 15:23:55,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:23:55,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 15:23:55,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:23:55,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 15:23:55,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:23:55,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 15:23:55,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:23:55,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 15:23:55,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:23:55,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:23:55,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:23:55,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 15:23:55,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:23:55,711 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-13 15:23:55,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:23:55,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441333043] [2024-11-13 15:23:55,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441333043] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:23:55,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:23:55,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:23:55,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659340858] [2024-11-13 15:23:55,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:23:55,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:23:55,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:23:55,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:23:55,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:23:55,717 INFO L87 Difference]: Start difference. First operand 111 states and 156 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 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-13 15:23:55,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:23:55,767 INFO L93 Difference]: Finished difference Result 222 states and 313 transitions. [2024-11-13 15:23:55,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:23:55,768 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 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-13 15:23:55,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:23:55,769 INFO L225 Difference]: With dead ends: 222 [2024-11-13 15:23:55,769 INFO L226 Difference]: Without dead ends: 114 [2024-11-13 15:23:55,770 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:23:55,771 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 1 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:23:55,773 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 361 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:23:55,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-13 15:23:55,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2024-11-13 15:23:55,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 99 states have (on average 1.3535353535353536) internal successors, (134), 99 states have internal predecessors, (134), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-13 15:23:55,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 158 transitions. [2024-11-13 15:23:55,792 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 158 transitions. Word has length 104 [2024-11-13 15:23:55,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:23:55,796 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 158 transitions. [2024-11-13 15:23:55,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 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-13 15:23:55,796 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 158 transitions. [2024-11-13 15:23:55,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-13 15:23:55,798 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:23:55,798 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-13 15:23:55,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 15:23:55,798 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:23:55,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:23:55,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1172882332, now seen corresponding path program 1 times [2024-11-13 15:23:55,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:23:55,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692458752] [2024-11-13 15:23:55,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:23:55,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:23:56,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:24:09,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:24:09,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:24:09,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 15:24:09,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:24:10,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:24:10,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:24:10,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:24:10,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:24:10,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 15:24:10,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:24:10,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 15:24:10,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:24:10,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 15:24:10,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:24:10,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 15:24:10,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:24:10,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 15:24:10,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:24:10,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 15:24:10,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:24:10,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:24:10,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:24:10,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 15:24:10,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:24:10,520 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 3 proven. 30 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-13 15:24:10,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:24:10,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692458752] [2024-11-13 15:24:10,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692458752] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:24:10,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464669783] [2024-11-13 15:24:10,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:24:10,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:24:10,522 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:24:10,525 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:24:10,528 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 15:24:10,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:24:10,979 INFO L255 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 106 conjuncts are in the unsatisfiable core [2024-11-13 15:24:10,996 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:24:11,635 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-13 15:24:14,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2024-11-13 15:24:16,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 31 [2024-11-13 15:24:18,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 31 [2024-11-13 15:24:19,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 31 [2024-11-13 15:24:20,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 31 [2024-11-13 15:24:21,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 185 treesize of output 133 [2024-11-13 15:24:21,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:24:21,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:24:21,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 125 [2024-11-13 15:24:21,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:24:21,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:24:21,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 24 [2024-11-13 15:24:23,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:24:23,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:24:23,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:24:23,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:24:23,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:24:23,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 45 [2024-11-13 15:24:23,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:24:23,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:24:23,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:24:23,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:24:23,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:24:23,545 INFO L349 Elim1Store]: treesize reduction 80, result has 19.2 percent of original size [2024-11-13 15:24:23,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 110 treesize of output 132 [2024-11-13 15:24:23,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:24:23,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:24:23,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 35 [2024-11-13 15:24:23,850 INFO L349 Elim1Store]: treesize reduction 32, result has 52.2 percent of original size [2024-11-13 15:24:23,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 151 treesize of output 149 [2024-11-13 15:24:24,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:24:24,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:24:24,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 51 [2024-11-13 15:24:24,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:24:24,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:24:24,371 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-11-13 15:24:24,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 58 [2024-11-13 15:24:24,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:24:24,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:24:24,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 51 [2024-11-13 15:24:24,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:24:24,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:24:24,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 51 [2024-11-13 15:24:24,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 75 [2024-11-13 15:24:24,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:24:24,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:24:24,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 51 [2024-11-13 15:24:24,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:24:24,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:24:24,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:24:24,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:24:24,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:24:24,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:24:24,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:24:24,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:24:24,791 INFO L349 Elim1Store]: treesize reduction 235, result has 0.4 percent of original size [2024-11-13 15:24:24,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 360 treesize of output 321 [2024-11-13 15:24:24,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:24:24,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:24:24,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:24:24,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:24:24,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:24:24,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:24:24,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:24:24,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:24:24,894 INFO L349 Elim1Store]: treesize reduction 170, result has 0.6 percent of original size [2024-11-13 15:24:24,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 128 treesize of output 140 [2024-11-13 15:24:24,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:24:24,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:24:24,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:24:24,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:24:24,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:24:24,947 INFO L349 Elim1Store]: treesize reduction 98, result has 1.0 percent of original size [2024-11-13 15:24:24,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 110 treesize of output 114 [2024-11-13 15:24:24,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:24:24,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:24:24,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:24:24,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:24:24,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:24:24,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:24:25,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:24:25,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:24:25,030 INFO L349 Elim1Store]: treesize reduction 235, result has 0.4 percent of original size [2024-11-13 15:24:25,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 200 treesize of output 237 [2024-11-13 15:24:25,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:24:25,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:24:25,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:24:25,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:24:25,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:24:25,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:24:25,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:24:25,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:24:25,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:24:25,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:24:25,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:24:25,177 INFO L349 Elim1Store]: treesize reduction 362, result has 0.3 percent of original size [2024-11-13 15:24:25,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 236 treesize of output 274 [2024-11-13 15:24:25,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:24:25,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:24:25,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:24:25,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:24:25,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:24:25,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 47 [2024-11-13 15:24:25,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:24:25,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:24:25,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 271 treesize of output 135 [2024-11-13 15:24:25,904 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 48 proven. 125 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-13 15:24:25,904 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:25:23,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464669783] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:25:23,983 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:25:23,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 27] total 44 [2024-11-13 15:25:23,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304383399] [2024-11-13 15:25:23,983 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:25:23,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-13 15:25:23,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:25:23,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-13 15:25:23,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=336, Invalid=2203, Unknown=11, NotChecked=0, Total=2550 [2024-11-13 15:25:23,988 INFO L87 Difference]: Start difference. First operand 113 states and 158 transitions. Second operand has 44 states, 40 states have (on average 2.475) internal successors, (99), 39 states have internal predecessors, (99), 9 states have call successors, (24), 6 states have call predecessors, (24), 8 states have return successors, (24), 8 states have call predecessors, (24), 9 states have call successors, (24) [2024-11-13 15:25:38,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:25:38,583 INFO L93 Difference]: Finished difference Result 389 states and 528 transitions. [2024-11-13 15:25:38,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-13 15:25:38,584 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 40 states have (on average 2.475) internal successors, (99), 39 states have internal predecessors, (99), 9 states have call successors, (24), 6 states have call predecessors, (24), 8 states have return successors, (24), 8 states have call predecessors, (24), 9 states have call successors, (24) Word has length 104 [2024-11-13 15:25:38,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:25:38,586 INFO L225 Difference]: With dead ends: 389 [2024-11-13 15:25:38,586 INFO L226 Difference]: Without dead ends: 279 [2024-11-13 15:25:38,589 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1254 ImplicationChecksByTransitivity, 67.9s TimeCoverageRelationStatistics Valid=825, Invalid=3994, Unknown=11, NotChecked=0, Total=4830 [2024-11-13 15:25:38,590 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 1121 mSDsluCounter, 1796 mSDsCounter, 0 mSdLazyCounter, 2804 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1125 SdHoareTripleChecker+Valid, 1898 SdHoareTripleChecker+Invalid, 2948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 2804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2024-11-13 15:25:38,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1125 Valid, 1898 Invalid, 2948 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [144 Valid, 2804 Invalid, 0 Unknown, 0 Unchecked, 8.5s Time] [2024-11-13 15:25:38,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2024-11-13 15:25:38,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 123. [2024-11-13 15:25:38,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 106 states have (on average 1.320754716981132) internal successors, (140), 106 states have internal predecessors, (140), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-13 15:25:38,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 164 transitions. [2024-11-13 15:25:38,629 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 164 transitions. Word has length 104 [2024-11-13 15:25:38,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:25:38,629 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 164 transitions. [2024-11-13 15:25:38,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 40 states have (on average 2.475) internal successors, (99), 39 states have internal predecessors, (99), 9 states have call successors, (24), 6 states have call predecessors, (24), 8 states have return successors, (24), 8 states have call predecessors, (24), 9 states have call successors, (24) [2024-11-13 15:25:38,629 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 164 transitions. [2024-11-13 15:25:38,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-13 15:25:38,638 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:25:38,638 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-13 15:25:38,664 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 15:25:38,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:25:38,839 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:25:38,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:25:38,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1193096273, now seen corresponding path program 1 times [2024-11-13 15:25:38,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:25:38,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284271450] [2024-11-13 15:25:38,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:25:38,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:25:38,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:25:39,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:25:39,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:25:39,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 15:25:39,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:25:39,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:25:39,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:25:39,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:25:39,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:25:39,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 15:25:39,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:25:39,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 15:25:39,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:25:39,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 15:25:39,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:25:39,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 15:25:39,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:25:39,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 15:25:39,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:25:39,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 15:25:39,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:25:39,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:25:39,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:25:39,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 15:25:39,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:25:39,771 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-13 15:25:39,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:25:39,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284271450] [2024-11-13 15:25:39,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284271450] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:25:39,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:25:39,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:25:39,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934905747] [2024-11-13 15:25:39,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:25:39,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:25:39,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:25:39,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:25:39,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:25:39,777 INFO L87 Difference]: Start difference. First operand 123 states and 164 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (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-13 15:25:40,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:25:40,182 INFO L93 Difference]: Finished difference Result 348 states and 463 transitions. [2024-11-13 15:25:40,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:25:40,183 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (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-13 15:25:40,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:25:40,185 INFO L225 Difference]: With dead ends: 348 [2024-11-13 15:25:40,188 INFO L226 Difference]: Without dead ends: 228 [2024-11-13 15:25:40,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 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-13 15:25:40,190 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 100 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 15:25:40,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 297 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 15:25:40,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-11-13 15:25:40,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 188. [2024-11-13 15:25:40,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 155 states have (on average 1.2903225806451613) internal successors, (200), 155 states have internal predecessors, (200), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-13 15:25:40,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 248 transitions. [2024-11-13 15:25:40,244 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 248 transitions. Word has length 108 [2024-11-13 15:25:40,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:25:40,245 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 248 transitions. [2024-11-13 15:25:40,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (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-13 15:25:40,245 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 248 transitions. [2024-11-13 15:25:40,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-13 15:25:40,247 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:25:40,247 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-13 15:25:40,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 15:25:40,248 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:25:40,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:25:40,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1427380565, now seen corresponding path program 1 times [2024-11-13 15:25:40,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:25:40,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422210041] [2024-11-13 15:25:40,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:25:40,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:25:40,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:25:42,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:25:42,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:25:42,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 15:25:42,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:25:42,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:25:42,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:25:42,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:25:42,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:25:42,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 15:25:42,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:25:42,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 15:25:42,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:25:42,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 15:25:42,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:25:42,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 15:25:42,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:25:42,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 15:25:42,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:25:42,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 15:25:42,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:25:42,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:25:42,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:25:42,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 15:25:42,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:25:42,824 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-13 15:25:42,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:25:42,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422210041] [2024-11-13 15:25:42,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422210041] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:25:42,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:25:42,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 15:25:42,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722658812] [2024-11-13 15:25:42,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:25:42,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 15:25:42,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:25:42,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 15:25:42,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-13 15:25:42,826 INFO L87 Difference]: Start difference. First operand 188 states and 248 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 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-13 15:25:44,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:25:44,393 INFO L93 Difference]: Finished difference Result 382 states and 512 transitions. [2024-11-13 15:25:44,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 15:25:44,394 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 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-13 15:25:44,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:25:44,395 INFO L225 Difference]: With dead ends: 382 [2024-11-13 15:25:44,395 INFO L226 Difference]: Without dead ends: 262 [2024-11-13 15:25:44,396 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2024-11-13 15:25:44,396 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 220 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:25:44,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 526 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-13 15:25:44,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-11-13 15:25:44,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 227. [2024-11-13 15:25:44,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 194 states have (on average 1.324742268041237) internal successors, (257), 194 states have internal predecessors, (257), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-13 15:25:44,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 305 transitions. [2024-11-13 15:25:44,442 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 305 transitions. Word has length 108 [2024-11-13 15:25:44,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:25:44,443 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 305 transitions. [2024-11-13 15:25:44,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 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-13 15:25:44,443 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 305 transitions. [2024-11-13 15:25:44,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-13 15:25:44,444 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:25:44,445 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-13 15:25:44,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 15:25:44,445 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:25:44,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:25:44,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1849022544, now seen corresponding path program 1 times [2024-11-13 15:25:44,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:25:44,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092786991] [2024-11-13 15:25:44,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:25:44,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:25:44,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:25:48,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:25:48,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:25:48,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 15:25:48,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:25:48,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:25:48,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:25:48,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:25:48,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:25:48,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 15:25:48,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:25:48,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 15:25:48,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:25:48,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 15:25:48,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:25:48,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 15:25:48,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:25:48,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 15:25:48,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:25:49,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 15:25:49,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:25:49,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:25:49,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:25:49,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 15:25:49,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:25:49,046 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-13 15:25:49,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:25:49,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092786991] [2024-11-13 15:25:49,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092786991] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:25:49,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:25:49,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-13 15:25:49,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510935545] [2024-11-13 15:25:49,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:25:49,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-13 15:25:49,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:25:49,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-13 15:25:49,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-11-13 15:25:49,049 INFO L87 Difference]: Start difference. First operand 227 states and 305 transitions. Second operand has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 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-13 15:25:51,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:25:51,749 INFO L93 Difference]: Finished difference Result 446 states and 607 transitions. [2024-11-13 15:25:51,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 15:25:51,749 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 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 110 [2024-11-13 15:25:51,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:25:51,752 INFO L225 Difference]: With dead ends: 446 [2024-11-13 15:25:51,752 INFO L226 Difference]: Without dead ends: 297 [2024-11-13 15:25:51,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2024-11-13 15:25:51,754 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 252 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-13 15:25:51,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 457 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-13 15:25:51,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2024-11-13 15:25:51,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 266. [2024-11-13 15:25:51,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 233 states have (on average 1.3562231759656653) internal successors, (316), 233 states have internal predecessors, (316), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-13 15:25:51,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 364 transitions. [2024-11-13 15:25:51,810 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 364 transitions. Word has length 110 [2024-11-13 15:25:51,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:25:51,810 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 364 transitions. [2024-11-13 15:25:51,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 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-13 15:25:51,811 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 364 transitions. [2024-11-13 15:25:51,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-13 15:25:51,812 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:25:51,812 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-13 15:25:51,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 15:25:51,813 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:25:51,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:25:51,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1896898096, now seen corresponding path program 1 times [2024-11-13 15:25:51,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:25:51,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547396028] [2024-11-13 15:25:51,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:25:51,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:25:51,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:25:54,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:25:54,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:25:54,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 15:25:54,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:25:54,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:25:54,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:25:54,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:25:54,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:25:54,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 15:25:54,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:25:54,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 15:25:54,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:25:54,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 15:25:54,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:25:54,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 15:25:54,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:25:54,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 15:25:54,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:25:54,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 15:25:54,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:25:54,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:25:54,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:25:54,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 15:25:54,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:25:54,978 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-13 15:25:54,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:25:54,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547396028] [2024-11-13 15:25:54,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547396028] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:25:54,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:25:54,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-13 15:25:54,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335936281] [2024-11-13 15:25:54,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:25:54,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 15:25:54,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:25:54,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 15:25:54,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-13 15:25:54,981 INFO L87 Difference]: Start difference. First operand 266 states and 364 transitions. Second operand has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 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-13 15:25:57,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:25:57,218 INFO L93 Difference]: Finished difference Result 480 states and 657 transitions. [2024-11-13 15:25:57,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 15:25:57,219 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 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-13 15:25:57,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:25:57,222 INFO L225 Difference]: With dead ends: 480 [2024-11-13 15:25:57,222 INFO L226 Difference]: Without dead ends: 303 [2024-11-13 15:25:57,222 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2024-11-13 15:25:57,223 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 287 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-13 15:25:57,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 533 Invalid, 751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 734 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-13 15:25:57,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-11-13 15:25:57,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 268. [2024-11-13 15:25:57,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 235 states have (on average 1.353191489361702) internal successors, (318), 235 states have internal predecessors, (318), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-13 15:25:57,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 366 transitions. [2024-11-13 15:25:57,273 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 366 transitions. Word has length 110 [2024-11-13 15:25:57,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:25:57,274 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 366 transitions. [2024-11-13 15:25:57,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 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-13 15:25:57,274 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 366 transitions. [2024-11-13 15:25:57,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-13 15:25:57,275 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:25:57,276 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-13 15:25:57,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 15:25:57,276 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:25:57,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:25:57,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1278678056, now seen corresponding path program 1 times [2024-11-13 15:25:57,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:25:57,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896478235] [2024-11-13 15:25:57,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:25:57,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:25:57,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:25:59,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:25:59,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:25:59,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 15:25:59,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:25:59,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:25:59,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:25:59,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:25:59,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:25:59,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 15:25:59,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:25:59,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 15:25:59,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:25:59,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 15:25:59,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:25:59,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 15:25:59,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:26:00,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 15:26:00,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:26:00,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 15:26:00,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:26:00,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:26:00,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:26:00,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 15:26:00,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:26:00,059 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-13 15:26:00,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:26:00,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896478235] [2024-11-13 15:26:00,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896478235] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:26:00,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:26:00,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 15:26:00,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608958564] [2024-11-13 15:26:00,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:26:00,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 15:26:00,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:26:00,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 15:26:00,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-13 15:26:00,062 INFO L87 Difference]: Start difference. First operand 268 states and 366 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 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-13 15:26:01,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:26:01,248 INFO L93 Difference]: Finished difference Result 525 states and 721 transitions. [2024-11-13 15:26:01,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 15:26:01,249 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 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 111 [2024-11-13 15:26:01,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:26:01,251 INFO L225 Difference]: With dead ends: 525 [2024-11-13 15:26:01,251 INFO L226 Difference]: Without dead ends: 346 [2024-11-13 15:26:01,252 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-13 15:26:01,252 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 378 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-13 15:26:01,253 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 272 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-13 15:26:01,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2024-11-13 15:26:01,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 306. [2024-11-13 15:26:01,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 273 states have (on average 1.36996336996337) internal successors, (374), 273 states have internal predecessors, (374), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-13 15:26:01,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 422 transitions. [2024-11-13 15:26:01,318 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 422 transitions. Word has length 111 [2024-11-13 15:26:01,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:26:01,319 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 422 transitions. [2024-11-13 15:26:01,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 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-13 15:26:01,319 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 422 transitions. [2024-11-13 15:26:01,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-13 15:26:01,321 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:26:01,321 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-13 15:26:01,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-13 15:26:01,321 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:26:01,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:26:01,322 INFO L85 PathProgramCache]: Analyzing trace with hash 216116185, now seen corresponding path program 1 times [2024-11-13 15:26:01,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:26:01,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775237800] [2024-11-13 15:26:01,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:26:01,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:26:01,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:26:03,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:26:03,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:26:03,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 15:26:03,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:26:03,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:26:03,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:26:03,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:26:03,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:26:03,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 15:26:03,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:26:03,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 15:26:03,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:26:03,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 15:26:03,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:26:03,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 15:26:03,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:26:03,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 15:26:03,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:26:03,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 15:26:03,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:26:03,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:26:03,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:26:03,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 15:26:03,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:26:03,731 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-13 15:26:03,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:26:03,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775237800] [2024-11-13 15:26:03,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775237800] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:26:03,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:26:03,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 15:26:03,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479271824] [2024-11-13 15:26:03,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:26:03,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 15:26:03,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:26:03,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 15:26:03,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-13 15:26:03,734 INFO L87 Difference]: Start difference. First operand 306 states and 422 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 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-13 15:26:05,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:26:05,054 INFO L93 Difference]: Finished difference Result 549 states and 755 transitions. [2024-11-13 15:26:05,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 15:26:05,055 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 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 111 [2024-11-13 15:26:05,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:26:05,058 INFO L225 Difference]: With dead ends: 549 [2024-11-13 15:26:05,058 INFO L226 Difference]: Without dead ends: 344 [2024-11-13 15:26:05,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-11-13 15:26:05,059 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 219 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-13 15:26:05,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 366 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-13 15:26:05,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2024-11-13 15:26:05,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 306. [2024-11-13 15:26:05,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 273 states have (on average 1.3626373626373627) internal successors, (372), 273 states have internal predecessors, (372), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-13 15:26:05,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 420 transitions. [2024-11-13 15:26:05,126 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 420 transitions. Word has length 111 [2024-11-13 15:26:05,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:26:05,127 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 420 transitions. [2024-11-13 15:26:05,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 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-13 15:26:05,127 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 420 transitions. [2024-11-13 15:26:05,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-13 15:26:05,128 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:26:05,129 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-13 15:26:05,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-13 15:26:05,129 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:26:05,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:26:05,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1381475708, now seen corresponding path program 1 times [2024-11-13 15:26:05,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:26:05,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458828873] [2024-11-13 15:26:05,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:26:05,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:26:05,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:26:06,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:26:06,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:26:06,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 15:26:06,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:26:06,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:26:06,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:26:06,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:26:06,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:26:07,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 15:26:07,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:26:07,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 15:26:07,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:26:07,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 15:26:07,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:26:07,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 15:26:07,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:26:07,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 15:26:07,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:26:07,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 15:26:07,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:26:07,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:26:07,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:26:07,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 15:26:07,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:26:07,084 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-13 15:26:07,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:26:07,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458828873] [2024-11-13 15:26:07,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458828873] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:26:07,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:26:07,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-13 15:26:07,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903300604] [2024-11-13 15:26:07,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:26:07,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 15:26:07,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:26:07,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 15:26:07,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-13 15:26:07,088 INFO L87 Difference]: Start difference. First operand 306 states and 420 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-13 15:26:08,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:26:08,225 INFO L93 Difference]: Finished difference Result 625 states and 833 transitions. [2024-11-13 15:26:08,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 15:26:08,226 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 112 [2024-11-13 15:26:08,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:26:08,229 INFO L225 Difference]: With dead ends: 625 [2024-11-13 15:26:08,229 INFO L226 Difference]: Without dead ends: 420 [2024-11-13 15:26:08,230 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2024-11-13 15:26:08,230 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 497 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-13 15:26:08,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [498 Valid, 285 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-13 15:26:08,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2024-11-13 15:26:08,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 417. [2024-11-13 15:26:08,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 373 states have (on average 1.3056300268096515) internal successors, (487), 374 states have internal predecessors, (487), 30 states have call successors, (30), 13 states have call predecessors, (30), 13 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-13 15:26:08,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 547 transitions. [2024-11-13 15:26:08,314 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 547 transitions. Word has length 112 [2024-11-13 15:26:08,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:26:08,314 INFO L471 AbstractCegarLoop]: Abstraction has 417 states and 547 transitions. [2024-11-13 15:26:08,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-13 15:26:08,314 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 547 transitions. [2024-11-13 15:26:08,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-13 15:26:08,316 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:26:08,316 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-13 15:26:08,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-13 15:26:08,316 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:26:08,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:26:08,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1055210037, now seen corresponding path program 1 times [2024-11-13 15:26:08,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:26:08,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937506445] [2024-11-13 15:26:08,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:26:08,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:26:08,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:26:09,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:26:09,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:26:09,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 15:26:09,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:26:09,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 15:26:09,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:26:09,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 15:26:09,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:26:09,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 15:26:09,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:26:09,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 15:26:09,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:26:09,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 15:26:09,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:26:09,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 15:26:09,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:26:09,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 15:26:09,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:26:09,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 15:26:09,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:26:09,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:26:09,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:26:09,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-13 15:26:09,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:26:09,328 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-13 15:26:09,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:26:09,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937506445] [2024-11-13 15:26:09,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937506445] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:26:09,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:26:09,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 15:26:09,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716436675] [2024-11-13 15:26:09,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:26:09,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 15:26:09,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:26:09,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 15:26:09,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-13 15:26:09,330 INFO L87 Difference]: Start difference. First operand 417 states and 547 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-13 15:26:10,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:26:10,496 INFO L93 Difference]: Finished difference Result 425 states and 556 transitions. [2024-11-13 15:26:10,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 15:26:10,497 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-13 15:26:10,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:26:10,502 INFO L225 Difference]: With dead ends: 425 [2024-11-13 15:26:10,502 INFO L226 Difference]: Without dead ends: 423 [2024-11-13 15:26:10,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2024-11-13 15:26:10,503 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 150 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-13 15:26:10,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 482 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-13 15:26:10,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2024-11-13 15:26:10,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 423. [2024-11-13 15:26:10,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 379 states have (on average 1.3007915567282322) internal successors, (493), 380 states have internal predecessors, (493), 30 states have call successors, (30), 13 states have call predecessors, (30), 13 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-13 15:26:10,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 553 transitions. [2024-11-13 15:26:10,617 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 553 transitions. Word has length 112 [2024-11-13 15:26:10,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:26:10,618 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 553 transitions. [2024-11-13 15:26:10,618 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-13 15:26:10,618 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 553 transitions. [2024-11-13 15:26:10,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-13 15:26:10,620 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:26:10,620 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-13 15:26:10,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-13 15:26:10,621 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:26:10,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:26:10,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1057057079, now seen corresponding path program 1 times [2024-11-13 15:26:10,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:26:10,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161981339] [2024-11-13 15:26:10,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:26:10,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:26:10,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 15:26:10,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1845061320] [2024-11-13 15:26:10,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:26:10,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:26:10,856 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:26:10,858 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:26:10,860 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 15:26:11,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:26:11,715 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 15:26:12,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:26:12,385 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 15:26:12,385 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 15:26:12,386 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 15:26:12,400 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-13 15:26:12,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-13 15:26:12,591 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:26:12,712 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 15:26:12,715 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 03:26:12 BoogieIcfgContainer [2024-11-13 15:26:12,715 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 15:26:12,716 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 15:26:12,716 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 15:26:12,716 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 15:26:12,717 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:23:52" (3/4) ... [2024-11-13 15:26:12,720 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 15:26:12,721 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 15:26:12,722 INFO L158 Benchmark]: Toolchain (without parser) took 142206.18ms. Allocated memory was 117.4MB in the beginning and 520.1MB in the end (delta: 402.7MB). Free memory was 92.2MB in the beginning and 457.4MB in the end (delta: -365.2MB). Peak memory consumption was 37.4MB. Max. memory is 16.1GB. [2024-11-13 15:26:12,722 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 117.4MB. Free memory is still 74.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 15:26:12,722 INFO L158 Benchmark]: CACSL2BoogieTranslator took 359.06ms. Allocated memory is still 117.4MB. Free memory was 92.2MB in the beginning and 77.3MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 15:26:12,723 INFO L158 Benchmark]: Boogie Procedure Inliner took 87.28ms. Allocated memory is still 117.4MB. Free memory was 77.3MB in the beginning and 74.1MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 15:26:12,723 INFO L158 Benchmark]: Boogie Preprocessor took 80.16ms. Allocated memory is still 117.4MB. Free memory was 74.1MB in the beginning and 71.5MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 15:26:12,723 INFO L158 Benchmark]: RCFGBuilder took 1097.63ms. Allocated memory is still 117.4MB. Free memory was 71.5MB in the beginning and 41.9MB in the end (delta: 29.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-13 15:26:12,723 INFO L158 Benchmark]: TraceAbstraction took 140566.55ms. Allocated memory was 117.4MB in the beginning and 520.1MB in the end (delta: 402.7MB). Free memory was 41.4MB in the beginning and 457.4MB in the end (delta: -416.1MB). Peak memory consumption was 272.3MB. Max. memory is 16.1GB. [2024-11-13 15:26:12,724 INFO L158 Benchmark]: Witness Printer took 5.08ms. Allocated memory is still 520.1MB. Free memory was 457.4MB in the beginning and 457.4MB in the end (delta: 70.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 15:26:12,725 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.39ms. Allocated memory is still 117.4MB. Free memory is still 74.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 359.06ms. Allocated memory is still 117.4MB. Free memory was 92.2MB in the beginning and 77.3MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 87.28ms. Allocated memory is still 117.4MB. Free memory was 77.3MB in the beginning and 74.1MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 80.16ms. Allocated memory is still 117.4MB. Free memory was 74.1MB in the beginning and 71.5MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1097.63ms. Allocated memory is still 117.4MB. Free memory was 71.5MB in the beginning and 41.9MB in the end (delta: 29.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 140566.55ms. Allocated memory was 117.4MB in the beginning and 520.1MB in the end (delta: 402.7MB). Free memory was 41.4MB in the beginning and 457.4MB in the end (delta: -416.1MB). Peak memory consumption was 272.3MB. Max. memory is 16.1GB. * Witness Printer took 5.08ms. Allocated memory is still 520.1MB. Free memory was 457.4MB in the beginning and 457.4MB in the end (delta: 70.5kB). 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 123, overapproximation of someBinaryFLOATComparisonOperation at line 115, overapproximation of someBinaryFLOATComparisonOperation at line 115, overapproximation of someBinaryDOUBLEComparisonOperation at line 123. Possible FailurePath: [L36] unsigned char isInitial = 0; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 2, -64, 256, 128, 256, 50, 0, -4, 15.125, 0.9, 25.875, 50 }; [L51] signed short int* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L52] signed short int* WrapperStruct00_var_1_4_Pointer = &(WrapperStruct00.var_1_4); [L53] signed short int* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L54] unsigned short int* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L55] unsigned short int* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L56] signed long int* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L57] unsigned char* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L58] signed long int* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L59] float* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L60] float* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L61] double* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L62] unsigned short int* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L63] signed short int last_1_WrapperStruct00_var_1_1 = 2; [L64] unsigned short int last_1_WrapperStruct00_var_1_6 = 128; [L65] signed long int last_1_WrapperStruct00_var_1_8 = 50; VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=0, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L127] isInitial = 1 [L128] FCALL initially() [L129] COND TRUE 1 [L130] CALL updateLastVariables() [L118] EXPR WrapperStruct00.var_1_1 [L118] last_1_WrapperStruct00_var_1_1 = WrapperStruct00.var_1_1 [L119] EXPR WrapperStruct00.var_1_6 [L119] last_1_WrapperStruct00_var_1_6 = WrapperStruct00.var_1_6 [L120] EXPR WrapperStruct00.var_1_8 [L120] last_1_WrapperStruct00_var_1_8 = WrapperStruct00.var_1_8 [L130] RET updateLastVariables() [L131] CALL updateVariables() [L98] WrapperStruct00.var_1_4 = __VERIFIER_nondet_short() [L99] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= -16383) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= -16383) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L100] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 16383) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 16383) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L101] WrapperStruct00.var_1_5 = __VERIFIER_nondet_short() [L102] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= -16383) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= -16383) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L103] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 16383) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 16383) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L104] WrapperStruct00.var_1_7 = __VERIFIER_nondet_ushort() [L105] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L106] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 32767) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 32767) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L107] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L108] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L109] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L110] WrapperStruct00.var_1_10 = __VERIFIER_nondet_long() [L111] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= -2147483648) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= -2147483648) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L112] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L113] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_10 != 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_10 != 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L114] WrapperStruct00.var_1_12 = __VERIFIER_nondet_float() [L115] EXPR WrapperStruct00.var_1_12 [L115] EXPR WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F [L115] EXPR WrapperStruct00.var_1_12 [L115] EXPR WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L115] EXPR (WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L115] CALL assume_abort_if_not((WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L115] RET assume_abort_if_not((WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L131] RET updateVariables() [L132] CALL step() [L69] COND TRUE ! (last_1_WrapperStruct00_var_1_6 <= last_1_WrapperStruct00_var_1_1) [L70] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L70] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L70] (*(WrapperStruct00_var_1_1_Pointer)) = ((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer))) [L72] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L72] signed long int stepLocal_0 = 1 * (*(WrapperStruct00_var_1_4_Pointer)); [L73] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L73] EXPR \read(*WrapperStruct00_var_1_5_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50, stepLocal_0=16383] [L73] EXPR (*(WrapperStruct00_var_1_1_Pointer)) >> (*(WrapperStruct00_var_1_5_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50, stepLocal_0=16383] [L73] COND FALSE !(((*(WrapperStruct00_var_1_1_Pointer)) >> (*(WrapperStruct00_var_1_5_Pointer))) > stepLocal_0) [L76] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L76] (*(WrapperStruct00_var_1_6_Pointer)) = (*(WrapperStruct00_var_1_7_Pointer)) [L78] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L78] (*(WrapperStruct00_var_1_11_Pointer)) = (*(WrapperStruct00_var_1_12_Pointer)) [L79] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L79] (*(WrapperStruct00_var_1_13_Pointer)) = (*(WrapperStruct00_var_1_12_Pointer)) [L80] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L80] (*(WrapperStruct00_var_1_14_Pointer)) = (*(WrapperStruct00_var_1_7_Pointer)) [L81] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L81] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L81] signed long int stepLocal_2 = (*(WrapperStruct00_var_1_4_Pointer)) / (*(WrapperStruct00_var_1_10_Pointer)); [L82] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L82] unsigned short int stepLocal_1 = (*(WrapperStruct00_var_1_7_Pointer)); [L83] EXPR \read(*WrapperStruct00_var_1_9_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50, stepLocal_1=-65485, stepLocal_2=4095] [L83] COND FALSE !((*(WrapperStruct00_var_1_9_Pointer))) [L86] EXPR \read(*WrapperStruct00_var_1_14_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50, stepLocal_1=-65485, stepLocal_2=4095] [L86] COND FALSE !((*(WrapperStruct00_var_1_14_Pointer)) > stepLocal_2) [L93] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L93] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L93] (*(WrapperStruct00_var_1_8_Pointer)) = ((*(WrapperStruct00_var_1_6_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer))) [L132] RET step() [L133] CALL, EXPR property() [L123] EXPR (! (last_1_WrapperStruct00_var_1_6 <= last_1_WrapperStruct00_var_1_1)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer))))) : 1 [L123] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L123] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L123] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L123] EXPR (! (last_1_WrapperStruct00_var_1_6 <= last_1_WrapperStruct00_var_1_1)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer))))) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L123] EXPR ((! (last_1_WrapperStruct00_var_1_6 <= last_1_WrapperStruct00_var_1_1)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer))))) : 1) && ((((*(WrapperStruct00_var_1_1_Pointer)) >> (*(WrapperStruct00_var_1_5_Pointer))) > (1 * (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((unsigned short int) (((((42286 - (*(WrapperStruct00_var_1_7_Pointer)))) > (0)) ? ((42286 - (*(WrapperStruct00_var_1_7_Pointer)))) : (0))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_7_Pointer))))) [L123] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L123] EXPR \read(*WrapperStruct00_var_1_5_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L123] EXPR (*(WrapperStruct00_var_1_1_Pointer)) >> (*(WrapperStruct00_var_1_5_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L123] EXPR \read(*WrapperStruct00_var_1_4_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L123] EXPR (((*(WrapperStruct00_var_1_1_Pointer)) >> (*(WrapperStruct00_var_1_5_Pointer))) > (1 * (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((unsigned short int) (((((42286 - (*(WrapperStruct00_var_1_7_Pointer)))) > (0)) ? ((42286 - (*(WrapperStruct00_var_1_7_Pointer)))) : (0))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_7_Pointer)))) [L123] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L123] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L123] EXPR (((*(WrapperStruct00_var_1_1_Pointer)) >> (*(WrapperStruct00_var_1_5_Pointer))) > (1 * (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((unsigned short int) (((((42286 - (*(WrapperStruct00_var_1_7_Pointer)))) > (0)) ? ((42286 - (*(WrapperStruct00_var_1_7_Pointer)))) : (0))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_7_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L123] EXPR ((! (last_1_WrapperStruct00_var_1_6 <= last_1_WrapperStruct00_var_1_1)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer))))) : 1) && ((((*(WrapperStruct00_var_1_1_Pointer)) >> (*(WrapperStruct00_var_1_5_Pointer))) > (1 * (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((unsigned short int) (((((42286 - (*(WrapperStruct00_var_1_7_Pointer)))) > (0)) ? ((42286 - (*(WrapperStruct00_var_1_7_Pointer)))) : (0))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_7_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L123] EXPR (((! (last_1_WrapperStruct00_var_1_6 <= last_1_WrapperStruct00_var_1_1)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer))))) : 1) && ((((*(WrapperStruct00_var_1_1_Pointer)) >> (*(WrapperStruct00_var_1_5_Pointer))) > (1 * (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((unsigned short int) (((((42286 - (*(WrapperStruct00_var_1_7_Pointer)))) > (0)) ? ((42286 - (*(WrapperStruct00_var_1_7_Pointer)))) : (0))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_7_Pointer)))))) && ((*(WrapperStruct00_var_1_9_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_6_Pointer))) < (last_1_WrapperStruct00_var_1_8)) ? ((*(WrapperStruct00_var_1_6_Pointer))) : (last_1_WrapperStruct00_var_1_8))))) : (((*(WrapperStruct00_var_1_14_Pointer)) > ((*(WrapperStruct00_var_1_4_Pointer)) / (*(WrapperStruct00_var_1_10_Pointer)))) ? (((*(WrapperStruct00_var_1_7_Pointer)) > (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_4_Pointer))) < (100)) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (100))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (last_1_WrapperStruct00_var_1_8 - (*(WrapperStruct00_var_1_7_Pointer)))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_6_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer))))))) [L123] EXPR \read(*WrapperStruct00_var_1_9_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L123] EXPR (*(WrapperStruct00_var_1_9_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_6_Pointer))) < (last_1_WrapperStruct00_var_1_8)) ? ((*(WrapperStruct00_var_1_6_Pointer))) : (last_1_WrapperStruct00_var_1_8))))) : (((*(WrapperStruct00_var_1_14_Pointer)) > ((*(WrapperStruct00_var_1_4_Pointer)) / (*(WrapperStruct00_var_1_10_Pointer)))) ? (((*(WrapperStruct00_var_1_7_Pointer)) > (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_4_Pointer))) < (100)) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (100))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (last_1_WrapperStruct00_var_1_8 - (*(WrapperStruct00_var_1_7_Pointer)))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_6_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer)))))) [L123] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L123] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L123] EXPR \read(*WrapperStruct00_var_1_10_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L123] EXPR ((*(WrapperStruct00_var_1_14_Pointer)) > ((*(WrapperStruct00_var_1_4_Pointer)) / (*(WrapperStruct00_var_1_10_Pointer)))) ? (((*(WrapperStruct00_var_1_7_Pointer)) > (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_4_Pointer))) < (100)) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (100))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (last_1_WrapperStruct00_var_1_8 - (*(WrapperStruct00_var_1_7_Pointer)))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_6_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer))))) [L123] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L123] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L123] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L123] EXPR ((*(WrapperStruct00_var_1_14_Pointer)) > ((*(WrapperStruct00_var_1_4_Pointer)) / (*(WrapperStruct00_var_1_10_Pointer)))) ? (((*(WrapperStruct00_var_1_7_Pointer)) > (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_4_Pointer))) < (100)) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (100))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (last_1_WrapperStruct00_var_1_8 - (*(WrapperStruct00_var_1_7_Pointer)))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_6_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L123] EXPR (*(WrapperStruct00_var_1_9_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_6_Pointer))) < (last_1_WrapperStruct00_var_1_8)) ? ((*(WrapperStruct00_var_1_6_Pointer))) : (last_1_WrapperStruct00_var_1_8))))) : (((*(WrapperStruct00_var_1_14_Pointer)) > ((*(WrapperStruct00_var_1_4_Pointer)) / (*(WrapperStruct00_var_1_10_Pointer)))) ? (((*(WrapperStruct00_var_1_7_Pointer)) > (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_4_Pointer))) < (100)) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (100))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (last_1_WrapperStruct00_var_1_8 - (*(WrapperStruct00_var_1_7_Pointer)))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_6_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L123] EXPR (((! (last_1_WrapperStruct00_var_1_6 <= last_1_WrapperStruct00_var_1_1)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer))))) : 1) && ((((*(WrapperStruct00_var_1_1_Pointer)) >> (*(WrapperStruct00_var_1_5_Pointer))) > (1 * (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((unsigned short int) (((((42286 - (*(WrapperStruct00_var_1_7_Pointer)))) > (0)) ? ((42286 - (*(WrapperStruct00_var_1_7_Pointer)))) : (0))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_7_Pointer)))))) && ((*(WrapperStruct00_var_1_9_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_6_Pointer))) < (last_1_WrapperStruct00_var_1_8)) ? ((*(WrapperStruct00_var_1_6_Pointer))) : (last_1_WrapperStruct00_var_1_8))))) : (((*(WrapperStruct00_var_1_14_Pointer)) > ((*(WrapperStruct00_var_1_4_Pointer)) / (*(WrapperStruct00_var_1_10_Pointer)))) ? (((*(WrapperStruct00_var_1_7_Pointer)) > (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_4_Pointer))) < (100)) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (100))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (last_1_WrapperStruct00_var_1_8 - (*(WrapperStruct00_var_1_7_Pointer)))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_6_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L123] EXPR ((((! (last_1_WrapperStruct00_var_1_6 <= last_1_WrapperStruct00_var_1_1)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer))))) : 1) && ((((*(WrapperStruct00_var_1_1_Pointer)) >> (*(WrapperStruct00_var_1_5_Pointer))) > (1 * (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((unsigned short int) (((((42286 - (*(WrapperStruct00_var_1_7_Pointer)))) > (0)) ? ((42286 - (*(WrapperStruct00_var_1_7_Pointer)))) : (0))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_7_Pointer)))))) && ((*(WrapperStruct00_var_1_9_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_6_Pointer))) < (last_1_WrapperStruct00_var_1_8)) ? ((*(WrapperStruct00_var_1_6_Pointer))) : (last_1_WrapperStruct00_var_1_8))))) : (((*(WrapperStruct00_var_1_14_Pointer)) > ((*(WrapperStruct00_var_1_4_Pointer)) / (*(WrapperStruct00_var_1_10_Pointer)))) ? (((*(WrapperStruct00_var_1_7_Pointer)) > (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_4_Pointer))) < (100)) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (100))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (last_1_WrapperStruct00_var_1_8 - (*(WrapperStruct00_var_1_7_Pointer)))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_6_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer)))))))) && ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer)))) [L123] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L123] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L123] EXPR ((((! (last_1_WrapperStruct00_var_1_6 <= last_1_WrapperStruct00_var_1_1)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer))))) : 1) && ((((*(WrapperStruct00_var_1_1_Pointer)) >> (*(WrapperStruct00_var_1_5_Pointer))) > (1 * (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((unsigned short int) (((((42286 - (*(WrapperStruct00_var_1_7_Pointer)))) > (0)) ? ((42286 - (*(WrapperStruct00_var_1_7_Pointer)))) : (0))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_7_Pointer)))))) && ((*(WrapperStruct00_var_1_9_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_6_Pointer))) < (last_1_WrapperStruct00_var_1_8)) ? ((*(WrapperStruct00_var_1_6_Pointer))) : (last_1_WrapperStruct00_var_1_8))))) : (((*(WrapperStruct00_var_1_14_Pointer)) > ((*(WrapperStruct00_var_1_4_Pointer)) / (*(WrapperStruct00_var_1_10_Pointer)))) ? (((*(WrapperStruct00_var_1_7_Pointer)) > (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_4_Pointer))) < (100)) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (100))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (last_1_WrapperStruct00_var_1_8 - (*(WrapperStruct00_var_1_7_Pointer)))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_6_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer)))))))) && ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L123] EXPR (((((! (last_1_WrapperStruct00_var_1_6 <= last_1_WrapperStruct00_var_1_1)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer))))) : 1) && ((((*(WrapperStruct00_var_1_1_Pointer)) >> (*(WrapperStruct00_var_1_5_Pointer))) > (1 * (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((unsigned short int) (((((42286 - (*(WrapperStruct00_var_1_7_Pointer)))) > (0)) ? ((42286 - (*(WrapperStruct00_var_1_7_Pointer)))) : (0))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_7_Pointer)))))) && ((*(WrapperStruct00_var_1_9_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_6_Pointer))) < (last_1_WrapperStruct00_var_1_8)) ? ((*(WrapperStruct00_var_1_6_Pointer))) : (last_1_WrapperStruct00_var_1_8))))) : (((*(WrapperStruct00_var_1_14_Pointer)) > ((*(WrapperStruct00_var_1_4_Pointer)) / (*(WrapperStruct00_var_1_10_Pointer)))) ? (((*(WrapperStruct00_var_1_7_Pointer)) > (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_4_Pointer))) < (100)) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (100))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (last_1_WrapperStruct00_var_1_8 - (*(WrapperStruct00_var_1_7_Pointer)))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_6_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer)))))))) && ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer))))) && ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) (*(WrapperStruct00_var_1_12_Pointer)))) [L123] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L123] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L123] EXPR (((((! (last_1_WrapperStruct00_var_1_6 <= last_1_WrapperStruct00_var_1_1)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer))))) : 1) && ((((*(WrapperStruct00_var_1_1_Pointer)) >> (*(WrapperStruct00_var_1_5_Pointer))) > (1 * (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((unsigned short int) (((((42286 - (*(WrapperStruct00_var_1_7_Pointer)))) > (0)) ? ((42286 - (*(WrapperStruct00_var_1_7_Pointer)))) : (0))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_7_Pointer)))))) && ((*(WrapperStruct00_var_1_9_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_6_Pointer))) < (last_1_WrapperStruct00_var_1_8)) ? ((*(WrapperStruct00_var_1_6_Pointer))) : (last_1_WrapperStruct00_var_1_8))))) : (((*(WrapperStruct00_var_1_14_Pointer)) > ((*(WrapperStruct00_var_1_4_Pointer)) / (*(WrapperStruct00_var_1_10_Pointer)))) ? (((*(WrapperStruct00_var_1_7_Pointer)) > (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_4_Pointer))) < (100)) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (100))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (last_1_WrapperStruct00_var_1_8 - (*(WrapperStruct00_var_1_7_Pointer)))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_6_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer)))))))) && ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer))))) && ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) (*(WrapperStruct00_var_1_12_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L123] EXPR ((((((! (last_1_WrapperStruct00_var_1_6 <= last_1_WrapperStruct00_var_1_1)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer))))) : 1) && ((((*(WrapperStruct00_var_1_1_Pointer)) >> (*(WrapperStruct00_var_1_5_Pointer))) > (1 * (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((unsigned short int) (((((42286 - (*(WrapperStruct00_var_1_7_Pointer)))) > (0)) ? ((42286 - (*(WrapperStruct00_var_1_7_Pointer)))) : (0))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_7_Pointer)))))) && ((*(WrapperStruct00_var_1_9_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_6_Pointer))) < (last_1_WrapperStruct00_var_1_8)) ? ((*(WrapperStruct00_var_1_6_Pointer))) : (last_1_WrapperStruct00_var_1_8))))) : (((*(WrapperStruct00_var_1_14_Pointer)) > ((*(WrapperStruct00_var_1_4_Pointer)) / (*(WrapperStruct00_var_1_10_Pointer)))) ? (((*(WrapperStruct00_var_1_7_Pointer)) > (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_4_Pointer))) < (100)) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (100))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (last_1_WrapperStruct00_var_1_8 - (*(WrapperStruct00_var_1_7_Pointer)))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_6_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer)))))))) && ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer))))) && ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) (*(WrapperStruct00_var_1_12_Pointer))))) && ((*(WrapperStruct00_var_1_14_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_7_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L123-L124] return ((((((! (last_1_WrapperStruct00_var_1_6 <= last_1_WrapperStruct00_var_1_1)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer))))) : 1) && ((((*(WrapperStruct00_var_1_1_Pointer)) >> (*(WrapperStruct00_var_1_5_Pointer))) > (1 * (*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((unsigned short int) (((((42286 - (*(WrapperStruct00_var_1_7_Pointer)))) > (0)) ? ((42286 - (*(WrapperStruct00_var_1_7_Pointer)))) : (0))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_7_Pointer)))))) && ((*(WrapperStruct00_var_1_9_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_6_Pointer))) < (last_1_WrapperStruct00_var_1_8)) ? ((*(WrapperStruct00_var_1_6_Pointer))) : (last_1_WrapperStruct00_var_1_8))))) : (((*(WrapperStruct00_var_1_14_Pointer)) > ((*(WrapperStruct00_var_1_4_Pointer)) / (*(WrapperStruct00_var_1_10_Pointer)))) ? (((*(WrapperStruct00_var_1_7_Pointer)) > (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_4_Pointer))) < (100)) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (100))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (last_1_WrapperStruct00_var_1_8 - (*(WrapperStruct00_var_1_7_Pointer)))))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_6_Pointer)) + (*(WrapperStruct00_var_1_5_Pointer)))))))) && ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer))))) && ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) (*(WrapperStruct00_var_1_12_Pointer))))) && ((*(WrapperStruct00_var_1_14_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_7_Pointer)))) ; [L133] RET, EXPR property() [L133] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:23}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:4}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_7_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:10}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 93 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 140.3s, OverallIterations: 16, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 26.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3295 SdHoareTripleChecker+Valid, 17.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3290 mSDsluCounter, 6927 SdHoareTripleChecker+Invalid, 15.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5335 mSDsCounter, 343 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6094 IncrementalHoareTripleChecker+Invalid, 6437 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 343 mSolverCounterUnsat, 1592 mSDtfsCounter, 6094 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 691 GetRequests, 516 SyntacticMatches, 3 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1445 ImplicationChecksByTransitivity, 73.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=423occurred in iteration=15, InterpolantAutomatonStates: 116, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 15 MinimizatonAttempts, 415 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 2.8s SatisfiabilityAnalysisTime, 107.4s InterpolantComputationTime, 1938 NumberOfCodeBlocks, 1938 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1698 ConstructedInterpolants, 1 QuantifiedInterpolants, 30369 SizeOfPredicates, 25 NumberOfNonLiveVariables, 462 ConjunctsInSsa, 106 ConjunctsInUnsatCore, 16 InterpolantComputations, 14 PerfectInterpolantSequences, 4069/4224 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-13 15:26:12,942 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-11-13 15:26:12,970 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 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: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-67.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd --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 2bfc3a2327f8b20a29fd925460a8337c18b9a784fffca7c1ea577a58172303bb --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 15:26:15,407 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 15:26:15,547 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-13 15:26:15,557 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 15:26:15,557 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 15:26:15,601 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 15:26:15,603 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 15:26:15,603 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 15:26:15,604 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 15:26:15,604 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 15:26:15,604 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 15:26:15,605 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 15:26:15,606 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 15:26:15,606 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 15:26:15,606 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 15:26:15,606 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 15:26:15,606 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 15:26:15,606 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 15:26:15,606 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 15:26:15,607 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 15:26:15,607 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 15:26:15,607 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 15:26:15,607 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 15:26:15,607 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 15:26:15,607 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 15:26:15,607 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 15:26:15,607 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 15:26:15,607 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 15:26:15,607 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 15:26:15,607 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 15:26:15,607 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 15:26:15,607 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 15:26:15,608 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 15:26:15,608 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 15:26:15,608 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:26:15,608 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 15:26:15,608 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 15:26:15,608 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 15:26:15,608 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-13 15:26:15,608 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 15:26:15,608 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 15:26:15,608 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 15:26:15,608 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 15:26:15,608 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 15:26:15,609 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd 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 -> 2bfc3a2327f8b20a29fd925460a8337c18b9a784fffca7c1ea577a58172303bb [2024-11-13 15:26:15,932 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 15:26:15,941 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 15:26:15,944 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 15:26:15,947 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 15:26:15,947 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 15:26:15,948 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-67.i Unable to find full path for "g++" [2024-11-13 15:26:17,944 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 15:26:18,258 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 15:26:18,259 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-67.i [2024-11-13 15:26:18,269 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/data/1b2754bc8/5032e35b82e2450a9331c02e80c6f49f/FLAG5ae3d0c05 [2024-11-13 15:26:18,286 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/data/1b2754bc8/5032e35b82e2450a9331c02e80c6f49f [2024-11-13 15:26:18,289 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 15:26:18,291 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 15:26:18,293 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 15:26:18,293 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 15:26:18,298 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 15:26:18,299 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:26:18" (1/1) ... [2024-11-13 15:26:18,301 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18f2814a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:26:18, skipping insertion in model container [2024-11-13 15:26:18,301 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:26:18" (1/1) ... [2024-11-13 15:26:18,321 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 15:26:18,499 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-67.i[917,930] [2024-11-13 15:26:18,567 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:26:18,586 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 15:26:18,598 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-67.i[917,930] [2024-11-13 15:26:18,639 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:26:18,677 INFO L204 MainTranslator]: Completed translation [2024-11-13 15:26:18,678 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:26:18 WrapperNode [2024-11-13 15:26:18,678 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 15:26:18,679 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 15:26:18,680 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 15:26:18,680 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 15:26:18,688 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:26:18" (1/1) ... [2024-11-13 15:26:18,714 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:26:18" (1/1) ... [2024-11-13 15:26:18,762 INFO L138 Inliner]: procedures = 40, calls = 130, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 394 [2024-11-13 15:26:18,763 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 15:26:18,763 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 15:26:18,764 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 15:26:18,764 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 15:26:18,774 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:26:18" (1/1) ... [2024-11-13 15:26:18,774 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:26:18" (1/1) ... [2024-11-13 15:26:18,782 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:26:18" (1/1) ... [2024-11-13 15:26:18,817 INFO L175 MemorySlicer]: Split 107 memory accesses to 2 slices as follows [2, 105]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 29 writes are split as follows [0, 29]. [2024-11-13 15:26:18,821 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:26:18" (1/1) ... [2024-11-13 15:26:18,821 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:26:18" (1/1) ... [2024-11-13 15:26:18,857 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:26:18" (1/1) ... [2024-11-13 15:26:18,865 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:26:18" (1/1) ... [2024-11-13 15:26:18,872 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:26:18" (1/1) ... [2024-11-13 15:26:18,877 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:26:18" (1/1) ... [2024-11-13 15:26:18,886 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 15:26:18,893 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 15:26:18,893 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 15:26:18,894 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 15:26:18,895 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:26:18" (1/1) ... [2024-11-13 15:26:18,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:26:18,922 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:26:18,938 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 15:26:18,944 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 15:26:18,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 15:26:18,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-13 15:26:18,982 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-13 15:26:18,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2024-11-13 15:26:18,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2024-11-13 15:26:18,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-13 15:26:18,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-13 15:26:18,982 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-13 15:26:18,982 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-13 15:26:18,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-13 15:26:18,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-13 15:26:18,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-13 15:26:18,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-13 15:26:18,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-13 15:26:18,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-13 15:26:18,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-13 15:26:18,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-13 15:26:18,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-13 15:26:18,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-13 15:26:18,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-13 15:26:18,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-13 15:26:18,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2024-11-13 15:26:18,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2024-11-13 15:26:18,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-13 15:26:18,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-13 15:26:18,986 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 15:26:18,986 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 15:26:18,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-13 15:26:18,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-13 15:26:18,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 15:26:18,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 15:26:18,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-13 15:26:18,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-13 15:26:18,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-13 15:26:18,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-13 15:26:18,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-13 15:26:18,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-13 15:26:19,245 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 15:26:19,248 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 15:26:20,924 INFO L? ?]: Removed 90 outVars from TransFormulas that were not future-live. [2024-11-13 15:26:20,925 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 15:26:20,944 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 15:26:20,945 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 15:26:20,946 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:26:20 BoogieIcfgContainer [2024-11-13 15:26:20,946 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 15:26:20,950 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 15:26:20,950 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 15:26:20,956 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 15:26:20,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 03:26:18" (1/3) ... [2024-11-13 15:26:20,958 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7505d37b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:26:20, skipping insertion in model container [2024-11-13 15:26:20,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:26:18" (2/3) ... [2024-11-13 15:26:20,960 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7505d37b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:26:20, skipping insertion in model container [2024-11-13 15:26:20,960 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:26:20" (3/3) ... [2024-11-13 15:26:20,961 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-67.i [2024-11-13 15:26:20,980 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 15:26:20,985 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-67.i that has 2 procedures, 88 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 15:26:21,060 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 15:26:21,072 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;@9ae074a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 15:26:21,072 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 15:26:21,077 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 73 states have (on average 1.3972602739726028) internal successors, (102), 74 states have internal predecessors, (102), 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-13 15:26:21,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-13 15:26:21,089 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:26:21,090 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-13 15:26:21,090 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:26:21,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:26:21,096 INFO L85 PathProgramCache]: Analyzing trace with hash -920400692, now seen corresponding path program 1 times [2024-11-13 15:26:21,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:26:21,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [111055063] [2024-11-13 15:26:21,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:26:21,110 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-13 15:26:21,110 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:26:21,115 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:26:21,117 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:26:21,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:26:21,671 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-13 15:26:21,679 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:26:21,718 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2024-11-13 15:26:21,718 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:26:21,719 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:26:21,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [111055063] [2024-11-13 15:26:21,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [111055063] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:26:21,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:26:21,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:26:21,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371676894] [2024-11-13 15:26:21,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:26:21,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 15:26:21,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:26:21,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 15:26:21,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 15:26:21,750 INFO L87 Difference]: Start difference. First operand has 88 states, 73 states have (on average 1.3972602739726028) internal successors, (102), 74 states have internal predecessors, (102), 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-13 15:26:21,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:26:21,785 INFO L93 Difference]: Finished difference Result 169 states and 258 transitions. [2024-11-13 15:26:21,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 15:26:21,787 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-13 15:26:21,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:26:21,795 INFO L225 Difference]: With dead ends: 169 [2024-11-13 15:26:21,795 INFO L226 Difference]: Without dead ends: 84 [2024-11-13 15:26:21,799 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-13 15:26:21,802 INFO L432 NwaCegarLoop]: 119 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, 119 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-13 15:26:21,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:26:21,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-13 15:26:21,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-13 15:26:21,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 70 states have (on average 1.3571428571428572) internal successors, (95), 70 states have internal predecessors, (95), 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-13 15:26:21,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 119 transitions. [2024-11-13 15:26:21,869 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 119 transitions. Word has length 103 [2024-11-13 15:26:21,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:26:21,870 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 119 transitions. [2024-11-13 15:26:21,871 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-13 15:26:21,871 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 119 transitions. [2024-11-13 15:26:21,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-13 15:26:21,876 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:26:21,876 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-13 15:26:21,887 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-13 15:26:22,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:26:22,077 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:26:22,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:26:22,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1296187144, now seen corresponding path program 1 times [2024-11-13 15:26:22,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:26:22,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1674626026] [2024-11-13 15:26:22,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:26:22,080 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-13 15:26:22,080 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:26:22,082 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:26:22,090 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:26:22,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:26:22,563 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 15:26:22,568 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:26:22,654 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-13 15:26:22,654 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:26:22,654 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:26:22,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1674626026] [2024-11-13 15:26:22,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1674626026] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:26:22,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:26:22,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:26:22,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824106705] [2024-11-13 15:26:22,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:26:22,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:26:22,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:26:22,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:26:22,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:26:22,657 INFO L87 Difference]: Start difference. First operand 84 states and 119 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-13 15:26:22,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:26:22,736 INFO L93 Difference]: Finished difference Result 167 states and 238 transitions. [2024-11-13 15:26:22,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:26:22,737 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-13 15:26:22,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:26:22,739 INFO L225 Difference]: With dead ends: 167 [2024-11-13 15:26:22,739 INFO L226 Difference]: Without dead ends: 86 [2024-11-13 15:26:22,740 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-13 15:26:22,741 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:26:22,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 340 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:26:22,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-13 15:26:22,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-13 15:26:22,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 72 states have (on average 1.3472222222222223) internal successors, (97), 72 states have internal predecessors, (97), 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-13 15:26:22,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 121 transitions. [2024-11-13 15:26:22,753 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 121 transitions. Word has length 103 [2024-11-13 15:26:22,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:26:22,754 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 121 transitions. [2024-11-13 15:26:22,755 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-13 15:26:22,755 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 121 transitions. [2024-11-13 15:26:22,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-13 15:26:22,757 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:26:22,758 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-13 15:26:22,766 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:26:22,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:26:22,959 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:26:22,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:26:22,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1570946758, now seen corresponding path program 1 times [2024-11-13 15:26:22,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:26:22,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1072712113] [2024-11-13 15:26:22,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:26:22,960 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-13 15:26:22,960 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:26:22,962 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:26:22,965 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:26:23,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:26:23,375 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 15:26:23,379 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:26:23,430 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-13 15:26:23,431 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:26:23,431 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:26:23,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1072712113] [2024-11-13 15:26:23,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1072712113] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:26:23,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:26:23,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 15:26:23,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934993290] [2024-11-13 15:26:23,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:26:23,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:26:23,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:26:23,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:26:23,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:26:23,433 INFO L87 Difference]: Start difference. First operand 86 states and 121 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 15:26:23,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:26:23,526 INFO L93 Difference]: Finished difference Result 174 states and 246 transitions. [2024-11-13 15:26:23,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:26:23,527 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2024-11-13 15:26:23,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:26:23,529 INFO L225 Difference]: With dead ends: 174 [2024-11-13 15:26:23,529 INFO L226 Difference]: Without dead ends: 91 [2024-11-13 15:26:23,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 99 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-13 15:26:23,530 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 1 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:26:23,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 440 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:26:23,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-13 15:26:23,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2024-11-13 15:26:23,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 76 states have (on average 1.3289473684210527) internal successors, (101), 76 states have internal predecessors, (101), 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-13 15:26:23,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 125 transitions. [2024-11-13 15:26:23,552 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 125 transitions. Word has length 103 [2024-11-13 15:26:23,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:26:23,553 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 125 transitions. [2024-11-13 15:26:23,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 15:26:23,553 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 125 transitions. [2024-11-13 15:26:23,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-13 15:26:23,555 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:26:23,555 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-13 15:26:23,566 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:26:23,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:26:23,757 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:26:23,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:26:23,757 INFO L85 PathProgramCache]: Analyzing trace with hash -890888388, now seen corresponding path program 1 times [2024-11-13 15:26:23,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:26:23,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1573576886] [2024-11-13 15:26:23,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:26:23,759 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-13 15:26:23,759 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:26:23,761 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:26:23,762 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-13 15:26:24,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:26:24,151 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 15:26:24,155 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:26:24,219 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-13 15:26:24,219 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:26:24,219 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:26:24,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1573576886] [2024-11-13 15:26:24,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1573576886] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:26:24,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:26:24,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 15:26:24,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144290535] [2024-11-13 15:26:24,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:26:24,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 15:26:24,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:26:24,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 15:26:24,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:26:24,222 INFO L87 Difference]: Start difference. First operand 90 states and 125 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 15:26:24,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:26:24,399 INFO L93 Difference]: Finished difference Result 180 states and 251 transitions. [2024-11-13 15:26:24,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 15:26:24,400 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2024-11-13 15:26:24,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:26:24,401 INFO L225 Difference]: With dead ends: 180 [2024-11-13 15:26:24,402 INFO L226 Difference]: Without dead ends: 93 [2024-11-13 15:26:24,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:26:24,403 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 1 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:26:24,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 540 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 15:26:24,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-13 15:26:24,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2024-11-13 15:26:24,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 78 states have (on average 1.3205128205128205) internal successors, (103), 78 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-13 15:26:24,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 127 transitions. [2024-11-13 15:26:24,415 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 127 transitions. Word has length 103 [2024-11-13 15:26:24,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:26:24,415 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 127 transitions. [2024-11-13 15:26:24,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 15:26:24,416 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 127 transitions. [2024-11-13 15:26:24,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-13 15:26:24,418 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:26:24,418 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-13 15:26:24,428 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-13 15:26:24,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:26:24,619 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:26:24,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:26:24,619 INFO L85 PathProgramCache]: Analyzing trace with hash 884118974, now seen corresponding path program 1 times [2024-11-13 15:26:24,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:26:24,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1410625579] [2024-11-13 15:26:24,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:26:24,620 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-13 15:26:24,620 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:26:24,626 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:26:24,628 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:26:24,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:26:24,976 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 15:26:24,979 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:26:25,061 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-13 15:26:25,061 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:26:25,061 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:26:25,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1410625579] [2024-11-13 15:26:25,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1410625579] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:26:25,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:26:25,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 15:26:25,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851642555] [2024-11-13 15:26:25,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:26:25,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 15:26:25,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:26:25,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 15:26:25,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:26:25,064 INFO L87 Difference]: Start difference. First operand 92 states and 127 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 15:26:25,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:26:25,302 INFO L93 Difference]: Finished difference Result 184 states and 255 transitions. [2024-11-13 15:26:25,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 15:26:25,304 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2024-11-13 15:26:25,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:26:25,305 INFO L225 Difference]: With dead ends: 184 [2024-11-13 15:26:25,305 INFO L226 Difference]: Without dead ends: 95 [2024-11-13 15:26:25,306 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:26:25,311 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 1 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:26:25,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 641 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 15:26:25,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-13 15:26:25,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2024-11-13 15:26:25,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 80 states have (on average 1.3125) internal successors, (105), 80 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-13 15:26:25,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 129 transitions. [2024-11-13 15:26:25,328 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 129 transitions. Word has length 103 [2024-11-13 15:26:25,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:26:25,328 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 129 transitions. [2024-11-13 15:26:25,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 15:26:25,329 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 129 transitions. [2024-11-13 15:26:25,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-13 15:26:25,330 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:26:25,331 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-13 15:26:25,342 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:26:25,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:26:25,531 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:26:25,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:26:25,532 INFO L85 PathProgramCache]: Analyzing trace with hash 885966016, now seen corresponding path program 1 times [2024-11-13 15:26:25,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:26:25,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [433842225] [2024-11-13 15:26:25,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:26:25,533 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-13 15:26:25,533 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:26:25,537 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:26:25,538 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-13 15:26:26,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:26:26,098 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-13 15:26:26,116 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:26:27,483 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-13 15:26:29,807 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-13 15:26:31,763 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-13 15:26:33,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-13 15:26:35,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-13 15:26:37,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-13 15:26:39,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 41 [2024-11-13 15:26:39,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 44 [2024-11-13 15:26:40,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 66 [2024-11-13 15:26:40,608 INFO L349 Elim1Store]: treesize reduction 357, result has 4.8 percent of original size [2024-11-13 15:26:40,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 5 select indices, 5 select index equivalence classes, 28 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 8 case distinctions, treesize of input 598 treesize of output 600 [2024-11-13 15:26:41,388 INFO L224 Elim1Store]: Index analysis took 243 ms [2024-11-13 15:26:42,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 170 [2024-11-13 15:26:42,657 INFO L224 Elim1Store]: Index analysis took 205 ms [2024-11-13 15:26:43,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 170 [2024-11-13 15:26:43,972 INFO L224 Elim1Store]: Index analysis took 217 ms [2024-11-13 15:26:44,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 170 [2024-11-13 15:26:45,239 INFO L224 Elim1Store]: Index analysis took 111 ms [2024-11-13 15:26:45,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 132 [2024-11-13 15:26:46,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 132 [2024-11-13 15:26:46,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 57 [2024-11-13 15:26:49,625 INFO L349 Elim1Store]: treesize reduction 81, result has 12.0 percent of original size [2024-11-13 15:26:49,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 9 case distinctions, treesize of input 320 treesize of output 224 [2024-11-13 15:26:51,021 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:26:51,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 28 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 422 treesize of output 286 [2024-11-13 15:27:29,805 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 112 proven. 44 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-11-13 15:27:29,806 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:27:51,583 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_272 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_26| (_ BitVec 64)) (~WrapperStruct00_var_1_7_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_267 (_ BitVec 32)) (v_skolemized_v_prenex_3_9 (_ BitVec 32))) (let ((.cse0 (let ((.cse1 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base (store (select |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) (bvadd ((_ sign_extend 16) ((_ extract 15 0) (select (select |c_#memory_int#1| c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))) ((_ sign_extend 16) ((_ extract 15 0) (select (select |c_#memory_int#1| c_~WrapperStruct00_var_1_4_Pointer~0.base) c_~WrapperStruct00_var_1_4_Pointer~0.offset)))))))))) (store .cse5 c_~WrapperStruct00_var_1_6_Pointer~0.base (store (select .cse5 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset v_ArrVal_267))))) (store .cse4 c_~WrapperStruct00_var_1_11_Pointer~0.base (store (select .cse4 c_~WrapperStruct00_var_1_11_Pointer~0.base) c_~WrapperStruct00_var_1_11_Pointer~0.offset v_skolemized_v_prenex_3_9))))) (store .cse3 c_~WrapperStruct00_var_1_13_Pointer~0.base (store (store (select .cse3 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_26|)) (bvadd (_ bv4 32) c_~WrapperStruct00_var_1_13_Pointer~0.offset) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_26|)))))) (store .cse2 c_~WrapperStruct00_var_1_14_Pointer~0.base (store (select .cse2 c_~WrapperStruct00_var_1_14_Pointer~0.base) c_~WrapperStruct00_var_1_14_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse2 c_~WrapperStruct00_var_1_7_Pointer~0.base) ~WrapperStruct00_var_1_7_Pointer~0.offset)))))))) (store .cse1 c_~WrapperStruct00_var_1_8_Pointer~0.base (store (select .cse1 c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset v_ArrVal_272))))) (= ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse0 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset))) ((_ sign_extend 16) ((_ extract 15 0) (bvadd ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse0 c_~WrapperStruct00_var_1_4_Pointer~0.base) c_~WrapperStruct00_var_1_4_Pointer~0.offset))) ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse0 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))))))))) is different from false [2024-11-13 15:27:52,189 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:27:52,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [433842225] [2024-11-13 15:27:52,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [433842225] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:27:52,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410194593] [2024-11-13 15:27:52,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:27:52,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:27:52,190 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:27:52,197 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:27:52,199 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-13 15:27:52,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:27:52,770 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 75 conjuncts are in the unsatisfiable core [2024-11-13 15:27:52,781 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:27:53,558 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-13 15:27:57,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2024-11-13 15:28:02,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 39 [2024-11-13 15:28:04,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 39 [2024-11-13 15:28:06,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 39 [2024-11-13 15:28:10,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 39 [2024-11-13 15:28:12,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 44 [2024-11-13 15:28:13,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 60 [2024-11-13 15:28:14,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 21 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 69 [2024-11-13 15:28:14,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 69 [2024-11-13 15:28:15,572 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:28:15,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 140 treesize of output 84 [2024-11-13 15:28:15,608 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 79 proven. 119 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-13 15:28:15,608 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:29:01,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410194593] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:29:01,457 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:29:01,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 29] total 36 [2024-11-13 15:29:01,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951569888] [2024-11-13 15:29:01,457 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:29:01,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-13 15:29:01,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:29:01,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-13 15:29:01,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=1808, Unknown=11, NotChecked=88, Total=2162 [2024-11-13 15:29:01,461 INFO L87 Difference]: Start difference. First operand 94 states and 129 transitions. Second operand has 37 states, 33 states have (on average 3.090909090909091) internal successors, (102), 32 states have internal predecessors, (102), 9 states have call successors, (24), 9 states have call predecessors, (24), 10 states have return successors, (24), 8 states have call predecessors, (24), 9 states have call successors, (24) [2024-11-13 15:29:32,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:29:41,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:29:45,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.88s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:29:48,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:29:52,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:29:53,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:29:55,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:29:57,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:30:07,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:30:08,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:30:22,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:30:22,991 INFO L93 Difference]: Finished difference Result 305 states and 410 transitions. [2024-11-13 15:30:22,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-13 15:30:22,995 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 33 states have (on average 3.090909090909091) internal successors, (102), 32 states have internal predecessors, (102), 9 states have call successors, (24), 9 states have call predecessors, (24), 10 states have return successors, (24), 8 states have call predecessors, (24), 9 states have call successors, (24) Word has length 103 [2024-11-13 15:30:22,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:30:22,996 INFO L225 Difference]: With dead ends: 305 [2024-11-13 15:30:22,997 INFO L226 Difference]: Without dead ends: 214 [2024-11-13 15:30:23,001 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 206 SyntacticMatches, 3 SemanticMatches, 79 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1717 ImplicationChecksByTransitivity, 96.4s TimeCoverageRelationStatistics Valid=947, Invalid=5366, Unknown=11, NotChecked=156, Total=6480 [2024-11-13 15:30:23,002 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 1216 mSDsluCounter, 955 mSDsCounter, 0 mSdLazyCounter, 1412 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 60.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1216 SdHoareTripleChecker+Valid, 1031 SdHoareTripleChecker+Invalid, 1578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 1412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 61.4s IncrementalHoareTripleChecker+Time [2024-11-13 15:30:23,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1216 Valid, 1031 Invalid, 1578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 1412 Invalid, 0 Unknown, 0 Unchecked, 61.4s Time] [2024-11-13 15:30:23,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-11-13 15:30:23,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 126. [2024-11-13 15:30:23,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 108 states have (on average 1.3055555555555556) internal successors, (141), 108 states have internal predecessors, (141), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-13 15:30:23,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 165 transitions. [2024-11-13 15:30:23,035 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 165 transitions. Word has length 103 [2024-11-13 15:30:23,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:30:23,036 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 165 transitions. [2024-11-13 15:30:23,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 33 states have (on average 3.090909090909091) internal successors, (102), 32 states have internal predecessors, (102), 9 states have call successors, (24), 9 states have call predecessors, (24), 10 states have return successors, (24), 8 states have call predecessors, (24), 9 states have call successors, (24) [2024-11-13 15:30:23,036 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 165 transitions. [2024-11-13 15:30:23,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-13 15:30:23,038 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:30:23,038 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-13 15:30:23,062 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-13 15:30:23,247 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-13 15:30:23,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:30:23,439 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:30:23,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:30:23,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1104820734, now seen corresponding path program 1 times [2024-11-13 15:30:23,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:30:23,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1543009263] [2024-11-13 15:30:23,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:30:23,440 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-13 15:30:23,440 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:30:23,444 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:30:23,447 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:30:23,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:23,724 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-13 15:30:23,726 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:30:23,776 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-13 15:30:23,776 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:30:23,776 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:30:23,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1543009263] [2024-11-13 15:30:23,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1543009263] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:30:23,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:30:23,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:30:23,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148283594] [2024-11-13 15:30:23,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:30:23,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:30:23,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:30:23,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:30:23,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:30:23,778 INFO L87 Difference]: Start difference. First operand 126 states and 165 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 15:30:24,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:30:24,249 INFO L93 Difference]: Finished difference Result 282 states and 370 transitions. [2024-11-13 15:30:24,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:30:24,251 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2024-11-13 15:30:24,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:30:24,252 INFO L225 Difference]: With dead ends: 282 [2024-11-13 15:30:24,252 INFO L226 Difference]: Without dead ends: 159 [2024-11-13 15:30:24,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 101 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-13 15:30:24,253 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 55 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 15:30:24,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 292 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 15:30:24,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-13 15:30:24,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 122. [2024-11-13 15:30:24,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 104 states have (on average 1.2980769230769231) internal successors, (135), 104 states have internal predecessors, (135), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-13 15:30:24,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 159 transitions. [2024-11-13 15:30:24,280 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 159 transitions. Word has length 103 [2024-11-13 15:30:24,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:30:24,281 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 159 transitions. [2024-11-13 15:30:24,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 15:30:24,281 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 159 transitions. [2024-11-13 15:30:24,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-13 15:30:24,283 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:30:24,283 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-13 15:30:24,291 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-13 15:30:24,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:30:24,484 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:30:24,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:30:24,484 INFO L85 PathProgramCache]: Analyzing trace with hash -304442798, now seen corresponding path program 1 times [2024-11-13 15:30:24,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:30:24,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1786797725] [2024-11-13 15:30:24,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:30:24,485 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-13 15:30:24,485 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:30:24,488 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:30:24,490 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-13 15:30:25,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:30:25,114 INFO L255 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-13 15:30:25,121 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:30:28,869 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-13 15:30:31,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-13 15:30:33,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-13 15:30:36,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-13 15:30:37,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-13 15:30:38,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-11-13 15:30:38,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 15 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 42 [2024-11-13 15:30:38,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 49 [2024-11-13 15:30:39,051 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:30:39,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 45 [2024-11-13 15:30:39,247 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 140 proven. 59 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-13 15:30:39,247 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:31:13,426 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_37| (_ BitVec 64)) (v_ArrVal_428 (_ BitVec 32)) (v_ArrVal_438 (_ BitVec 32)) (v_skolemized_v_prenex_3_13 (_ BitVec 32)) (v_ArrVal_433 (_ BitVec 32))) (let ((.cse0 (let ((.cse1 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base (store (select |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset v_ArrVal_428)))) (store .cse5 c_~WrapperStruct00_var_1_6_Pointer~0.base (store (select .cse5 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse5 c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset)))))))) (store .cse4 c_~WrapperStruct00_var_1_11_Pointer~0.base (store (select .cse4 c_~WrapperStruct00_var_1_11_Pointer~0.base) c_~WrapperStruct00_var_1_11_Pointer~0.offset v_skolemized_v_prenex_3_13))))) (store .cse3 c_~WrapperStruct00_var_1_13_Pointer~0.base (store (store (select .cse3 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset v_ArrVal_433) (bvadd (_ bv4 32) c_~WrapperStruct00_var_1_13_Pointer~0.offset) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_37|)))))) (store .cse2 c_~WrapperStruct00_var_1_14_Pointer~0.base (store (select .cse2 c_~WrapperStruct00_var_1_14_Pointer~0.base) c_~WrapperStruct00_var_1_14_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse2 c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset)))))))) (store .cse1 c_~WrapperStruct00_var_1_8_Pointer~0.base (store (select .cse1 c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset v_ArrVal_438))))) (= ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse0 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset))) ((_ zero_extend 16) ((_ extract 15 0) (select (select .cse0 c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset)))))) is different from false [2024-11-13 15:31:13,685 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:31:13,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1786797725] [2024-11-13 15:31:13,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1786797725] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:31:13,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [291453222] [2024-11-13 15:31:13,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:31:13,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:31:13,686 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:31:13,688 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:31:13,689 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-13 15:31:14,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:31:14,844 INFO L255 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-13 15:31:14,852 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:31:18,501 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-13 15:31:21,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-13 15:31:22,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-13 15:31:26,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-13 15:31:27,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-13 15:31:27,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2024-11-13 15:31:28,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 15 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 25 [2024-11-13 15:31:28,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2024-11-13 15:31:29,179 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:31:29,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 35 [2024-11-13 15:31:29,211 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 132 proven. 59 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-11-13 15:31:29,212 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:32:20,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [291453222] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:32:20,257 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:32:20,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 26 [2024-11-13 15:32:20,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33970623] [2024-11-13 15:32:20,257 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:32:20,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-13 15:32:20,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:32:20,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-13 15:32:20,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=990, Unknown=12, NotChecked=66, Total=1260 [2024-11-13 15:32:20,259 INFO L87 Difference]: Start difference. First operand 122 states and 159 transitions. Second operand has 27 states, 25 states have (on average 3.84) internal successors, (96), 26 states have internal predecessors, (96), 8 states have call successors, (20), 6 states have call predecessors, (20), 9 states have return successors, (20), 6 states have call predecessors, (20), 8 states have call successors, (20) [2024-11-13 15:32:37,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:32:37,514 INFO L93 Difference]: Finished difference Result 334 states and 430 transitions. [2024-11-13 15:32:37,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-13 15:32:37,516 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 3.84) internal successors, (96), 26 states have internal predecessors, (96), 8 states have call successors, (20), 6 states have call predecessors, (20), 9 states have return successors, (20), 6 states have call predecessors, (20), 8 states have call successors, (20) Word has length 105 [2024-11-13 15:32:37,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:32:37,518 INFO L225 Difference]: With dead ends: 334 [2024-11-13 15:32:37,518 INFO L226 Difference]: Without dead ends: 215 [2024-11-13 15:32:37,519 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 226 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 568 ImplicationChecksByTransitivity, 92.6s TimeCoverageRelationStatistics Valid=454, Invalid=1700, Unknown=12, NotChecked=90, Total=2256 [2024-11-13 15:32:37,520 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 875 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 1155 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 881 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 1333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 1155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.5s IncrementalHoareTripleChecker+Time [2024-11-13 15:32:37,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [881 Valid, 590 Invalid, 1333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 1155 Invalid, 0 Unknown, 0 Unchecked, 13.5s Time] [2024-11-13 15:32:37,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-13 15:32:37,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 152. [2024-11-13 15:32:37,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 133 states have (on average 1.3233082706766917) internal successors, (176), 133 states have internal predecessors, (176), 12 states have call successors, (12), 6 states have call predecessors, (12), 6 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-13 15:32:37,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 200 transitions. [2024-11-13 15:32:37,563 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 200 transitions. Word has length 105 [2024-11-13 15:32:37,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:32:37,564 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 200 transitions. [2024-11-13 15:32:37,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 3.84) internal successors, (96), 26 states have internal predecessors, (96), 8 states have call successors, (20), 6 states have call predecessors, (20), 9 states have return successors, (20), 6 states have call predecessors, (20), 8 states have call successors, (20) [2024-11-13 15:32:37,564 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 200 transitions. [2024-11-13 15:32:37,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-13 15:32:37,565 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:32:37,566 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-13 15:32:37,597 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-13 15:32:37,775 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-13 15:32:37,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:32:37,966 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:32:37,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:32:37,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1339542185, now seen corresponding path program 1 times [2024-11-13 15:32:37,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:32:37,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1672066142] [2024-11-13 15:32:37,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:32:37,967 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-13 15:32:37,968 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:32:37,969 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:32:37,971 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/mathsat -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-13 15:32:38,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:38,589 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-11-13 15:32:38,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:32:39,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 15:32:43,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2024-11-13 15:32:45,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2024-11-13 15:32:47,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2024-11-13 15:32:50,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 29 [2024-11-13 15:32:54,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 29 [2024-11-13 15:32:55,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 29 [2024-11-13 15:32:56,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 55 [2024-11-13 15:32:56,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 28 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 71 [2024-11-13 15:33:01,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 77 [2024-11-13 15:33:06,805 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:33:06,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 116 treesize of output 60 [2024-11-13 15:33:08,076 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 102 proven. 98 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-13 15:33:08,076 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:33:42,037 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:33:42,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1672066142] [2024-11-13 15:33:42,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1672066142] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:33:42,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333382038] [2024-11-13 15:33:42,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:33:42,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:33:42,038 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:33:42,040 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:33:42,047 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30c7bf25-edd1-4d09-88a0-849f85bc147e/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-13 15:33:42,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:33:42,364 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-11-13 15:33:42,371 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:33:43,831 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-13 15:33:51,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 22 [2024-11-13 15:33:55,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 22 [2024-11-13 15:33:58,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2024-11-13 15:34:02,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2024-11-13 15:34:07,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2024-11-13 15:34:10,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 45 [2024-11-13 15:34:13,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 61 [2024-11-13 15:34:23,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 104 [2024-11-13 15:34:24,493 INFO L349 Elim1Store]: treesize reduction 372, result has 4.6 percent of original size [2024-11-13 15:34:24,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 5 select indices, 5 select index equivalence classes, 28 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 8 case distinctions, treesize of input 702 treesize of output 641 [2024-11-13 15:34:25,050 INFO L224 Elim1Store]: Index analysis took 356 ms [2024-11-13 15:34:26,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 161 [2024-11-13 15:34:26,689 INFO L224 Elim1Store]: Index analysis took 353 ms [2024-11-13 15:34:27,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 161 [2024-11-13 15:34:28,391 INFO L224 Elim1Store]: Index analysis took 361 ms [2024-11-13 15:34:29,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 161 [2024-11-13 15:34:30,862 INFO L224 Elim1Store]: Index analysis took 142 ms [2024-11-13 15:34:31,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 114 [2024-11-13 15:34:31,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 114 [2024-11-13 15:34:32,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 128 [2024-11-13 15:34:32,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 67 [2024-11-13 15:34:48,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 558 treesize of output 457 [2024-11-13 15:34:49,015 INFO L349 Elim1Store]: treesize reduction 81, result has 12.0 percent of original size [2024-11-13 15:34:49,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 9 case distinctions, treesize of input 2898 treesize of output 2522 [2024-11-13 15:35:25,872 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:35:25,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 28 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 588 treesize of output 436