./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-54.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_be0d7152-36f3-49d9-8c4c-ff3a856075fb/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be0d7152-36f3-49d9-8c4c-ff3a856075fb/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_be0d7152-36f3-49d9-8c4c-ff3a856075fb/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be0d7152-36f3-49d9-8c4c-ff3a856075fb/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-54.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be0d7152-36f3-49d9-8c4c-ff3a856075fb/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_be0d7152-36f3-49d9-8c4c-ff3a856075fb/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 a4adac79d6cea52ff1f2363c41bfef3a91ebf33bfb8642b8f2d3700c04ed5429 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:00:03,637 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:00:03,736 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be0d7152-36f3-49d9-8c4c-ff3a856075fb/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-31 22:00:03,744 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:00:03,745 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:00:03,773 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:00:03,774 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:00:03,774 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:00:03,775 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:00:03,775 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:00:03,776 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:00:03,776 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:00:03,777 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:00:03,778 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:00:03,778 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:00:03,779 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:00:03,779 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:00:03,780 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:00:03,780 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:00:03,780 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:00:03,781 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:00:03,782 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:00:03,782 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:00:03,782 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:00:03,783 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:00:03,783 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:00:03,783 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:00:03,784 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:00:03,784 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:00:03,785 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:00:03,785 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:00:03,785 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:00:03,786 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:00:03,786 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:00:03,787 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:00:03,787 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:00:03,787 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:00:03,788 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 22:00:03,788 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:00:03,789 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:00:03,789 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:00:03,790 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:00:03,790 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_be0d7152-36f3-49d9-8c4c-ff3a856075fb/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_be0d7152-36f3-49d9-8c4c-ff3a856075fb/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 -> a4adac79d6cea52ff1f2363c41bfef3a91ebf33bfb8642b8f2d3700c04ed5429 [2024-10-31 22:00:04,094 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:00:04,125 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:00:04,129 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:00:04,130 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:00:04,131 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:00:04,132 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be0d7152-36f3-49d9-8c4c-ff3a856075fb/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-54.i Unable to find full path for "g++" [2024-10-31 22:00:06,246 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:00:06,536 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:00:06,540 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be0d7152-36f3-49d9-8c4c-ff3a856075fb/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-54.i [2024-10-31 22:00:06,552 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be0d7152-36f3-49d9-8c4c-ff3a856075fb/bin/uautomizer-verify-4GaUIPS5ZU/data/292f38101/7d66328193ec45ef80b024867b6470cc/FLAGf436d58ee [2024-10-31 22:00:06,575 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be0d7152-36f3-49d9-8c4c-ff3a856075fb/bin/uautomizer-verify-4GaUIPS5ZU/data/292f38101/7d66328193ec45ef80b024867b6470cc [2024-10-31 22:00:06,578 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:00:06,580 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:00:06,581 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:00:06,582 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:00:06,587 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:00:06,590 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:00:06" (1/1) ... [2024-10-31 22:00:06,591 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79caa29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:06, skipping insertion in model container [2024-10-31 22:00:06,591 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:00:06" (1/1) ... [2024-10-31 22:00:06,626 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:00:06,851 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_be0d7152-36f3-49d9-8c4c-ff3a856075fb/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-54.i[917,930] [2024-10-31 22:00:06,912 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:00:06,925 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:00:06,937 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_be0d7152-36f3-49d9-8c4c-ff3a856075fb/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-54.i[917,930] [2024-10-31 22:00:06,973 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:00:06,999 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:00:06,999 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:06 WrapperNode [2024-10-31 22:00:06,999 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:00:07,000 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:00:07,001 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:00:07,001 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:00:07,012 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:00:06" (1/1) ... [2024-10-31 22:00:07,034 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:00:06" (1/1) ... [2024-10-31 22:00:07,094 INFO L138 Inliner]: procedures = 30, calls = 139, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 476 [2024-10-31 22:00:07,094 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:00:07,095 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:00:07,095 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:00:07,095 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:00:07,107 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:06" (1/1) ... [2024-10-31 22:00:07,107 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:06" (1/1) ... [2024-10-31 22:00:07,113 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:06" (1/1) ... [2024-10-31 22:00:07,120 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-10-31 22:00:07,124 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:06" (1/1) ... [2024-10-31 22:00:07,124 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:06" (1/1) ... [2024-10-31 22:00:07,141 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:06" (1/1) ... [2024-10-31 22:00:07,148 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:06" (1/1) ... [2024-10-31 22:00:07,156 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:06" (1/1) ... [2024-10-31 22:00:07,161 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:06" (1/1) ... [2024-10-31 22:00:07,171 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:00:07,173 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:00:07,176 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:00:07,176 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:00:07,177 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:06" (1/1) ... [2024-10-31 22:00:07,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:00:07,198 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be0d7152-36f3-49d9-8c4c-ff3a856075fb/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:00:07,215 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be0d7152-36f3-49d9-8c4c-ff3a856075fb/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:00:07,223 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be0d7152-36f3-49d9-8c4c-ff3a856075fb/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:00:07,253 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:00:07,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-10-31 22:00:07,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-10-31 22:00:07,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-31 22:00:07,256 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-10-31 22:00:07,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-10-31 22:00:07,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-31 22:00:07,257 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-31 22:00:07,260 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-31 22:00:07,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-31 22:00:07,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:00:07,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:00:07,407 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:00:07,414 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:00:08,107 INFO L? ?]: Removed 120 outVars from TransFormulas that were not future-live. [2024-10-31 22:00:08,108 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:00:08,135 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:00:08,135 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 22:00:08,137 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:00:08 BoogieIcfgContainer [2024-10-31 22:00:08,138 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:00:08,142 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:00:08,142 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:00:08,147 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:00:08,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:00:06" (1/3) ... [2024-10-31 22:00:08,149 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b178173 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:00:08, skipping insertion in model container [2024-10-31 22:00:08,150 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:06" (2/3) ... [2024-10-31 22:00:08,151 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b178173 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:00:08, skipping insertion in model container [2024-10-31 22:00:08,151 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:00:08" (3/3) ... [2024-10-31 22:00:08,153 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-54.i [2024-10-31 22:00:08,174 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:00:08,174 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-31 22:00:08,259 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:00:08,269 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;@307a6fa3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:00:08,270 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-31 22:00:08,275 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 95 states have (on average 1.4526315789473685) internal successors, (138), 96 states have internal predecessors, (138), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-31 22:00:08,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-31 22:00:08,292 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:00:08,293 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:00:08,294 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:00:08,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:00:08,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1606318882, now seen corresponding path program 1 times [2024-10-31 22:00:08,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:00:08,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824237601] [2024-10-31 22:00:08,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:00:08,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:00:08,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:08,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:00:08,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:08,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:00:08,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:08,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:00:08,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:08,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:00:08,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:08,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:00:08,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:08,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:00:08,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:08,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:00:08,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:08,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:00:08,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:08,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:00:08,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:08,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:00:08,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:08,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:00:08,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:08,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:00:08,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:08,933 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-31 22:00:08,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:00:08,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824237601] [2024-10-31 22:00:08,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824237601] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:00:08,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:00:08,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:00:08,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088216997] [2024-10-31 22:00:08,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:00:08,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-31 22:00:08,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:00:08,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-31 22:00:08,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 22:00:08,982 INFO L87 Difference]: Start difference. First operand has 110 states, 95 states have (on average 1.4526315789473685) internal successors, (138), 96 states have internal predecessors, (138), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-31 22:00:09,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:00:09,028 INFO L93 Difference]: Finished difference Result 213 states and 330 transitions. [2024-10-31 22:00:09,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-31 22:00:09,032 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 105 [2024-10-31 22:00:09,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:00:09,044 INFO L225 Difference]: With dead ends: 213 [2024-10-31 22:00:09,044 INFO L226 Difference]: Without dead ends: 106 [2024-10-31 22:00:09,050 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 22:00:09,055 INFO L432 NwaCegarLoop]: 155 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, 155 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:00:09,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:00:09,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-31 22:00:09,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-10-31 22:00:09,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 92 states have (on average 1.423913043478261) internal successors, (131), 92 states have internal predecessors, (131), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-31 22:00:09,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 155 transitions. [2024-10-31 22:00:09,167 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 155 transitions. Word has length 105 [2024-10-31 22:00:09,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:00:09,173 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 155 transitions. [2024-10-31 22:00:09,174 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-31 22:00:09,174 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 155 transitions. [2024-10-31 22:00:09,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-31 22:00:09,182 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:00:09,182 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:00:09,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 22:00:09,183 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:00:09,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:00:09,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1914200370, now seen corresponding path program 1 times [2024-10-31 22:00:09,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:00:09,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723606782] [2024-10-31 22:00:09,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:00:09,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:00:09,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:09,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:00:09,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:09,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:00:09,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:09,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:00:09,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:09,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:00:09,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:09,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:00:09,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:09,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:00:09,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:09,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:00:09,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:09,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:00:09,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:09,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:00:09,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:09,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:00:09,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:09,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:00:09,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:09,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:00:09,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:09,869 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-31 22:00:09,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:00:09,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723606782] [2024-10-31 22:00:09,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723606782] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:00:09,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:00:09,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:00:09,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799209552] [2024-10-31 22:00:09,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:00:09,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:00:09,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:00:09,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:00:09,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:00:09,874 INFO L87 Difference]: Start difference. First operand 106 states and 155 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 22:00:09,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:00:09,932 INFO L93 Difference]: Finished difference Result 211 states and 310 transitions. [2024-10-31 22:00:09,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:00:09,933 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 105 [2024-10-31 22:00:09,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:00:09,935 INFO L225 Difference]: With dead ends: 211 [2024-10-31 22:00:09,935 INFO L226 Difference]: Without dead ends: 108 [2024-10-31 22:00:09,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:00:09,937 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:00:09,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 448 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:00:09,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-31 22:00:09,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-10-31 22:00:09,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 94 states have (on average 1.4148936170212767) internal successors, (133), 94 states have internal predecessors, (133), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-31 22:00:09,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 157 transitions. [2024-10-31 22:00:09,953 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 157 transitions. Word has length 105 [2024-10-31 22:00:09,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:00:09,955 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 157 transitions. [2024-10-31 22:00:09,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 22:00:09,956 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 157 transitions. [2024-10-31 22:00:09,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-31 22:00:09,958 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:00:09,958 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:00:09,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 22:00:09,958 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:00:09,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:00:09,961 INFO L85 PathProgramCache]: Analyzing trace with hash -314773303, now seen corresponding path program 1 times [2024-10-31 22:00:09,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:00:09,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069649616] [2024-10-31 22:00:09,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:00:09,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:00:10,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:10,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:00:10,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:10,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:00:10,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:10,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:00:10,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:10,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:00:10,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:10,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:00:10,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:10,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:00:10,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:10,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:00:10,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:10,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:00:10,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:10,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:00:10,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:10,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:00:10,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:10,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:00:10,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:10,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:00:10,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:10,329 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-31 22:00:10,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:00:10,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069649616] [2024-10-31 22:00:10,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069649616] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:00:10,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:00:10,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:00:10,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855802582] [2024-10-31 22:00:10,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:00:10,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:00:10,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:00:10,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:00:10,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:00:10,340 INFO L87 Difference]: Start difference. First operand 108 states and 157 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 22:00:10,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:00:10,438 INFO L93 Difference]: Finished difference Result 216 states and 315 transitions. [2024-10-31 22:00:10,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:00:10,439 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 107 [2024-10-31 22:00:10,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:00:10,441 INFO L225 Difference]: With dead ends: 216 [2024-10-31 22:00:10,441 INFO L226 Difference]: Without dead ends: 111 [2024-10-31 22:00:10,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:00:10,443 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:00:10,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 445 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:00:10,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-31 22:00:10,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2024-10-31 22:00:10,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 96 states have (on average 1.40625) internal successors, (135), 96 states have internal predecessors, (135), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-31 22:00:10,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 159 transitions. [2024-10-31 22:00:10,455 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 159 transitions. Word has length 107 [2024-10-31 22:00:10,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:00:10,456 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 159 transitions. [2024-10-31 22:00:10,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 22:00:10,456 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 159 transitions. [2024-10-31 22:00:10,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-31 22:00:10,472 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:00:10,472 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:00:10,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 22:00:10,473 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:00:10,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:00:10,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1460234059, now seen corresponding path program 1 times [2024-10-31 22:00:10,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:00:10,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742059268] [2024-10-31 22:00:10,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:00:10,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:00:10,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:10,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:00:10,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:10,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:00:10,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:10,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:00:10,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:10,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:00:10,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:10,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:00:10,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:10,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:00:10,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:10,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:00:10,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:10,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:00:10,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:10,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:00:10,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:10,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:00:10,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:10,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:00:10,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:10,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:00:10,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:10,735 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-31 22:00:10,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:00:10,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742059268] [2024-10-31 22:00:10,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742059268] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:00:10,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:00:10,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:00:10,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331997394] [2024-10-31 22:00:10,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:00:10,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:00:10,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:00:10,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:00:10,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:00:10,739 INFO L87 Difference]: Start difference. First operand 110 states and 159 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 22:00:10,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:00:10,767 INFO L93 Difference]: Finished difference Result 220 states and 319 transitions. [2024-10-31 22:00:10,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:00:10,768 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 107 [2024-10-31 22:00:10,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:00:10,770 INFO L225 Difference]: With dead ends: 220 [2024-10-31 22:00:10,770 INFO L226 Difference]: Without dead ends: 113 [2024-10-31 22:00:10,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:00:10,772 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:00:10,773 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 448 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:00:10,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-31 22:00:10,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2024-10-31 22:00:10,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 98 states have (on average 1.3979591836734695) internal successors, (137), 98 states have internal predecessors, (137), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-31 22:00:10,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 161 transitions. [2024-10-31 22:00:10,782 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 161 transitions. Word has length 107 [2024-10-31 22:00:10,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:00:10,783 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 161 transitions. [2024-10-31 22:00:10,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 22:00:10,784 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 161 transitions. [2024-10-31 22:00:10,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-31 22:00:10,786 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:00:10,786 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:00:10,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 22:00:10,787 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:00:10,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:00:10,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1462081101, now seen corresponding path program 1 times [2024-10-31 22:00:10,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:00:10,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147729105] [2024-10-31 22:00:10,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:00:10,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:00:10,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:11,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:00:11,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:11,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:00:11,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:11,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:00:11,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:11,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:00:11,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:11,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:00:11,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:11,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:00:11,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:11,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:00:11,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:11,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:00:11,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:11,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:00:11,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:11,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:00:11,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:11,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:00:11,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:11,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:00:11,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:11,553 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-31 22:00:11,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:00:11,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147729105] [2024-10-31 22:00:11,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147729105] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:00:11,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:00:11,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-31 22:00:11,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207786519] [2024-10-31 22:00:11,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:00:11,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-31 22:00:11,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:00:11,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-31 22:00:11,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:00:11,556 INFO L87 Difference]: Start difference. First operand 112 states and 161 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 22:00:11,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:00:11,980 INFO L93 Difference]: Finished difference Result 284 states and 410 transitions. [2024-10-31 22:00:11,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:00:11,981 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 107 [2024-10-31 22:00:11,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:00:11,983 INFO L225 Difference]: With dead ends: 284 [2024-10-31 22:00:11,983 INFO L226 Difference]: Without dead ends: 175 [2024-10-31 22:00:11,984 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:00:11,985 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 349 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-31 22:00:11,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 408 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-31 22:00:11,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-10-31 22:00:11,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 127. [2024-10-31 22:00:11,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 113 states have (on average 1.424778761061947) internal successors, (161), 113 states have internal predecessors, (161), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-31 22:00:11,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 185 transitions. [2024-10-31 22:00:11,999 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 185 transitions. Word has length 107 [2024-10-31 22:00:11,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:00:11,999 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 185 transitions. [2024-10-31 22:00:12,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 22:00:12,000 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 185 transitions. [2024-10-31 22:00:12,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-31 22:00:12,002 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:00:12,002 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:00:12,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 22:00:12,003 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:00:12,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:00:12,003 INFO L85 PathProgramCache]: Analyzing trace with hash 544621908, now seen corresponding path program 1 times [2024-10-31 22:00:12,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:00:12,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960577830] [2024-10-31 22:00:12,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:00:12,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:00:12,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:14,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:00:14,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:14,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:00:14,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:14,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:00:14,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:14,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:00:14,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:14,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:00:14,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:14,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:00:14,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:14,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:00:14,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:14,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:00:14,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:14,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:00:14,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:14,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:00:14,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:14,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:00:14,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:14,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:00:14,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:14,312 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-31 22:00:14,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:00:14,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960577830] [2024-10-31 22:00:14,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960577830] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:00:14,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:00:14,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-31 22:00:14,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845407205] [2024-10-31 22:00:14,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:00:14,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-31 22:00:14,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:00:14,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-31 22:00:14,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:00:14,320 INFO L87 Difference]: Start difference. First operand 127 states and 185 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-31 22:00:14,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:00:14,722 INFO L93 Difference]: Finished difference Result 314 states and 461 transitions. [2024-10-31 22:00:14,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:00:14,723 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 108 [2024-10-31 22:00:14,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:00:14,725 INFO L225 Difference]: With dead ends: 314 [2024-10-31 22:00:14,725 INFO L226 Difference]: Without dead ends: 190 [2024-10-31 22:00:14,726 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:00:14,727 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 100 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 22:00:14,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 539 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 22:00:14,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-10-31 22:00:14,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 175. [2024-10-31 22:00:14,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 148 states have (on average 1.3918918918918919) internal successors, (206), 148 states have internal predecessors, (206), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-31 22:00:14,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 254 transitions. [2024-10-31 22:00:14,777 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 254 transitions. Word has length 108 [2024-10-31 22:00:14,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:00:14,778 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 254 transitions. [2024-10-31 22:00:14,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-31 22:00:14,779 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 254 transitions. [2024-10-31 22:00:14,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-31 22:00:14,780 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:00:14,781 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:00:14,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 22:00:14,781 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:00:14,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:00:14,782 INFO L85 PathProgramCache]: Analyzing trace with hash -273026542, now seen corresponding path program 1 times [2024-10-31 22:00:14,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:00:14,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744933849] [2024-10-31 22:00:14,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:00:14,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:00:14,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:17,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:00:17,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:17,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:00:17,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:17,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:00:17,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:17,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:00:17,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:17,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:00:17,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:17,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:00:17,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:17,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:00:17,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:17,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:00:17,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:17,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:00:17,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:17,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:00:17,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:17,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:00:17,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:17,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:00:17,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:17,212 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-31 22:00:17,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:00:17,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744933849] [2024-10-31 22:00:17,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744933849] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:00:17,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:00:17,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-31 22:00:17,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845845112] [2024-10-31 22:00:17,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:00:17,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-31 22:00:17,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:00:17,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-31 22:00:17,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-31 22:00:17,215 INFO L87 Difference]: Start difference. First operand 175 states and 254 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-31 22:00:17,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:00:17,839 INFO L93 Difference]: Finished difference Result 404 states and 587 transitions. [2024-10-31 22:00:17,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:00:17,840 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 108 [2024-10-31 22:00:17,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:00:17,842 INFO L225 Difference]: With dead ends: 404 [2024-10-31 22:00:17,842 INFO L226 Difference]: Without dead ends: 280 [2024-10-31 22:00:17,843 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2024-10-31 22:00:17,847 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 291 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-31 22:00:17,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 485 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-31 22:00:17,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2024-10-31 22:00:17,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 222. [2024-10-31 22:00:17,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 195 states have (on average 1.4) internal successors, (273), 195 states have internal predecessors, (273), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-31 22:00:17,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 321 transitions. [2024-10-31 22:00:17,885 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 321 transitions. Word has length 108 [2024-10-31 22:00:17,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:00:17,886 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 321 transitions. [2024-10-31 22:00:17,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-31 22:00:17,887 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 321 transitions. [2024-10-31 22:00:17,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-31 22:00:17,890 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:00:17,890 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:00:17,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 22:00:17,891 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:00:17,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:00:17,891 INFO L85 PathProgramCache]: Analyzing trace with hash -859832556, now seen corresponding path program 1 times [2024-10-31 22:00:17,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:00:17,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409127209] [2024-10-31 22:00:17,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:00:17,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:00:18,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:18,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:00:18,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:18,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:00:18,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:18,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:00:18,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:18,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:00:18,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:18,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:00:18,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:18,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:00:18,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:18,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:00:18,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:18,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:00:18,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:18,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:00:18,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:18,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:00:18,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:18,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:00:18,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:18,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:00:18,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:18,620 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-31 22:00:18,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:00:18,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409127209] [2024-10-31 22:00:18,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409127209] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:00:18,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:00:18,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-31 22:00:18,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305350220] [2024-10-31 22:00:18,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:00:18,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-31 22:00:18,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:00:18,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-31 22:00:18,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:00:18,623 INFO L87 Difference]: Start difference. First operand 222 states and 321 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 22:00:18,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:00:18,983 INFO L93 Difference]: Finished difference Result 539 states and 772 transitions. [2024-10-31 22:00:18,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-31 22:00:18,984 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 108 [2024-10-31 22:00:18,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:00:18,986 INFO L225 Difference]: With dead ends: 539 [2024-10-31 22:00:18,986 INFO L226 Difference]: Without dead ends: 320 [2024-10-31 22:00:18,988 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-31 22:00:18,989 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 232 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 22:00:18,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 599 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 22:00:18,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-10-31 22:00:19,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 246. [2024-10-31 22:00:19,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 219 states have (on average 1.3835616438356164) internal successors, (303), 219 states have internal predecessors, (303), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-31 22:00:19,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 351 transitions. [2024-10-31 22:00:19,019 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 351 transitions. Word has length 108 [2024-10-31 22:00:19,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:00:19,020 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 351 transitions. [2024-10-31 22:00:19,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 22:00:19,020 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 351 transitions. [2024-10-31 22:00:19,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-31 22:00:19,022 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:00:19,022 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:00:19,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-31 22:00:19,022 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:00:19,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:00:19,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1112397672, now seen corresponding path program 1 times [2024-10-31 22:00:19,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:00:19,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861188328] [2024-10-31 22:00:19,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:00:19,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:00:19,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:20,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:00:20,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:20,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:00:20,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:20,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:00:20,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:20,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:00:20,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:20,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:00:20,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:20,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:00:20,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:20,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:00:20,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:20,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:00:20,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:20,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:00:20,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:20,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:00:20,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:20,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:00:20,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:20,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:00:20,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:20,455 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-31 22:00:20,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:00:20,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861188328] [2024-10-31 22:00:20,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861188328] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:00:20,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:00:20,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-31 22:00:20,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875117771] [2024-10-31 22:00:20,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:00:20,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-31 22:00:20,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:00:20,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-31 22:00:20,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-10-31 22:00:20,459 INFO L87 Difference]: Start difference. First operand 246 states and 351 transitions. Second operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 22:00:21,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:00:21,567 INFO L93 Difference]: Finished difference Result 472 states and 677 transitions. [2024-10-31 22:00:21,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-31 22:00:21,568 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 109 [2024-10-31 22:00:21,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:00:21,570 INFO L225 Difference]: With dead ends: 472 [2024-10-31 22:00:21,570 INFO L226 Difference]: Without dead ends: 333 [2024-10-31 22:00:21,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2024-10-31 22:00:21,572 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 201 mSDsluCounter, 1158 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 1335 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-31 22:00:21,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 1335 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 660 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-31 22:00:21,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2024-10-31 22:00:21,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 268. [2024-10-31 22:00:21,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 241 states have (on average 1.4024896265560165) internal successors, (338), 241 states have internal predecessors, (338), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-31 22:00:21,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 386 transitions. [2024-10-31 22:00:21,595 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 386 transitions. Word has length 109 [2024-10-31 22:00:21,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:00:21,596 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 386 transitions. [2024-10-31 22:00:21,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 22:00:21,596 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 386 transitions. [2024-10-31 22:00:21,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-31 22:00:21,598 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:00:21,598 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:00:21,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-31 22:00:21,599 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:00:21,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:00:21,599 INFO L85 PathProgramCache]: Analyzing trace with hash 101280422, now seen corresponding path program 1 times [2024-10-31 22:00:21,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:00:21,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239338017] [2024-10-31 22:00:21,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:00:21,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:00:21,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:22,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:00:22,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:22,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:00:22,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:22,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:00:22,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:22,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:00:22,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:22,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:00:22,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:22,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:00:22,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:22,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:00:22,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:22,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:00:22,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:22,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:00:22,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:22,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:00:22,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:22,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:00:22,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:22,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:00:22,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:22,303 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-31 22:00:22,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:00:22,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239338017] [2024-10-31 22:00:22,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239338017] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:00:22,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:00:22,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-31 22:00:22,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539276523] [2024-10-31 22:00:22,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:00:22,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 22:00:22,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:00:22,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 22:00:22,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:00:22,305 INFO L87 Difference]: Start difference. First operand 268 states and 386 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 22:00:22,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:00:22,821 INFO L93 Difference]: Finished difference Result 484 states and 698 transitions. [2024-10-31 22:00:22,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:00:22,822 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 109 [2024-10-31 22:00:22,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:00:22,824 INFO L225 Difference]: With dead ends: 484 [2024-10-31 22:00:22,824 INFO L226 Difference]: Without dead ends: 323 [2024-10-31 22:00:22,825 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-31 22:00:22,826 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 275 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-31 22:00:22,826 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 598 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-31 22:00:22,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2024-10-31 22:00:22,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 268. [2024-10-31 22:00:22,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 241 states have (on average 1.3941908713692945) internal successors, (336), 241 states have internal predecessors, (336), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-31 22:00:22,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 384 transitions. [2024-10-31 22:00:22,860 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 384 transitions. Word has length 109 [2024-10-31 22:00:22,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:00:22,860 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 384 transitions. [2024-10-31 22:00:22,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 22:00:22,861 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 384 transitions. [2024-10-31 22:00:22,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-31 22:00:22,863 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:00:22,863 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:00:22,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-31 22:00:22,864 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:00:22,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:00:22,865 INFO L85 PathProgramCache]: Analyzing trace with hash 978384166, now seen corresponding path program 1 times [2024-10-31 22:00:22,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:00:22,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550160461] [2024-10-31 22:00:22,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:00:22,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:00:22,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:25,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:00:25,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:25,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:00:25,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:25,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:00:25,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:25,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:00:25,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:25,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:00:25,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:25,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:00:25,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:25,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:00:25,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:25,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:00:25,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:25,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:00:25,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:25,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:00:25,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:25,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:00:25,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:25,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:00:25,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:25,216 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-31 22:00:25,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:00:25,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550160461] [2024-10-31 22:00:25,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550160461] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:00:25,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:00:25,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-31 22:00:25,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983884614] [2024-10-31 22:00:25,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:00:25,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-31 22:00:25,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:00:25,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-31 22:00:25,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-10-31 22:00:25,220 INFO L87 Difference]: Start difference. First operand 268 states and 384 transitions. Second operand has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 12 states have internal predecessors, (52), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-31 22:00:26,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:00:26,274 INFO L93 Difference]: Finished difference Result 507 states and 729 transitions. [2024-10-31 22:00:26,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-31 22:00:26,275 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 12 states have internal predecessors, (52), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 109 [2024-10-31 22:00:26,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:00:26,279 INFO L225 Difference]: With dead ends: 507 [2024-10-31 22:00:26,279 INFO L226 Difference]: Without dead ends: 346 [2024-10-31 22:00:26,280 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-31 22:00:26,281 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 546 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-31 22:00:26,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 672 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-31 22:00:26,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2024-10-31 22:00:26,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 283. [2024-10-31 22:00:26,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 256 states have (on average 1.40234375) internal successors, (359), 256 states have internal predecessors, (359), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-31 22:00:26,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 407 transitions. [2024-10-31 22:00:26,314 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 407 transitions. Word has length 109 [2024-10-31 22:00:26,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:00:26,315 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 407 transitions. [2024-10-31 22:00:26,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 12 states have internal predecessors, (52), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-31 22:00:26,315 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 407 transitions. [2024-10-31 22:00:26,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-31 22:00:26,317 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:00:26,317 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:00:26,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-31 22:00:26,318 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:00:26,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:00:26,318 INFO L85 PathProgramCache]: Analyzing trace with hash -32733084, now seen corresponding path program 1 times [2024-10-31 22:00:26,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:00:26,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107558860] [2024-10-31 22:00:26,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:00:26,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:00:26,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:26,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:00:26,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:26,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:00:26,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:26,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:00:26,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:26,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:00:26,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:26,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:00:26,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:26,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:00:26,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:26,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:00:26,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:26,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:00:26,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:26,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:00:26,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:26,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:00:26,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:26,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:00:26,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:26,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:00:26,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:26,913 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-31 22:00:26,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:00:26,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107558860] [2024-10-31 22:00:26,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107558860] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:00:26,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:00:26,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-31 22:00:26,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983901219] [2024-10-31 22:00:26,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:00:26,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-31 22:00:26,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:00:26,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-31 22:00:26,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-31 22:00:26,915 INFO L87 Difference]: Start difference. First operand 283 states and 407 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 22:00:27,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:00:27,620 INFO L93 Difference]: Finished difference Result 524 states and 752 transitions. [2024-10-31 22:00:27,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-31 22:00:27,620 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 109 [2024-10-31 22:00:27,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:00:27,622 INFO L225 Difference]: With dead ends: 524 [2024-10-31 22:00:27,623 INFO L226 Difference]: Without dead ends: 348 [2024-10-31 22:00:27,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2024-10-31 22:00:27,624 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 196 mSDsluCounter, 899 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 1095 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-31 22:00:27,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 1095 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-31 22:00:27,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2024-10-31 22:00:27,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 283. [2024-10-31 22:00:27,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 256 states have (on average 1.40234375) internal successors, (359), 256 states have internal predecessors, (359), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-31 22:00:27,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 407 transitions. [2024-10-31 22:00:27,653 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 407 transitions. Word has length 109 [2024-10-31 22:00:27,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:00:27,654 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 407 transitions. [2024-10-31 22:00:27,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 22:00:27,655 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 407 transitions. [2024-10-31 22:00:27,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-31 22:00:27,656 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:00:27,656 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:00:27,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-31 22:00:27,656 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:00:27,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:00:27,657 INFO L85 PathProgramCache]: Analyzing trace with hash -846099282, now seen corresponding path program 1 times [2024-10-31 22:00:27,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:00:27,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134257178] [2024-10-31 22:00:27,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:00:27,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:00:27,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:28,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:00:28,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:28,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:00:28,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:28,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:00:28,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:28,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:00:28,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:28,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:00:28,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:28,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:00:28,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:28,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:00:28,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:28,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:00:28,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:28,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:00:28,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:28,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:00:28,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:28,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:00:28,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:28,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:00:28,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:28,535 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-31 22:00:28,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:00:28,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134257178] [2024-10-31 22:00:28,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134257178] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:00:28,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:00:28,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-31 22:00:28,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822163726] [2024-10-31 22:00:28,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:00:28,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-31 22:00:28,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:00:28,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-31 22:00:28,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-31 22:00:28,540 INFO L87 Difference]: Start difference. First operand 283 states and 407 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-31 22:00:29,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:00:29,389 INFO L93 Difference]: Finished difference Result 620 states and 894 transitions. [2024-10-31 22:00:29,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-31 22:00:29,390 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 109 [2024-10-31 22:00:29,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:00:29,392 INFO L225 Difference]: With dead ends: 620 [2024-10-31 22:00:29,392 INFO L226 Difference]: Without dead ends: 444 [2024-10-31 22:00:29,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2024-10-31 22:00:29,395 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 256 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-31 22:00:29,395 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 622 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-31 22:00:29,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2024-10-31 22:00:29,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 279. [2024-10-31 22:00:29,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 252 states have (on average 1.3928571428571428) internal successors, (351), 252 states have internal predecessors, (351), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-31 22:00:29,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 399 transitions. [2024-10-31 22:00:29,431 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 399 transitions. Word has length 109 [2024-10-31 22:00:29,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:00:29,434 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 399 transitions. [2024-10-31 22:00:29,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-31 22:00:29,435 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 399 transitions. [2024-10-31 22:00:29,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-31 22:00:29,437 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:00:29,438 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:00:29,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-31 22:00:29,438 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:00:29,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:00:29,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1438926694, now seen corresponding path program 1 times [2024-10-31 22:00:29,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:00:29,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678801463] [2024-10-31 22:00:29,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:00:29,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:00:29,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:30,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:00:30,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:30,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:00:30,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:30,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:00:30,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:30,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:00:30,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:30,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:00:30,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:30,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:00:30,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:30,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:00:30,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:30,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:00:30,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:30,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:00:30,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:30,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:00:30,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:30,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:00:30,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:30,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:00:30,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:30,276 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-31 22:00:30,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:00:30,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678801463] [2024-10-31 22:00:30,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678801463] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:00:30,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:00:30,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-31 22:00:30,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789044922] [2024-10-31 22:00:30,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:00:30,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-31 22:00:30,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:00:30,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-31 22:00:30,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-31 22:00:30,278 INFO L87 Difference]: Start difference. First operand 279 states and 399 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-31 22:00:30,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:00:30,978 INFO L93 Difference]: Finished difference Result 359 states and 508 transitions. [2024-10-31 22:00:30,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-31 22:00:30,979 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 110 [2024-10-31 22:00:30,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:00:30,981 INFO L225 Difference]: With dead ends: 359 [2024-10-31 22:00:30,981 INFO L226 Difference]: Without dead ends: 357 [2024-10-31 22:00:30,981 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2024-10-31 22:00:30,982 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 549 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-31 22:00:30,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 574 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-31 22:00:30,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2024-10-31 22:00:31,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 337. [2024-10-31 22:00:31,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 310 states have (on average 1.4) internal successors, (434), 310 states have internal predecessors, (434), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-31 22:00:31,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 482 transitions. [2024-10-31 22:00:31,017 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 482 transitions. Word has length 110 [2024-10-31 22:00:31,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:00:31,019 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 482 transitions. [2024-10-31 22:00:31,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-31 22:00:31,019 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 482 transitions. [2024-10-31 22:00:31,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-31 22:00:31,021 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:00:31,021 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:00:31,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-31 22:00:31,021 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:00:31,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:00:31,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1440773736, now seen corresponding path program 1 times [2024-10-31 22:00:31,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:00:31,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415020413] [2024-10-31 22:00:31,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:00:31,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:00:31,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:00:31,155 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:00:31,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:00:31,325 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:00:31,326 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-31 22:00:31,328 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-31 22:00:31,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-31 22:00:31,333 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:00:31,482 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-10-31 22:00:31,489 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.10 10:00:31 BoogieIcfgContainer [2024-10-31 22:00:31,489 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-31 22:00:31,489 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-31 22:00:31,489 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-31 22:00:31,489 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-31 22:00:31,490 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:00:08" (3/4) ... [2024-10-31 22:00:31,493 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-10-31 22:00:31,494 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-31 22:00:31,495 INFO L158 Benchmark]: Toolchain (without parser) took 24915.38ms. Allocated memory was 182.5MB in the beginning and 469.8MB in the end (delta: 287.3MB). Free memory was 153.8MB in the beginning and 288.3MB in the end (delta: -134.5MB). Peak memory consumption was 154.9MB. Max. memory is 16.1GB. [2024-10-31 22:00:31,495 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 117.4MB. Free memory is still 74.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:00:31,495 INFO L158 Benchmark]: CACSL2BoogieTranslator took 418.33ms. Allocated memory is still 182.5MB. Free memory was 153.1MB in the beginning and 136.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-31 22:00:31,496 INFO L158 Benchmark]: Boogie Procedure Inliner took 93.84ms. Allocated memory is still 182.5MB. Free memory was 136.3MB in the beginning and 132.9MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-31 22:00:31,497 INFO L158 Benchmark]: Boogie Preprocessor took 77.04ms. Allocated memory is still 182.5MB. Free memory was 132.9MB in the beginning and 129.3MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-31 22:00:31,497 INFO L158 Benchmark]: RCFGBuilder took 965.34ms. Allocated memory is still 182.5MB. Free memory was 129.3MB in the beginning and 94.4MB in the end (delta: 34.9MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-10-31 22:00:31,498 INFO L158 Benchmark]: TraceAbstraction took 23346.59ms. Allocated memory was 182.5MB in the beginning and 469.8MB in the end (delta: 287.3MB). Free memory was 93.7MB in the beginning and 289.4MB in the end (delta: -195.7MB). Peak memory consumption was 94.1MB. Max. memory is 16.1GB. [2024-10-31 22:00:31,498 INFO L158 Benchmark]: Witness Printer took 5.13ms. Allocated memory is still 469.8MB. Free memory was 289.4MB in the beginning and 288.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:00:31,499 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.22ms. Allocated memory is still 117.4MB. Free memory is still 74.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 418.33ms. Allocated memory is still 182.5MB. Free memory was 153.1MB in the beginning and 136.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 93.84ms. Allocated memory is still 182.5MB. Free memory was 136.3MB in the beginning and 132.9MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.04ms. Allocated memory is still 182.5MB. Free memory was 132.9MB in the beginning and 129.3MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 965.34ms. Allocated memory is still 182.5MB. Free memory was 129.3MB in the beginning and 94.4MB in the end (delta: 34.9MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 23346.59ms. Allocated memory was 182.5MB in the beginning and 469.8MB in the end (delta: 287.3MB). Free memory was 93.7MB in the beginning and 289.4MB in the end (delta: -195.7MB). Peak memory consumption was 94.1MB. Max. memory is 16.1GB. * Witness Printer took 5.13ms. Allocated memory is still 469.8MB. Free memory was 289.4MB in the beginning and 288.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 113, overapproximation of someBinaryFLOATComparisonOperation at line 121. Possible FailurePath: [L36] unsigned char isInitial = 0; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 16, 10, 0, 1, 0, 0, 9.75, 5.5, 4.1, 9.8, 25, 2 }; [L51] unsigned char* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L52] unsigned char* WrapperStruct00_var_1_3_Pointer = &(WrapperStruct00.var_1_3); [L53] unsigned char* WrapperStruct00_var_1_4_Pointer = &(WrapperStruct00.var_1_4); [L54] unsigned char* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L55] unsigned char* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L56] unsigned char* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L57] double* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L58] double* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L59] double* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L60] float* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L61] signed char* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L62] signed char* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=0] [L125] isInitial = 1 [L126] FCALL initially() [L127] COND TRUE 1 [L128] FCALL updateLastVariables() [L129] CALL updateVariables() [L98] WrapperStruct00.var_1_3 = __VERIFIER_nondet_uchar() [L99] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L100] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L101] WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar() [L102] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L103] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L104] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L105] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L106] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L107] WrapperStruct00.var_1_10 = __VERIFIER_nondet_uchar() [L108] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L109] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L110] WrapperStruct00.var_1_12 = __VERIFIER_nondet_double() [L111] EXPR WrapperStruct00.var_1_12 [L111] EXPR WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F [L111] EXPR WrapperStruct00.var_1_12 [L111] EXPR WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L111] EXPR (WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L111] CALL assume_abort_if_not((WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L111] RET assume_abort_if_not((WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L112] WrapperStruct00.var_1_13 = __VERIFIER_nondet_double() [L113] EXPR WrapperStruct00.var_1_13 [L113] EXPR WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F [L113] EXPR WrapperStruct00.var_1_13 [L113] EXPR WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L113] EXPR (WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L113] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L113] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L114] WrapperStruct00.var_1_16 = __VERIFIER_nondet_char() [L115] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L116] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L116] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L129] RET updateVariables() [L130] CALL step() [L66] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L66] (*(WrapperStruct00_var_1_14_Pointer)) = (*(WrapperStruct00_var_1_12_Pointer)) [L67] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L67] (*(WrapperStruct00_var_1_15_Pointer)) = (*(WrapperStruct00_var_1_16_Pointer)) [L68] signed long int stepLocal_0 = -4; [L69] EXPR \read(*WrapperStruct00_var_1_15_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1, stepLocal_0=-4] [L69] COND FALSE !(stepLocal_0 >= (*(WrapperStruct00_var_1_15_Pointer))) [L72] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L72] unsigned char stepLocal_2 = (*(WrapperStruct00_var_1_3_Pointer)); [L73] EXPR \read(*WrapperStruct00_var_1_9_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1, stepLocal_2=254] [L73] COND FALSE !((*(WrapperStruct00_var_1_9_Pointer))) [L82] EXPR \read(*WrapperStruct00_var_1_1_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1, stepLocal_2=254] [L82] EXPR ((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer))) [L82] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L82] EXPR ((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1, stepLocal_2=254] [L82] signed long int stepLocal_1 = (((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer)))); [L83] EXPR \read(*WrapperStruct00_var_1_1_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1, stepLocal_1=16, stepLocal_2=254] [L83] COND FALSE !((8 * (*(WrapperStruct00_var_1_1_Pointer))) == stepLocal_1) [L94] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L94] (*(WrapperStruct00_var_1_4_Pointer)) = (*(WrapperStruct00_var_1_10_Pointer)) [L130] RET step() [L131] CALL, EXPR property() [L121] EXPR \read(*WrapperStruct00_var_1_15_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L121] EXPR (-4 >= (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L121] EXPR ((-4 >= (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(WrapperStruct00_var_1_1_Pointer))) == ((((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_11_Pointer)) < (*(WrapperStruct00_var_1_14_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_14_Pointer)) >= (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer))))) [L121] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L121] EXPR \read(*WrapperStruct00_var_1_1_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L121] EXPR ((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer))) [L121] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L121] EXPR ((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L121] EXPR ((8 * (*(WrapperStruct00_var_1_1_Pointer))) == ((((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_11_Pointer)) < (*(WrapperStruct00_var_1_14_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_14_Pointer)) >= (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer)))) [L121] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L121] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L121] EXPR ((8 * (*(WrapperStruct00_var_1_1_Pointer))) == ((((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_11_Pointer)) < (*(WrapperStruct00_var_1_14_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_14_Pointer)) >= (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L121] EXPR ((-4 >= (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(WrapperStruct00_var_1_1_Pointer))) == ((((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_11_Pointer)) < (*(WrapperStruct00_var_1_14_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_14_Pointer)) >= (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L121] EXPR (((-4 >= (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(WrapperStruct00_var_1_1_Pointer))) == ((((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_11_Pointer)) < (*(WrapperStruct00_var_1_14_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_14_Pointer)) >= (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer)))))) && ((*(WrapperStruct00_var_1_9_Pointer)) ? (((*(WrapperStruct00_var_1_3_Pointer)) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (((((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) : ((*(WrapperStruct00_var_1_13_Pointer))))))) : ((*(WrapperStruct00_var_1_10_Pointer)) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_12_Pointer)))) : 1)) : 1) [L121] EXPR \read(*WrapperStruct00_var_1_9_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L121] EXPR (*(WrapperStruct00_var_1_9_Pointer)) ? (((*(WrapperStruct00_var_1_3_Pointer)) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (((((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) : ((*(WrapperStruct00_var_1_13_Pointer))))))) : ((*(WrapperStruct00_var_1_10_Pointer)) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_12_Pointer)))) : 1)) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L121] EXPR (((-4 >= (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(WrapperStruct00_var_1_1_Pointer))) == ((((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_11_Pointer)) < (*(WrapperStruct00_var_1_14_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_14_Pointer)) >= (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer)))))) && ((*(WrapperStruct00_var_1_9_Pointer)) ? (((*(WrapperStruct00_var_1_3_Pointer)) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (((((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) : ((*(WrapperStruct00_var_1_13_Pointer))))))) : ((*(WrapperStruct00_var_1_10_Pointer)) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_12_Pointer)))) : 1)) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L121] EXPR ((((-4 >= (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(WrapperStruct00_var_1_1_Pointer))) == ((((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_11_Pointer)) < (*(WrapperStruct00_var_1_14_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_14_Pointer)) >= (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer)))))) && ((*(WrapperStruct00_var_1_9_Pointer)) ? (((*(WrapperStruct00_var_1_3_Pointer)) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (((((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) : ((*(WrapperStruct00_var_1_13_Pointer))))))) : ((*(WrapperStruct00_var_1_10_Pointer)) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_12_Pointer)))) : 1)) : 1)) && ((*(WrapperStruct00_var_1_14_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer)))) [L121] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L121] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L121] EXPR ((((-4 >= (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(WrapperStruct00_var_1_1_Pointer))) == ((((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_11_Pointer)) < (*(WrapperStruct00_var_1_14_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_14_Pointer)) >= (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer)))))) && ((*(WrapperStruct00_var_1_9_Pointer)) ? (((*(WrapperStruct00_var_1_3_Pointer)) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (((((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) : ((*(WrapperStruct00_var_1_13_Pointer))))))) : ((*(WrapperStruct00_var_1_10_Pointer)) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_12_Pointer)))) : 1)) : 1)) && ((*(WrapperStruct00_var_1_14_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L121] EXPR (((((-4 >= (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(WrapperStruct00_var_1_1_Pointer))) == ((((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_11_Pointer)) < (*(WrapperStruct00_var_1_14_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_14_Pointer)) >= (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer)))))) && ((*(WrapperStruct00_var_1_9_Pointer)) ? (((*(WrapperStruct00_var_1_3_Pointer)) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (((((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) : ((*(WrapperStruct00_var_1_13_Pointer))))))) : ((*(WrapperStruct00_var_1_10_Pointer)) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_12_Pointer)))) : 1)) : 1)) && ((*(WrapperStruct00_var_1_14_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer))))) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_16_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L121-L122] return (((((-4 >= (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(WrapperStruct00_var_1_1_Pointer))) == ((((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_11_Pointer)) < (*(WrapperStruct00_var_1_14_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_14_Pointer)) >= (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer)))))) && ((*(WrapperStruct00_var_1_9_Pointer)) ? (((*(WrapperStruct00_var_1_3_Pointer)) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (((((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) : ((*(WrapperStruct00_var_1_13_Pointer))))))) : ((*(WrapperStruct00_var_1_10_Pointer)) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_12_Pointer)))) : 1)) : 1)) && ((*(WrapperStruct00_var_1_14_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer))))) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_16_Pointer)))) ; [L131] RET, EXPR property() [L131] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 110 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.1s, OverallIterations: 15, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2998 SdHoareTripleChecker+Valid, 5.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2997 mSDsluCounter, 8423 SdHoareTripleChecker+Invalid, 4.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6374 mSDsCounter, 154 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3783 IncrementalHoareTripleChecker+Invalid, 3937 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 154 mSolverCounterUnsat, 2049 mSDtfsCounter, 3783 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 498 GetRequests, 387 SyntacticMatches, 1 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=337occurred in iteration=14, InterpolantAutomatonStates: 87, 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, 14 MinimizatonAttempts, 630 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 13.4s InterpolantComputationTime, 1620 NumberOfCodeBlocks, 1620 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1496 ConstructedInterpolants, 0 QuantifiedInterpolants, 9851 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 3696/3696 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:00:31,544 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be0d7152-36f3-49d9-8c4c-ff3a856075fb/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...