./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-21.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d622f2d3-11b5-4214-a4d6-990654b555be/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d622f2d3-11b5-4214-a4d6-990654b555be/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d622f2d3-11b5-4214-a4d6-990654b555be/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d622f2d3-11b5-4214-a4d6-990654b555be/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-21.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d622f2d3-11b5-4214-a4d6-990654b555be/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d622f2d3-11b5-4214-a4d6-990654b555be/bin/uautomizer-verify-4GaUIPS5ZU --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 abb22874cc515e6597c493938d8a3907b8ef4cc1e14b264963b72f5eff3fe5c3 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:02:26,974 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:02:27,077 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d622f2d3-11b5-4214-a4d6-990654b555be/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-31 22:02:27,083 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:02:27,086 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:02:27,131 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:02:27,132 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:02:27,133 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:02:27,134 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:02:27,136 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:02:27,137 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:02:27,137 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:02:27,139 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:02:27,140 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:02:27,140 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:02:27,142 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:02:27,143 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:02:27,146 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:02:27,146 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:02:27,147 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:02:27,147 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:02:27,148 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:02:27,148 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:02:27,149 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:02:27,149 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:02:27,150 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:02:27,150 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:02:27,150 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:02:27,151 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:02:27,152 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:02:27,152 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:02:27,153 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:02:27,153 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:02:27,154 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:02:27,154 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:02:27,155 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:02:27,155 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:02:27,155 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 22:02:27,156 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:02:27,156 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:02:27,157 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:02:27,157 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:02:27,158 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d622f2d3-11b5-4214-a4d6-990654b555be/bin/uautomizer-verify-4GaUIPS5ZU/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d622f2d3-11b5-4214-a4d6-990654b555be/bin/uautomizer-verify-4GaUIPS5ZU 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 -> abb22874cc515e6597c493938d8a3907b8ef4cc1e14b264963b72f5eff3fe5c3 [2024-10-31 22:02:27,497 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:02:27,531 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:02:27,535 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:02:27,536 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:02:27,537 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:02:27,538 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d622f2d3-11b5-4214-a4d6-990654b555be/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-21.i Unable to find full path for "g++" [2024-10-31 22:02:29,779 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:02:30,055 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:02:30,056 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d622f2d3-11b5-4214-a4d6-990654b555be/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-21.i [2024-10-31 22:02:30,067 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d622f2d3-11b5-4214-a4d6-990654b555be/bin/uautomizer-verify-4GaUIPS5ZU/data/81984633c/ff249810e9094faf9cb8b2871a1834d4/FLAGd988a75e8 [2024-10-31 22:02:30,409 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d622f2d3-11b5-4214-a4d6-990654b555be/bin/uautomizer-verify-4GaUIPS5ZU/data/81984633c/ff249810e9094faf9cb8b2871a1834d4 [2024-10-31 22:02:30,411 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:02:30,413 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:02:30,414 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:02:30,414 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:02:30,422 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:02:30,425 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:02:30" (1/1) ... [2024-10-31 22:02:30,426 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@161c6814 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:30, skipping insertion in model container [2024-10-31 22:02:30,427 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:02:30" (1/1) ... [2024-10-31 22:02:30,464 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:02:30,663 WARN L251 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_d622f2d3-11b5-4214-a4d6-990654b555be/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-21.i[917,930] [2024-10-31 22:02:30,719 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:02:30,730 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:02:30,742 WARN L251 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_d622f2d3-11b5-4214-a4d6-990654b555be/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-21.i[917,930] [2024-10-31 22:02:30,775 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:02:30,800 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:02:30,800 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:30 WrapperNode [2024-10-31 22:02:30,800 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:02:30,801 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:02:30,802 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:02:30,802 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:02:30,810 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:30" (1/1) ... [2024-10-31 22:02:30,826 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:30" (1/1) ... [2024-10-31 22:02:30,870 INFO L138 Inliner]: procedures = 29, calls = 110, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 404 [2024-10-31 22:02:30,871 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:02:30,872 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:02:30,872 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:02:30,872 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:02:30,884 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:30" (1/1) ... [2024-10-31 22:02:30,884 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:30" (1/1) ... [2024-10-31 22:02:30,889 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:30" (1/1) ... [2024-10-31 22:02:30,909 INFO L175 MemorySlicer]: Split 91 memory accesses to 2 slices as follows [2, 89]. 98 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 9]. The 12 writes are split as follows [0, 12]. [2024-10-31 22:02:30,909 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:30" (1/1) ... [2024-10-31 22:02:30,910 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:30" (1/1) ... [2024-10-31 22:02:30,924 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:30" (1/1) ... [2024-10-31 22:02:30,928 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:30" (1/1) ... [2024-10-31 22:02:30,931 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:30" (1/1) ... [2024-10-31 22:02:30,937 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:30" (1/1) ... [2024-10-31 22:02:30,942 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:02:30,946 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:02:30,946 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:02:30,946 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:02:30,947 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:30" (1/1) ... [2024-10-31 22:02:30,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:02:30,966 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d622f2d3-11b5-4214-a4d6-990654b555be/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:02:30,988 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d622f2d3-11b5-4214-a4d6-990654b555be/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:02:30,994 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d622f2d3-11b5-4214-a4d6-990654b555be/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:02:31,027 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:02:31,028 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-31 22:02:31,029 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-31 22:02:31,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-31 22:02:31,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-31 22:02:31,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-31 22:02:31,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-31 22:02:31,030 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-31 22:02:31,032 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-31 22:02:31,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-31 22:02:31,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-31 22:02:31,033 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-31 22:02:31,033 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-31 22:02:31,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 22:02:31,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-31 22:02:31,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:02:31,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:02:31,209 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:02:31,212 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:02:31,822 INFO L? ?]: Removed 106 outVars from TransFormulas that were not future-live. [2024-10-31 22:02:31,822 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:02:31,837 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:02:31,837 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 22:02:31,838 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:02:31 BoogieIcfgContainer [2024-10-31 22:02:31,838 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:02:31,841 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:02:31,841 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:02:31,845 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:02:31,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:02:30" (1/3) ... [2024-10-31 22:02:31,846 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a3146cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:02:31, skipping insertion in model container [2024-10-31 22:02:31,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:30" (2/3) ... [2024-10-31 22:02:31,846 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a3146cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:02:31, skipping insertion in model container [2024-10-31 22:02:31,847 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:02:31" (3/3) ... [2024-10-31 22:02:31,848 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-21.i [2024-10-31 22:02:31,865 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:02:31,866 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-31 22:02:31,928 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:02:31,934 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;@62197e0b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:02:31,935 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-31 22:02:31,939 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 86 states have (on average 1.4883720930232558) internal successors, (128), 87 states have internal predecessors, (128), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-31 22:02:31,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-31 22:02:31,947 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:02:31,948 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:02:31,948 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:02:31,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:02:31,953 INFO L85 PathProgramCache]: Analyzing trace with hash 306818116, now seen corresponding path program 1 times [2024-10-31 22:02:31,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:02:31,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465700401] [2024-10-31 22:02:31,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:02:31,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:02:32,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:32,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-31 22:02:32,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:32,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:02:32,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:32,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-31 22:02:32,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:32,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:02:32,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:32,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:02:32,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:32,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:02:32,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:32,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:02:32,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:32,406 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-31 22:02:32,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:02:32,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465700401] [2024-10-31 22:02:32,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465700401] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:02:32,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:02:32,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:02:32,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607876259] [2024-10-31 22:02:32,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:02:32,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-31 22:02:32,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:02:32,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-31 22:02:32,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 22:02:32,450 INFO L87 Difference]: Start difference. First operand has 96 states, 86 states have (on average 1.4883720930232558) internal successors, (128), 87 states have internal predecessors, (128), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-31 22:02:32,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:02:32,488 INFO L93 Difference]: Finished difference Result 185 states and 285 transitions. [2024-10-31 22:02:32,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-31 22:02:32,490 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 80 [2024-10-31 22:02:32,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:02:32,500 INFO L225 Difference]: With dead ends: 185 [2024-10-31 22:02:32,500 INFO L226 Difference]: Without dead ends: 92 [2024-10-31 22:02:32,505 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 22:02:32,509 INFO L432 NwaCegarLoop]: 135 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, 135 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-10-31 22:02:32,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:02:32,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-31 22:02:32,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-10-31 22:02:32,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 83 states have (on average 1.4578313253012047) internal successors, (121), 83 states have internal predecessors, (121), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-31 22:02:32,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 135 transitions. [2024-10-31 22:02:32,558 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 135 transitions. Word has length 80 [2024-10-31 22:02:32,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:02:32,559 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 135 transitions. [2024-10-31 22:02:32,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-31 22:02:32,559 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 135 transitions. [2024-10-31 22:02:32,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-31 22:02:32,562 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:02:32,563 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:02:32,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 22:02:32,563 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:02:32,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:02:32,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1397824002, now seen corresponding path program 1 times [2024-10-31 22:02:32,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:02:32,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793882360] [2024-10-31 22:02:32,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:02:32,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:02:32,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:33,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-31 22:02:33,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:33,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:02:33,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:33,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-31 22:02:33,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:33,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:02:33,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:33,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:02:33,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:33,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:02:33,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:33,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:02:33,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:33,904 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-31 22:02:33,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:02:33,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793882360] [2024-10-31 22:02:33,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793882360] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:02:33,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:02:33,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-31 22:02:33,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238799831] [2024-10-31 22:02:33,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:02:33,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 22:02:33,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:02:33,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 22:02:33,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:02:33,913 INFO L87 Difference]: Start difference. First operand 92 states and 135 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-31 22:02:34,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:02:34,636 INFO L93 Difference]: Finished difference Result 301 states and 443 transitions. [2024-10-31 22:02:34,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:02:34,637 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 80 [2024-10-31 22:02:34,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:02:34,640 INFO L225 Difference]: With dead ends: 301 [2024-10-31 22:02:34,642 INFO L226 Difference]: Without dead ends: 212 [2024-10-31 22:02:34,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-31 22:02:34,645 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 195 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-31 22:02:34,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 706 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-31 22:02:34,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-10-31 22:02:34,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 185. [2024-10-31 22:02:34,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 168 states have (on average 1.4404761904761905) internal successors, (242), 168 states have internal predecessors, (242), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-31 22:02:34,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 270 transitions. [2024-10-31 22:02:34,676 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 270 transitions. Word has length 80 [2024-10-31 22:02:34,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:02:34,680 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 270 transitions. [2024-10-31 22:02:34,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-31 22:02:34,680 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 270 transitions. [2024-10-31 22:02:34,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-31 22:02:34,682 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:02:34,683 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:02:34,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 22:02:34,683 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:02:34,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:02:34,684 INFO L85 PathProgramCache]: Analyzing trace with hash 986714953, now seen corresponding path program 1 times [2024-10-31 22:02:34,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:02:34,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920493009] [2024-10-31 22:02:34,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:02:34,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:02:34,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:34,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-31 22:02:34,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:34,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:02:34,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:34,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-31 22:02:34,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:34,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:02:34,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:34,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:02:34,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:34,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:02:34,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:34,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:02:34,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:34,922 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-31 22:02:34,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:02:34,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920493009] [2024-10-31 22:02:34,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920493009] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:02:34,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:02:34,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:02:34,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102621580] [2024-10-31 22:02:34,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:02:34,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:02:34,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:02:34,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:02:34,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:02:34,931 INFO L87 Difference]: Start difference. First operand 185 states and 270 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-31 22:02:34,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:02:34,984 INFO L93 Difference]: Finished difference Result 370 states and 541 transitions. [2024-10-31 22:02:34,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:02:34,985 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 83 [2024-10-31 22:02:34,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:02:34,989 INFO L225 Difference]: With dead ends: 370 [2024-10-31 22:02:34,989 INFO L226 Difference]: Without dead ends: 188 [2024-10-31 22:02:34,990 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:02:34,995 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:02:34,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 513 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:02:34,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-10-31 22:02:35,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2024-10-31 22:02:35,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 171 states have (on average 1.4269005847953216) internal successors, (244), 171 states have internal predecessors, (244), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-31 22:02:35,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 272 transitions. [2024-10-31 22:02:35,035 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 272 transitions. Word has length 83 [2024-10-31 22:02:35,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:02:35,037 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 272 transitions. [2024-10-31 22:02:35,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-31 22:02:35,038 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 272 transitions. [2024-10-31 22:02:35,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-31 22:02:35,040 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:02:35,043 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:02:35,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 22:02:35,044 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:02:35,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:02:35,044 INFO L85 PathProgramCache]: Analyzing trace with hash -863945486, now seen corresponding path program 1 times [2024-10-31 22:02:35,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:02:35,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255059512] [2024-10-31 22:02:35,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:02:35,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:02:35,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:36,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-31 22:02:36,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:36,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:02:36,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:36,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-31 22:02:36,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:36,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:02:36,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:36,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:02:36,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:36,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:02:36,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:36,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:02:36,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:36,855 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-31 22:02:36,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:02:36,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255059512] [2024-10-31 22:02:36,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255059512] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:02:36,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:02:36,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-31 22:02:36,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409479085] [2024-10-31 22:02:36,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:02:36,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-31 22:02:36,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:02:36,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-31 22:02:36,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-10-31 22:02:36,862 INFO L87 Difference]: Start difference. First operand 188 states and 272 transitions. Second operand has 12 states, 10 states have (on average 5.5) internal successors, (55), 12 states have internal predecessors, (55), 4 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-31 22:02:37,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:02:37,910 INFO L93 Difference]: Finished difference Result 412 states and 590 transitions. [2024-10-31 22:02:37,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-31 22:02:37,911 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 5.5) internal successors, (55), 12 states have internal predecessors, (55), 4 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 4 states have call successors, (7) Word has length 87 [2024-10-31 22:02:37,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:02:37,914 INFO L225 Difference]: With dead ends: 412 [2024-10-31 22:02:37,914 INFO L226 Difference]: Without dead ends: 320 [2024-10-31 22:02:37,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2024-10-31 22:02:37,916 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 504 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-31 22:02:37,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [506 Valid, 936 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-31 22:02:37,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-10-31 22:02:37,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 296. [2024-10-31 22:02:37,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 271 states have (on average 1.4206642066420665) internal successors, (385), 273 states have internal predecessors, (385), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-31 22:02:37,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 425 transitions. [2024-10-31 22:02:37,987 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 425 transitions. Word has length 87 [2024-10-31 22:02:37,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:02:37,989 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 425 transitions. [2024-10-31 22:02:37,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 5.5) internal successors, (55), 12 states have internal predecessors, (55), 4 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-31 22:02:37,989 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 425 transitions. [2024-10-31 22:02:37,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-31 22:02:37,994 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:02:37,994 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:02:37,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 22:02:37,995 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:02:37,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:02:37,999 INFO L85 PathProgramCache]: Analyzing trace with hash -907307414, now seen corresponding path program 1 times [2024-10-31 22:02:37,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:02:37,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016929395] [2024-10-31 22:02:37,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:02:37,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:02:38,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:39,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-31 22:02:39,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:39,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:02:39,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:39,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-31 22:02:39,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:39,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:02:39,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:39,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:02:39,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:39,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:02:39,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:39,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:02:39,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:39,801 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-31 22:02:39,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:02:39,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016929395] [2024-10-31 22:02:39,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016929395] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:02:39,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:02:39,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-31 22:02:39,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246382152] [2024-10-31 22:02:39,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:02:39,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-31 22:02:39,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:02:39,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-31 22:02:39,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-10-31 22:02:39,807 INFO L87 Difference]: Start difference. First operand 296 states and 425 transitions. Second operand has 11 states, 9 states have (on average 6.222222222222222) internal successors, (56), 11 states have internal predecessors, (56), 4 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-31 22:02:40,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:02:40,385 INFO L93 Difference]: Finished difference Result 545 states and 777 transitions. [2024-10-31 22:02:40,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-31 22:02:40,386 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 6.222222222222222) internal successors, (56), 11 states have internal predecessors, (56), 4 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 4 states have call successors, (7) Word has length 88 [2024-10-31 22:02:40,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:02:40,390 INFO L225 Difference]: With dead ends: 545 [2024-10-31 22:02:40,390 INFO L226 Difference]: Without dead ends: 374 [2024-10-31 22:02:40,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-10-31 22:02:40,394 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 182 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-31 22:02:40,395 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 584 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-31 22:02:40,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2024-10-31 22:02:40,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 316. [2024-10-31 22:02:40,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 291 states have (on average 1.4123711340206186) internal successors, (411), 293 states have internal predecessors, (411), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-31 22:02:40,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 451 transitions. [2024-10-31 22:02:40,434 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 451 transitions. Word has length 88 [2024-10-31 22:02:40,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:02:40,434 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 451 transitions. [2024-10-31 22:02:40,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 6.222222222222222) internal successors, (56), 11 states have internal predecessors, (56), 4 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-31 22:02:40,435 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 451 transitions. [2024-10-31 22:02:40,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-31 22:02:40,436 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:02:40,436 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:02:40,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 22:02:40,436 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:02:40,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:02:40,437 INFO L85 PathProgramCache]: Analyzing trace with hash -438132547, now seen corresponding path program 1 times [2024-10-31 22:02:40,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:02:40,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066424342] [2024-10-31 22:02:40,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:02:40,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:02:40,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:40,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-31 22:02:40,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:40,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:02:40,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:40,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-31 22:02:40,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:40,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:02:40,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:40,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:02:40,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:40,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:02:40,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:40,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:02:40,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:40,687 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-31 22:02:40,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:02:40,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066424342] [2024-10-31 22:02:40,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066424342] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:02:40,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:02:40,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-31 22:02:40,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866672803] [2024-10-31 22:02:40,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:02:40,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 22:02:40,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:02:40,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 22:02:40,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:02:40,689 INFO L87 Difference]: Start difference. First operand 316 states and 451 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-31 22:02:40,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:02:40,753 INFO L93 Difference]: Finished difference Result 330 states and 467 transitions. [2024-10-31 22:02:40,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-31 22:02:40,753 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 89 [2024-10-31 22:02:40,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:02:40,756 INFO L225 Difference]: With dead ends: 330 [2024-10-31 22:02:40,756 INFO L226 Difference]: Without dead ends: 328 [2024-10-31 22:02:40,757 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:02:40,759 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:02:40,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 888 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:02:40,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2024-10-31 22:02:40,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2024-10-31 22:02:40,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 303 states have (on average 1.396039603960396) internal successors, (423), 305 states have internal predecessors, (423), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-31 22:02:40,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 463 transitions. [2024-10-31 22:02:40,804 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 463 transitions. Word has length 89 [2024-10-31 22:02:40,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:02:40,804 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 463 transitions. [2024-10-31 22:02:40,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-31 22:02:40,805 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 463 transitions. [2024-10-31 22:02:40,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-31 22:02:40,806 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:02:40,807 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:02:40,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 22:02:40,807 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:02:40,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:02:40,808 INFO L85 PathProgramCache]: Analyzing trace with hash -510286070, now seen corresponding path program 1 times [2024-10-31 22:02:40,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:02:40,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657035621] [2024-10-31 22:02:40,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:02:40,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:02:40,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:41,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-31 22:02:41,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:41,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:02:41,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:41,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-31 22:02:41,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:41,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:02:41,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:41,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:02:41,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:41,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:02:41,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:41,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:02:41,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:41,552 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-31 22:02:41,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:02:41,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657035621] [2024-10-31 22:02:41,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657035621] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:02:41,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:02:41,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-31 22:02:41,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676247433] [2024-10-31 22:02:41,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:02:41,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-31 22:02:41,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:02:41,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-31 22:02:41,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-31 22:02:41,556 INFO L87 Difference]: Start difference. First operand 328 states and 463 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-31 22:02:42,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:02:42,271 INFO L93 Difference]: Finished difference Result 837 states and 1170 transitions. [2024-10-31 22:02:42,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-31 22:02:42,273 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 89 [2024-10-31 22:02:42,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:02:42,276 INFO L225 Difference]: With dead ends: 837 [2024-10-31 22:02:42,276 INFO L226 Difference]: Without dead ends: 534 [2024-10-31 22:02:42,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-10-31 22:02:42,280 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 184 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-31 22:02:42,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 951 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-31 22:02:42,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2024-10-31 22:02:42,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 432. [2024-10-31 22:02:42,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 398 states have (on average 1.3919597989949748) internal successors, (554), 400 states have internal predecessors, (554), 27 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-31 22:02:42,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 608 transitions. [2024-10-31 22:02:42,321 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 608 transitions. Word has length 89 [2024-10-31 22:02:42,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:02:42,322 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 608 transitions. [2024-10-31 22:02:42,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-31 22:02:42,322 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 608 transitions. [2024-10-31 22:02:42,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-31 22:02:42,323 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:02:42,323 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:02:42,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 22:02:42,324 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:02:42,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:02:42,324 INFO L85 PathProgramCache]: Analyzing trace with hash -827246940, now seen corresponding path program 1 times [2024-10-31 22:02:42,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:02:42,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867846743] [2024-10-31 22:02:42,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:02:42,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:02:42,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:42,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-31 22:02:42,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:42,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:02:42,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:42,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-31 22:02:42,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:42,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:02:42,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:42,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:02:42,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:42,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:02:42,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:42,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:02:42,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:42,523 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-31 22:02:42,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:02:42,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867846743] [2024-10-31 22:02:42,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867846743] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:02:42,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:02:42,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:02:42,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859555170] [2024-10-31 22:02:42,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:02:42,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:02:42,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:02:42,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:02:42,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:02:42,525 INFO L87 Difference]: Start difference. First operand 432 states and 608 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-31 22:02:42,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:02:42,852 INFO L93 Difference]: Finished difference Result 969 states and 1360 transitions. [2024-10-31 22:02:42,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-31 22:02:42,853 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 90 [2024-10-31 22:02:42,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:02:42,856 INFO L225 Difference]: With dead ends: 969 [2024-10-31 22:02:42,856 INFO L226 Difference]: Without dead ends: 562 [2024-10-31 22:02:42,857 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:02:42,858 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 194 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 22:02:42,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 455 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 22:02:42,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2024-10-31 22:02:42,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 509. [2024-10-31 22:02:42,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 475 states have (on average 1.3936842105263159) internal successors, (662), 477 states have internal predecessors, (662), 27 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-31 22:02:42,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 716 transitions. [2024-10-31 22:02:42,899 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 716 transitions. Word has length 90 [2024-10-31 22:02:42,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:02:42,900 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 716 transitions. [2024-10-31 22:02:42,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-31 22:02:42,900 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 716 transitions. [2024-10-31 22:02:42,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-31 22:02:42,901 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:02:42,901 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:02:42,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-31 22:02:42,902 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:02:42,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:02:42,902 INFO L85 PathProgramCache]: Analyzing trace with hash -540215580, now seen corresponding path program 1 times [2024-10-31 22:02:42,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:02:42,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567784990] [2024-10-31 22:02:42,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:02:42,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:02:42,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:43,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-31 22:02:43,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:43,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:02:43,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:43,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-31 22:02:43,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:43,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:02:43,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:43,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:02:43,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:43,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:02:43,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:43,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:02:43,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:43,096 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-31 22:02:43,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:02:43,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567784990] [2024-10-31 22:02:43,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567784990] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:02:43,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:02:43,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-31 22:02:43,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769751703] [2024-10-31 22:02:43,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:02:43,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 22:02:43,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:02:43,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 22:02:43,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:02:43,098 INFO L87 Difference]: Start difference. First operand 509 states and 716 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-31 22:02:43,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:02:43,220 INFO L93 Difference]: Finished difference Result 1003 states and 1408 transitions. [2024-10-31 22:02:43,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-31 22:02:43,221 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 90 [2024-10-31 22:02:43,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:02:43,223 INFO L225 Difference]: With dead ends: 1003 [2024-10-31 22:02:43,223 INFO L226 Difference]: Without dead ends: 519 [2024-10-31 22:02:43,226 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:02:43,227 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:02:43,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 885 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:02:43,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2024-10-31 22:02:43,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 507. [2024-10-31 22:02:43,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 473 states have (on average 1.3932346723044398) internal successors, (659), 475 states have internal predecessors, (659), 27 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-31 22:02:43,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 713 transitions. [2024-10-31 22:02:43,267 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 713 transitions. Word has length 90 [2024-10-31 22:02:43,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:02:43,268 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 713 transitions. [2024-10-31 22:02:43,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-31 22:02:43,268 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 713 transitions. [2024-10-31 22:02:43,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-31 22:02:43,269 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:02:43,270 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:02:43,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-31 22:02:43,271 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:02:43,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:02:43,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1938045312, now seen corresponding path program 1 times [2024-10-31 22:02:43,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:02:43,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428427423] [2024-10-31 22:02:43,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:02:43,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:02:43,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:43,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-31 22:02:43,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:43,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:02:43,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:43,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-31 22:02:43,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:43,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:02:43,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:43,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:02:43,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:43,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:02:43,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:43,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:02:43,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:43,371 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-31 22:02:43,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:02:43,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428427423] [2024-10-31 22:02:43,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428427423] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:02:43,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:02:43,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:02:43,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013154953] [2024-10-31 22:02:43,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:02:43,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:02:43,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:02:43,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:02:43,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:02:43,373 INFO L87 Difference]: Start difference. First operand 507 states and 713 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-31 22:02:43,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:02:43,409 INFO L93 Difference]: Finished difference Result 892 states and 1262 transitions. [2024-10-31 22:02:43,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:02:43,412 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 90 [2024-10-31 22:02:43,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:02:43,415 INFO L225 Difference]: With dead ends: 892 [2024-10-31 22:02:43,415 INFO L226 Difference]: Without dead ends: 514 [2024-10-31 22:02:43,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 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-10-31 22:02:43,417 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:02:43,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 262 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:02:43,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2024-10-31 22:02:43,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 514. [2024-10-31 22:02:43,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 480 states have (on average 1.3875) internal successors, (666), 482 states have internal predecessors, (666), 27 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-31 22:02:43,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 720 transitions. [2024-10-31 22:02:43,456 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 720 transitions. Word has length 90 [2024-10-31 22:02:43,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:02:43,456 INFO L471 AbstractCegarLoop]: Abstraction has 514 states and 720 transitions. [2024-10-31 22:02:43,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-31 22:02:43,457 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 720 transitions. [2024-10-31 22:02:43,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-31 22:02:43,458 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:02:43,458 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:02:43,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-31 22:02:43,459 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:02:43,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:02:43,459 INFO L85 PathProgramCache]: Analyzing trace with hash 768574082, now seen corresponding path program 1 times [2024-10-31 22:02:43,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:02:43,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682332386] [2024-10-31 22:02:43,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:02:43,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:02:43,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-31 22:02:43,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [396932144] [2024-10-31 22:02:43,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:02:43,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:02:43,522 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d622f2d3-11b5-4214-a4d6-990654b555be/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:02:43,526 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d622f2d3-11b5-4214-a4d6-990654b555be/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 22:02:43,527 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d622f2d3-11b5-4214-a4d6-990654b555be/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-31 22:02:43,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:02:43,736 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:02:43,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:02:43,972 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:02:43,972 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-31 22:02:43,973 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-31 22:02:43,996 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d622f2d3-11b5-4214-a4d6-990654b555be/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-31 22:02:44,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d622f2d3-11b5-4214-a4d6-990654b555be/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-31 22:02:44,178 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:02:44,347 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-10-31 22:02:44,353 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.10 10:02:44 BoogieIcfgContainer [2024-10-31 22:02:44,354 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-31 22:02:44,354 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-31 22:02:44,354 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-31 22:02:44,354 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-31 22:02:44,356 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:02:31" (3/4) ... [2024-10-31 22:02:44,359 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-10-31 22:02:44,361 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-31 22:02:44,361 INFO L158 Benchmark]: Toolchain (without parser) took 13948.70ms. Allocated memory was 176.2MB in the beginning and 268.4MB in the end (delta: 92.3MB). Free memory was 142.9MB in the beginning and 112.8MB in the end (delta: 30.1MB). Peak memory consumption was 123.1MB. Max. memory is 16.1GB. [2024-10-31 22:02:44,361 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 111.1MB. Free memory is still 88.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:02:44,362 INFO L158 Benchmark]: CACSL2BoogieTranslator took 386.40ms. Allocated memory is still 176.2MB. Free memory was 142.2MB in the beginning and 126.1MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-31 22:02:44,362 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.79ms. Allocated memory is still 176.2MB. Free memory was 126.1MB in the beginning and 122.6MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-31 22:02:44,362 INFO L158 Benchmark]: Boogie Preprocessor took 71.73ms. Allocated memory is still 176.2MB. Free memory was 122.6MB in the beginning and 118.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-31 22:02:44,363 INFO L158 Benchmark]: RCFGBuilder took 892.38ms. Allocated memory is still 176.2MB. Free memory was 118.4MB in the beginning and 89.7MB in the end (delta: 28.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-31 22:02:44,364 INFO L158 Benchmark]: TraceAbstraction took 12513.06ms. Allocated memory was 176.2MB in the beginning and 268.4MB in the end (delta: 92.3MB). Free memory was 89.1MB in the beginning and 112.8MB in the end (delta: -23.7MB). Peak memory consumption was 70.6MB. Max. memory is 16.1GB. [2024-10-31 22:02:44,364 INFO L158 Benchmark]: Witness Printer took 6.55ms. Allocated memory is still 268.4MB. Free memory is still 112.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:02:44,366 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.21ms. Allocated memory is still 111.1MB. Free memory is still 88.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 386.40ms. Allocated memory is still 176.2MB. Free memory was 142.2MB in the beginning and 126.1MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.79ms. Allocated memory is still 176.2MB. Free memory was 126.1MB in the beginning and 122.6MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.73ms. Allocated memory is still 176.2MB. Free memory was 122.6MB in the beginning and 118.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 892.38ms. Allocated memory is still 176.2MB. Free memory was 118.4MB in the beginning and 89.7MB in the end (delta: 28.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 12513.06ms. Allocated memory was 176.2MB in the beginning and 268.4MB in the end (delta: 92.3MB). Free memory was 89.1MB in the beginning and 112.8MB in the end (delta: -23.7MB). Peak memory consumption was 70.6MB. Max. memory is 16.1GB. * Witness Printer took 6.55ms. Allocated memory is still 268.4MB. Free memory is still 112.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 103, overapproximation of someBinaryFLOATComparisonOperation at line 96. Possible FailurePath: [L33] unsigned char isInitial = 0; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 32, 0, 15.6, 15.4, 32.2, 1, 256, 5.75, 8.6 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 32, 0, 15.6, 15.4, 32.2, 1, 256, 5.75, 8.6 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 32, 0, 15.6, 15.4, 32.2, 1, 256, 5.75, 8.6 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 32, 0, 15.6, 15.4, 32.2, 1, 256, 5.75, 8.6 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 32, 0, 15.6, 15.4, 32.2, 1, 256, 5.75, 8.6 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 32, 0, 15.6, 15.4, 32.2, 1, 256, 5.75, 8.6 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 32, 0, 15.6, 15.4, 32.2, 1, 256, 5.75, 8.6 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 32, 0, 15.6, 15.4, 32.2, 1, 256, 5.75, 8.6 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 32, 0, 15.6, 15.4, 32.2, 1, 256, 5.75, 8.6 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 32, 0, 15.6, 15.4, 32.2, 1, 256, 5.75, 8.6 }; [L45] unsigned short int* WrapperStruct0_var_1_1_Pointer = &(WrapperStruct0.var_1_1); [L46] unsigned char* WrapperStruct0_var_1_7_Pointer = &(WrapperStruct0.var_1_7); [L47] double* WrapperStruct0_var_1_8_Pointer = &(WrapperStruct0.var_1_8); [L48] double* WrapperStruct0_var_1_9_Pointer = &(WrapperStruct0.var_1_9); [L49] double* WrapperStruct0_var_1_10_Pointer = &(WrapperStruct0.var_1_10); [L50] unsigned char* WrapperStruct0_var_1_12_Pointer = &(WrapperStruct0.var_1_12); [L51] signed short int* WrapperStruct0_var_1_13_Pointer = &(WrapperStruct0.var_1_13); [L52] float* WrapperStruct0_var_1_14_Pointer = &(WrapperStruct0.var_1_14); [L53] float* WrapperStruct0_var_1_15_Pointer = &(WrapperStruct0.var_1_15); [L54] unsigned char last_1_WrapperStruct0_var_1_7 = 0; [L55] signed short int last_1_WrapperStruct0_var_1_13 = 256; VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=0, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L107] isInitial = 1 [L108] FCALL initially() [L109] COND TRUE 1 [L110] CALL updateLastVariables() [L99] EXPR WrapperStruct0.var_1_7 [L99] last_1_WrapperStruct0_var_1_7 = WrapperStruct0.var_1_7 [L100] EXPR WrapperStruct0.var_1_13 [L100] last_1_WrapperStruct0_var_1_13 = WrapperStruct0.var_1_13 [L110] RET updateLastVariables() [L111] CALL updateVariables() [L84] WrapperStruct0.var_1_8 = __VERIFIER_nondet_double() [L85] EXPR WrapperStruct0.var_1_8 [L85] EXPR WrapperStruct0.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L85] EXPR WrapperStruct0.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F [L85] EXPR WrapperStruct0.var_1_8 [L85] EXPR WrapperStruct0.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L85] EXPR (WrapperStruct0.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F) || (WrapperStruct0.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L85] EXPR (WrapperStruct0.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F) || (WrapperStruct0.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L85] CALL assume_abort_if_not((WrapperStruct0.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F) || (WrapperStruct0.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L85] RET assume_abort_if_not((WrapperStruct0.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F) || (WrapperStruct0.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L86] WrapperStruct0.var_1_9 = __VERIFIER_nondet_double() [L87] EXPR WrapperStruct0.var_1_9 [L87] EXPR WrapperStruct0.var_1_9 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_9 <= -1.0e-20F VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L87] EXPR WrapperStruct0.var_1_9 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_9 <= -1.0e-20F [L87] EXPR WrapperStruct0.var_1_9 [L87] EXPR WrapperStruct0.var_1_9 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_9 <= -1.0e-20F VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L87] EXPR (WrapperStruct0.var_1_9 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_9 <= -1.0e-20F) || (WrapperStruct0.var_1_9 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_9 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L87] EXPR (WrapperStruct0.var_1_9 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_9 <= -1.0e-20F) || (WrapperStruct0.var_1_9 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_9 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L87] CALL assume_abort_if_not((WrapperStruct0.var_1_9 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_9 <= -1.0e-20F) || (WrapperStruct0.var_1_9 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L87] RET assume_abort_if_not((WrapperStruct0.var_1_9 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_9 <= -1.0e-20F) || (WrapperStruct0.var_1_9 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L88] WrapperStruct0.var_1_10 = __VERIFIER_nondet_double() [L89] EXPR WrapperStruct0.var_1_10 [L89] EXPR WrapperStruct0.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_10 <= -1.0e-20F VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L89] EXPR WrapperStruct0.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_10 <= -1.0e-20F [L89] EXPR WrapperStruct0.var_1_10 [L89] EXPR WrapperStruct0.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_10 <= -1.0e-20F VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L89] EXPR (WrapperStruct0.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_10 <= -1.0e-20F) || (WrapperStruct0.var_1_10 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L89] EXPR (WrapperStruct0.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_10 <= -1.0e-20F) || (WrapperStruct0.var_1_10 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L89] CALL assume_abort_if_not((WrapperStruct0.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_10 <= -1.0e-20F) || (WrapperStruct0.var_1_10 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L89] RET assume_abort_if_not((WrapperStruct0.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_10 <= -1.0e-20F) || (WrapperStruct0.var_1_10 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L90] WrapperStruct0.var_1_12 = __VERIFIER_nondet_uchar() [L91] EXPR WrapperStruct0.var_1_12 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L91] CALL assume_abort_if_not(WrapperStruct0.var_1_12 >= 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L91] RET assume_abort_if_not(WrapperStruct0.var_1_12 >= 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L92] EXPR WrapperStruct0.var_1_12 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L92] CALL assume_abort_if_not(WrapperStruct0.var_1_12 <= 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L92] RET assume_abort_if_not(WrapperStruct0.var_1_12 <= 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L93] WrapperStruct0.var_1_14 = __VERIFIER_nondet_float() [L94] EXPR WrapperStruct0.var_1_14 [L94] EXPR WrapperStruct0.var_1_14 >= 0.0F && WrapperStruct0.var_1_14 <= -1.0e-20F VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L94] EXPR WrapperStruct0.var_1_14 >= 0.0F && WrapperStruct0.var_1_14 <= -1.0e-20F [L94] EXPR WrapperStruct0.var_1_14 [L94] EXPR WrapperStruct0.var_1_14 >= 0.0F && WrapperStruct0.var_1_14 <= -1.0e-20F VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L94] EXPR (WrapperStruct0.var_1_14 >= 0.0F && WrapperStruct0.var_1_14 <= -1.0e-20F) || (WrapperStruct0.var_1_14 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L94] EXPR (WrapperStruct0.var_1_14 >= 0.0F && WrapperStruct0.var_1_14 <= -1.0e-20F) || (WrapperStruct0.var_1_14 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L94] CALL assume_abort_if_not((WrapperStruct0.var_1_14 >= 0.0F && WrapperStruct0.var_1_14 <= -1.0e-20F) || (WrapperStruct0.var_1_14 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L94] RET assume_abort_if_not((WrapperStruct0.var_1_14 >= 0.0F && WrapperStruct0.var_1_14 <= -1.0e-20F) || (WrapperStruct0.var_1_14 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L95] WrapperStruct0.var_1_15 = __VERIFIER_nondet_float() [L96] EXPR WrapperStruct0.var_1_15 [L96] EXPR WrapperStruct0.var_1_15 >= 0.0F && WrapperStruct0.var_1_15 <= -1.0e-20F VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L96] EXPR WrapperStruct0.var_1_15 >= 0.0F && WrapperStruct0.var_1_15 <= -1.0e-20F [L96] EXPR WrapperStruct0.var_1_15 [L96] EXPR WrapperStruct0.var_1_15 >= 0.0F && WrapperStruct0.var_1_15 <= -1.0e-20F VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L96] EXPR (WrapperStruct0.var_1_15 >= 0.0F && WrapperStruct0.var_1_15 <= -1.0e-20F) || (WrapperStruct0.var_1_15 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_15 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L96] EXPR (WrapperStruct0.var_1_15 >= 0.0F && WrapperStruct0.var_1_15 <= -1.0e-20F) || (WrapperStruct0.var_1_15 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_15 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L96] CALL assume_abort_if_not((WrapperStruct0.var_1_15 >= 0.0F && WrapperStruct0.var_1_15 <= -1.0e-20F) || (WrapperStruct0.var_1_15 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_15 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L96] RET assume_abort_if_not((WrapperStruct0.var_1_15 >= 0.0F && WrapperStruct0.var_1_15 <= -1.0e-20F) || (WrapperStruct0.var_1_15 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_15 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L111] RET updateVariables() [L112] CALL step() [L59] COND TRUE (last_1_WrapperStruct0_var_1_13 + ((((last_1_WrapperStruct0_var_1_13) > (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))) < (last_1_WrapperStruct0_var_1_13 * last_1_WrapperStruct0_var_1_13) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L60] COND FALSE !(last_1_WrapperStruct0_var_1_13 < (last_1_WrapperStruct0_var_1_13 - last_1_WrapperStruct0_var_1_13)) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L68] EXPR \read(*WrapperStruct0_var_1_12_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L68] COND TRUE (*(WrapperStruct0_var_1_12_Pointer)) [L69] EXPR \read(*WrapperStruct0_var_1_14_Pointer) [L69] EXPR \read(*WrapperStruct0_var_1_15_Pointer) [L69] EXPR \read(*WrapperStruct0_var_1_8_Pointer) [L69] EXPR \read(*WrapperStruct0_var_1_10_Pointer) [L69] EXPR \read(*WrapperStruct0_var_1_9_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L69] COND FALSE !(((*(WrapperStruct0_var_1_14_Pointer)) - (*(WrapperStruct0_var_1_15_Pointer))) >= (((*(WrapperStruct0_var_1_8_Pointer)) + (*(WrapperStruct0_var_1_10_Pointer))) + (*(WrapperStruct0_var_1_9_Pointer)))) [L72] EXPR \read(*WrapperStruct0_var_1_1_Pointer) [L72] (*(WrapperStruct0_var_1_13_Pointer)) = (*(WrapperStruct0_var_1_1_Pointer)) [L75] EXPR \read(*WrapperStruct0_var_1_8_Pointer) [L75] EXPR \read(*WrapperStruct0_var_1_9_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L75] EXPR (((*(WrapperStruct0_var_1_8_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))) [L75] EXPR \read(*WrapperStruct0_var_1_8_Pointer) [L75] EXPR (((*(WrapperStruct0_var_1_8_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L75] EXPR \read(*WrapperStruct0_var_1_10_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L75] COND TRUE (((((*(WrapperStruct0_var_1_8_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))) <= (*(WrapperStruct0_var_1_10_Pointer)) [L76] last_1_WrapperStruct0_var_1_7 && ((*(WrapperStruct0_var_1_1_Pointer)) >= (*(WrapperStruct0_var_1_1_Pointer))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L76] last_1_WrapperStruct0_var_1_7 && ((*(WrapperStruct0_var_1_1_Pointer)) >= (*(WrapperStruct0_var_1_1_Pointer))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L76] COND FALSE !(last_1_WrapperStruct0_var_1_7 && ((*(WrapperStruct0_var_1_1_Pointer)) >= (*(WrapperStruct0_var_1_1_Pointer)))) [L112] RET step() [L113] CALL, EXPR property() [L103] EXPR ((last_1_WrapperStruct0_var_1_13 + ((((last_1_WrapperStruct0_var_1_13) > (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))) < (last_1_WrapperStruct0_var_1_13 * last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 < (last_1_WrapperStruct0_var_1_13 - last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 != (((((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) < 0 ) ? -((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) : ((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_13)) : 1) : 1) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_13)) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L103] EXPR (last_1_WrapperStruct0_var_1_13 < (last_1_WrapperStruct0_var_1_13 - last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 != (((((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) < 0 ) ? -((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) : ((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_13)) : 1) : 1 [L103] EXPR (last_1_WrapperStruct0_var_1_13 < (last_1_WrapperStruct0_var_1_13 - last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 != (((((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) < 0 ) ? -((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) : ((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_13)) : 1) : 1 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L103] EXPR ((last_1_WrapperStruct0_var_1_13 + ((((last_1_WrapperStruct0_var_1_13) > (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))) < (last_1_WrapperStruct0_var_1_13 * last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 < (last_1_WrapperStruct0_var_1_13 - last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 != (((((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) < 0 ) ? -((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) : ((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_13)) : 1) : 1) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_13)) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L103] EXPR (((last_1_WrapperStruct0_var_1_13 + ((((last_1_WrapperStruct0_var_1_13) > (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))) < (last_1_WrapperStruct0_var_1_13 * last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 < (last_1_WrapperStruct0_var_1_13 - last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 != (((((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) < 0 ) ? -((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) : ((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_13)) : 1) : 1) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_13))) && (((((((*(WrapperStruct0_var_1_8_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))) <= (*(WrapperStruct0_var_1_10_Pointer))) ? ((last_1_WrapperStruct0_var_1_7 && ((*(WrapperStruct0_var_1_1_Pointer)) >= (*(WrapperStruct0_var_1_1_Pointer)))) ? ((*(WrapperStruct0_var_1_7_Pointer)) == ((unsigned char) 0)) : 1) : ((*(WrapperStruct0_var_1_7_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_12_Pointer))))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L103] EXPR (((last_1_WrapperStruct0_var_1_13 + ((((last_1_WrapperStruct0_var_1_13) > (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))) < (last_1_WrapperStruct0_var_1_13 * last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 < (last_1_WrapperStruct0_var_1_13 - last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 != (((((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) < 0 ) ? -((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) : ((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_13)) : 1) : 1) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_13))) && (((((((*(WrapperStruct0_var_1_8_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))) <= (*(WrapperStruct0_var_1_10_Pointer))) ? ((last_1_WrapperStruct0_var_1_7 && ((*(WrapperStruct0_var_1_1_Pointer)) >= (*(WrapperStruct0_var_1_1_Pointer)))) ? ((*(WrapperStruct0_var_1_7_Pointer)) == ((unsigned char) 0)) : 1) : ((*(WrapperStruct0_var_1_7_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_12_Pointer))))) [L103] EXPR \read(*WrapperStruct0_var_1_8_Pointer) [L103] EXPR \read(*WrapperStruct0_var_1_9_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L103] EXPR (((*(WrapperStruct0_var_1_8_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))) [L103] EXPR \read(*WrapperStruct0_var_1_8_Pointer) [L103] EXPR (((*(WrapperStruct0_var_1_8_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L103] EXPR \read(*WrapperStruct0_var_1_10_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L103] EXPR ((((((*(WrapperStruct0_var_1_8_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))) <= (*(WrapperStruct0_var_1_10_Pointer))) ? ((last_1_WrapperStruct0_var_1_7 && ((*(WrapperStruct0_var_1_1_Pointer)) >= (*(WrapperStruct0_var_1_1_Pointer)))) ? ((*(WrapperStruct0_var_1_7_Pointer)) == ((unsigned char) 0)) : 1) : ((*(WrapperStruct0_var_1_7_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_12_Pointer)))) [L103] EXPR \read(*WrapperStruct0_var_1_7_Pointer) [L103] EXPR \read(*WrapperStruct0_var_1_12_Pointer) [L103] EXPR ((((((*(WrapperStruct0_var_1_8_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))) <= (*(WrapperStruct0_var_1_10_Pointer))) ? ((last_1_WrapperStruct0_var_1_7 && ((*(WrapperStruct0_var_1_1_Pointer)) >= (*(WrapperStruct0_var_1_1_Pointer)))) ? ((*(WrapperStruct0_var_1_7_Pointer)) == ((unsigned char) 0)) : 1) : ((*(WrapperStruct0_var_1_7_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_12_Pointer)))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L103] EXPR (((last_1_WrapperStruct0_var_1_13 + ((((last_1_WrapperStruct0_var_1_13) > (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))) < (last_1_WrapperStruct0_var_1_13 * last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 < (last_1_WrapperStruct0_var_1_13 - last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 != (((((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) < 0 ) ? -((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) : ((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_13)) : 1) : 1) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_13))) && (((((((*(WrapperStruct0_var_1_8_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))) <= (*(WrapperStruct0_var_1_10_Pointer))) ? ((last_1_WrapperStruct0_var_1_7 && ((*(WrapperStruct0_var_1_1_Pointer)) >= (*(WrapperStruct0_var_1_1_Pointer)))) ? ((*(WrapperStruct0_var_1_7_Pointer)) == ((unsigned char) 0)) : 1) : ((*(WrapperStruct0_var_1_7_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_12_Pointer))))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L103] EXPR ((((last_1_WrapperStruct0_var_1_13 + ((((last_1_WrapperStruct0_var_1_13) > (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))) < (last_1_WrapperStruct0_var_1_13 * last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 < (last_1_WrapperStruct0_var_1_13 - last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 != (((((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) < 0 ) ? -((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) : ((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_13)) : 1) : 1) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_13))) && (((((((*(WrapperStruct0_var_1_8_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))) <= (*(WrapperStruct0_var_1_10_Pointer))) ? ((last_1_WrapperStruct0_var_1_7 && ((*(WrapperStruct0_var_1_1_Pointer)) >= (*(WrapperStruct0_var_1_1_Pointer)))) ? ((*(WrapperStruct0_var_1_7_Pointer)) == ((unsigned char) 0)) : 1) : ((*(WrapperStruct0_var_1_7_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_12_Pointer)))))) && ((*(WrapperStruct0_var_1_12_Pointer)) ? ((((*(WrapperStruct0_var_1_14_Pointer)) - (*(WrapperStruct0_var_1_15_Pointer))) >= (((*(WrapperStruct0_var_1_8_Pointer)) + (*(WrapperStruct0_var_1_10_Pointer))) + (*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_13_Pointer)) == ((signed short int) (((((*(WrapperStruct0_var_1_1_Pointer))) > ((*(WrapperStruct0_var_1_1_Pointer)))) ? ((*(WrapperStruct0_var_1_1_Pointer))) : ((*(WrapperStruct0_var_1_1_Pointer))))))) : ((*(WrapperStruct0_var_1_13_Pointer)) == ((signed short int) (*(WrapperStruct0_var_1_1_Pointer))))) : 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L103] EXPR ((((last_1_WrapperStruct0_var_1_13 + ((((last_1_WrapperStruct0_var_1_13) > (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))) < (last_1_WrapperStruct0_var_1_13 * last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 < (last_1_WrapperStruct0_var_1_13 - last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 != (((((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) < 0 ) ? -((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) : ((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_13)) : 1) : 1) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_13))) && (((((((*(WrapperStruct0_var_1_8_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))) <= (*(WrapperStruct0_var_1_10_Pointer))) ? ((last_1_WrapperStruct0_var_1_7 && ((*(WrapperStruct0_var_1_1_Pointer)) >= (*(WrapperStruct0_var_1_1_Pointer)))) ? ((*(WrapperStruct0_var_1_7_Pointer)) == ((unsigned char) 0)) : 1) : ((*(WrapperStruct0_var_1_7_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_12_Pointer)))))) && ((*(WrapperStruct0_var_1_12_Pointer)) ? ((((*(WrapperStruct0_var_1_14_Pointer)) - (*(WrapperStruct0_var_1_15_Pointer))) >= (((*(WrapperStruct0_var_1_8_Pointer)) + (*(WrapperStruct0_var_1_10_Pointer))) + (*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_13_Pointer)) == ((signed short int) (((((*(WrapperStruct0_var_1_1_Pointer))) > ((*(WrapperStruct0_var_1_1_Pointer)))) ? ((*(WrapperStruct0_var_1_1_Pointer))) : ((*(WrapperStruct0_var_1_1_Pointer))))))) : ((*(WrapperStruct0_var_1_13_Pointer)) == ((signed short int) (*(WrapperStruct0_var_1_1_Pointer))))) : 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L103-L104] return ((((last_1_WrapperStruct0_var_1_13 + ((((last_1_WrapperStruct0_var_1_13) > (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))) < (last_1_WrapperStruct0_var_1_13 * last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 < (last_1_WrapperStruct0_var_1_13 - last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 != (((((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) < 0 ) ? -((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) : ((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_13)) : 1) : 1) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_13))) && (((((((*(WrapperStruct0_var_1_8_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))) <= (*(WrapperStruct0_var_1_10_Pointer))) ? ((last_1_WrapperStruct0_var_1_7 && ((*(WrapperStruct0_var_1_1_Pointer)) >= (*(WrapperStruct0_var_1_1_Pointer)))) ? ((*(WrapperStruct0_var_1_7_Pointer)) == ((unsigned char) 0)) : 1) : ((*(WrapperStruct0_var_1_7_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_12_Pointer)))))) && ((*(WrapperStruct0_var_1_12_Pointer)) ? ((((*(WrapperStruct0_var_1_14_Pointer)) - (*(WrapperStruct0_var_1_15_Pointer))) >= (((*(WrapperStruct0_var_1_8_Pointer)) + (*(WrapperStruct0_var_1_10_Pointer))) + (*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_13_Pointer)) == ((signed short int) (((((*(WrapperStruct0_var_1_1_Pointer))) > ((*(WrapperStruct0_var_1_1_Pointer)))) ? ((*(WrapperStruct0_var_1_1_Pointer))) : ((*(WrapperStruct0_var_1_1_Pointer))))))) : ((*(WrapperStruct0_var_1_13_Pointer)) == ((signed short int) (*(WrapperStruct0_var_1_1_Pointer))))) : 1) ; [L113] RET, EXPR property() [L113] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L19] reach_error() VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 96 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.3s, OverallIterations: 11, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1263 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1259 mSDsluCounter, 6315 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5054 mSDsCounter, 106 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2233 IncrementalHoareTripleChecker+Invalid, 2339 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 106 mSolverCounterUnsat, 1261 mSDtfsCounter, 2233 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 250 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=514occurred in iteration=10, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 276 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 1046 NumberOfCodeBlocks, 1046 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 856 ConstructedInterpolants, 0 QuantifiedInterpolants, 3965 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 840/840 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-31 22:02:44,415 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d622f2d3-11b5-4214-a4d6-990654b555be/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d622f2d3-11b5-4214-a4d6-990654b555be/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d622f2d3-11b5-4214-a4d6-990654b555be/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d622f2d3-11b5-4214-a4d6-990654b555be/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d622f2d3-11b5-4214-a4d6-990654b555be/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-21.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d622f2d3-11b5-4214-a4d6-990654b555be/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d622f2d3-11b5-4214-a4d6-990654b555be/bin/uautomizer-verify-4GaUIPS5ZU --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 abb22874cc515e6597c493938d8a3907b8ef4cc1e14b264963b72f5eff3fe5c3 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:02:47,429 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:02:47,546 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d622f2d3-11b5-4214-a4d6-990654b555be/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-31 22:02:47,554 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:02:47,555 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:02:47,597 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:02:47,599 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:02:47,600 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:02:47,601 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:02:47,602 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:02:47,603 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:02:47,603 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:02:47,604 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:02:47,604 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:02:47,606 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:02:47,607 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:02:47,607 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:02:47,608 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:02:47,608 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:02:47,608 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:02:47,609 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:02:47,613 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:02:47,613 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:02:47,613 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-31 22:02:47,614 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-31 22:02:47,614 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:02:47,614 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-31 22:02:47,614 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:02:47,615 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:02:47,615 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:02:47,615 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:02:47,615 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:02:47,616 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:02:47,618 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:02:47,618 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:02:47,619 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:02:47,619 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:02:47,619 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:02:47,620 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-31 22:02:47,620 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-31 22:02:47,620 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:02:47,622 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:02:47,622 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:02:47,622 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:02:47,623 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-31 22:02:47,623 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d622f2d3-11b5-4214-a4d6-990654b555be/bin/uautomizer-verify-4GaUIPS5ZU/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d622f2d3-11b5-4214-a4d6-990654b555be/bin/uautomizer-verify-4GaUIPS5ZU 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 -> abb22874cc515e6597c493938d8a3907b8ef4cc1e14b264963b72f5eff3fe5c3 [2024-10-31 22:02:48,010 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:02:48,032 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:02:48,039 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:02:48,040 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:02:48,040 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:02:48,043 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d622f2d3-11b5-4214-a4d6-990654b555be/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-21.i Unable to find full path for "g++" [2024-10-31 22:02:50,531 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:02:50,811 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:02:50,815 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d622f2d3-11b5-4214-a4d6-990654b555be/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-21.i [2024-10-31 22:02:50,828 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d622f2d3-11b5-4214-a4d6-990654b555be/bin/uautomizer-verify-4GaUIPS5ZU/data/d8af090ac/1c1ac74784f04383978e443ec1db07c8/FLAGbc4130e7b [2024-10-31 22:02:50,844 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d622f2d3-11b5-4214-a4d6-990654b555be/bin/uautomizer-verify-4GaUIPS5ZU/data/d8af090ac/1c1ac74784f04383978e443ec1db07c8 [2024-10-31 22:02:50,846 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:02:50,848 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:02:50,849 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:02:50,850 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:02:50,856 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:02:50,857 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:02:50" (1/1) ... [2024-10-31 22:02:50,861 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b37859e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:50, skipping insertion in model container [2024-10-31 22:02:50,861 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:02:50" (1/1) ... [2024-10-31 22:02:50,899 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:02:51,167 WARN L251 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_d622f2d3-11b5-4214-a4d6-990654b555be/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-21.i[917,930] [2024-10-31 22:02:51,255 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:02:51,288 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:02:51,319 WARN L251 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_d622f2d3-11b5-4214-a4d6-990654b555be/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-21.i[917,930] [2024-10-31 22:02:51,416 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:02:51,453 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:02:51,454 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:51 WrapperNode [2024-10-31 22:02:51,454 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:02:51,455 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:02:51,456 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:02:51,456 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:02:51,466 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:51" (1/1) ... [2024-10-31 22:02:51,495 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:51" (1/1) ... [2024-10-31 22:02:51,560 INFO L138 Inliner]: procedures = 36, calls = 110, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 404 [2024-10-31 22:02:51,564 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:02:51,565 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:02:51,565 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:02:51,565 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:02:51,581 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:51" (1/1) ... [2024-10-31 22:02:51,581 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:51" (1/1) ... [2024-10-31 22:02:51,592 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:51" (1/1) ... [2024-10-31 22:02:51,626 INFO L175 MemorySlicer]: Split 91 memory accesses to 2 slices as follows [2, 89]. 98 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 9]. The 12 writes are split as follows [0, 12]. [2024-10-31 22:02:51,633 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:51" (1/1) ... [2024-10-31 22:02:51,633 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:51" (1/1) ... [2024-10-31 22:02:51,663 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:51" (1/1) ... [2024-10-31 22:02:51,675 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:51" (1/1) ... [2024-10-31 22:02:51,683 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:51" (1/1) ... [2024-10-31 22:02:51,690 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:51" (1/1) ... [2024-10-31 22:02:51,699 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:02:51,700 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:02:51,700 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:02:51,701 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:02:51,702 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:51" (1/1) ... [2024-10-31 22:02:51,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:02:51,731 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d622f2d3-11b5-4214-a4d6-990654b555be/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:02:51,747 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d622f2d3-11b5-4214-a4d6-990654b555be/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:02:51,754 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d622f2d3-11b5-4214-a4d6-990654b555be/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:02:51,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:02:51,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-10-31 22:02:51,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-10-31 22:02:51,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-31 22:02:51,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-31 22:02:51,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-31 22:02:51,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-31 22:02:51,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-31 22:02:51,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-31 22:02:51,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-31 22:02:51,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-31 22:02:51,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-31 22:02:51,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-31 22:02:51,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-10-31 22:02:51,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-10-31 22:02:51,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-31 22:02:51,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-31 22:02:51,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-31 22:02:51,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-31 22:02:51,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-31 22:02:51,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-31 22:02:51,791 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-31 22:02:51,791 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-31 22:02:51,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:02:51,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:02:51,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-31 22:02:51,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-31 22:02:51,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-31 22:02:51,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-31 22:02:51,977 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:02:51,979 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation