./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-24.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd8d38f-d69e-457c-b00b-46395482ef64/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd8d38f-d69e-457c-b00b-46395482ef64/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd8d38f-d69e-457c-b00b-46395482ef64/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd8d38f-d69e-457c-b00b-46395482ef64/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-24.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd8d38f-d69e-457c-b00b-46395482ef64/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd8d38f-d69e-457c-b00b-46395482ef64/bin/uautomizer-verify-uCwYo4JHxu --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 0aa4dd51c4cd5f506c8ea883675989f435890e74667457bb82ef32d99c08b8b8 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:09:27,361 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:09:27,500 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd8d38f-d69e-457c-b00b-46395482ef64/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-19 07:09:27,514 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:09:27,515 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:09:27,558 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:09:27,559 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:09:27,560 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:09:27,561 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:09:27,562 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:09:27,563 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:09:27,564 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:09:27,565 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:09:27,565 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:09:27,566 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:09:27,567 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:09:27,568 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:09:27,569 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:09:27,569 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:09:27,570 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:09:27,571 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:09:27,572 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:09:27,572 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:09:27,573 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:09:27,573 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:09:27,574 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:09:27,575 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:09:27,575 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:09:27,576 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:09:27,577 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:09:27,577 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:09:27,578 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:09:27,578 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:09:27,579 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:09:27,579 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:09:27,579 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:09:27,580 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:09:27,580 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:09:27,580 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:09:27,581 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_0dd8d38f-d69e-457c-b00b-46395482ef64/bin/uautomizer-verify-uCwYo4JHxu/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_0dd8d38f-d69e-457c-b00b-46395482ef64/bin/uautomizer-verify-uCwYo4JHxu 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 -> 0aa4dd51c4cd5f506c8ea883675989f435890e74667457bb82ef32d99c08b8b8 [2023-11-19 07:09:27,908 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:09:27,938 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:09:27,941 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:09:27,943 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:09:27,943 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:09:27,945 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd8d38f-d69e-457c-b00b-46395482ef64/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-24.i [2023-11-19 07:09:31,041 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:09:31,367 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:09:31,368 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd8d38f-d69e-457c-b00b-46395482ef64/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-24.i [2023-11-19 07:09:31,385 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd8d38f-d69e-457c-b00b-46395482ef64/bin/uautomizer-verify-uCwYo4JHxu/data/6d307a6df/6a3fd4fbd49b4f2aa0f7482716465377/FLAGbf023982c [2023-11-19 07:09:31,409 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd8d38f-d69e-457c-b00b-46395482ef64/bin/uautomizer-verify-uCwYo4JHxu/data/6d307a6df/6a3fd4fbd49b4f2aa0f7482716465377 [2023-11-19 07:09:31,417 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:09:31,419 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:09:31,428 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:09:31,429 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:09:31,435 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:09:31,436 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:09:31" (1/1) ... [2023-11-19 07:09:31,437 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57cbb972 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:31, skipping insertion in model container [2023-11-19 07:09:31,438 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:09:31" (1/1) ... [2023-11-19 07:09:31,489 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:09:31,683 WARN L240 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_0dd8d38f-d69e-457c-b00b-46395482ef64/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-24.i[916,929] [2023-11-19 07:09:31,745 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:09:31,760 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:09:31,775 WARN L240 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_0dd8d38f-d69e-457c-b00b-46395482ef64/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-24.i[916,929] [2023-11-19 07:09:31,826 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:09:31,857 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:09:31,859 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:31 WrapperNode [2023-11-19 07:09:31,860 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:09:31,862 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:09:31,862 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:09:31,862 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:09:31,871 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:31" (1/1) ... [2023-11-19 07:09:31,906 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:31" (1/1) ... [2023-11-19 07:09:31,962 INFO L138 Inliner]: procedures = 29, calls = 166, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 438 [2023-11-19 07:09:31,963 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:09:31,963 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:09:31,964 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:09:31,964 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:09:31,975 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:31" (1/1) ... [2023-11-19 07:09:31,975 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:31" (1/1) ... [2023-11-19 07:09:31,981 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:31" (1/1) ... [2023-11-19 07:09:31,982 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:31" (1/1) ... [2023-11-19 07:09:32,000 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:31" (1/1) ... [2023-11-19 07:09:32,006 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:31" (1/1) ... [2023-11-19 07:09:32,010 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:31" (1/1) ... [2023-11-19 07:09:32,014 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:31" (1/1) ... [2023-11-19 07:09:32,021 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:09:32,022 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:09:32,023 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:09:32,023 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:09:32,024 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:31" (1/1) ... [2023-11-19 07:09:32,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:09:32,047 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd8d38f-d69e-457c-b00b-46395482ef64/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:09:32,066 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd8d38f-d69e-457c-b00b-46395482ef64/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:09:32,077 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd8d38f-d69e-457c-b00b-46395482ef64/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:09:32,102 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:09:32,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2023-11-19 07:09:32,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 07:09:32,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2023-11-19 07:09:32,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 07:09:32,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2023-11-19 07:09:32,103 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-19 07:09:32,104 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-19 07:09:32,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:09:32,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:09:32,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:09:32,248 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:09:32,251 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:09:32,944 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:09:32,954 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:09:32,954 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-19 07:09:32,959 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:09:32 BoogieIcfgContainer [2023-11-19 07:09:32,959 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:09:32,967 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:09:32,967 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:09:32,971 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:09:32,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:09:31" (1/3) ... [2023-11-19 07:09:32,973 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cc3c172 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:09:32, skipping insertion in model container [2023-11-19 07:09:32,974 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:31" (2/3) ... [2023-11-19 07:09:32,975 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cc3c172 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:09:32, skipping insertion in model container [2023-11-19 07:09:32,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:09:32" (3/3) ... [2023-11-19 07:09:32,977 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-24.i [2023-11-19 07:09:32,995 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:09:32,995 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 07:09:33,051 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:09:33,057 INFO L357 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, mHoare=true, 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;@a586fe0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:09:33,058 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-19 07:09:33,063 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 83 states have (on average 1.3975903614457832) internal successors, (116), 84 states have internal predecessors, (116), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-19 07:09:33,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-19 07:09:33,091 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:09:33,094 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:09:33,095 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:09:33,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:09:33,102 INFO L85 PathProgramCache]: Analyzing trace with hash 341014851, now seen corresponding path program 1 times [2023-11-19 07:09:33,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:09:33,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401597612] [2023-11-19 07:09:33,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:09:33,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:09:33,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:33,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:09:33,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:33,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:09:33,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:33,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:09:33,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:33,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:09:33,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:33,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:09:33,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:33,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:09:33,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:33,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:09:33,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:33,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:09:33,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:33,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-19 07:09:33,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:33,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:09:33,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:33,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:09:33,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:33,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:09:33,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:33,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:09:33,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:33,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:09:33,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:33,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:09:33,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:33,636 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-19 07:09:33,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:09:33,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401597612] [2023-11-19 07:09:33,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401597612] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:09:33,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:09:33,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:09:33,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769382586] [2023-11-19 07:09:33,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:09:33,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 07:09:33,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:09:33,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 07:09:33,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 07:09:33,709 INFO L87 Difference]: Start difference. First operand has 101 states, 83 states have (on average 1.3975903614457832) internal successors, (116), 84 states have internal predecessors, (116), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-19 07:09:33,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:09:33,744 INFO L93 Difference]: Finished difference Result 195 states and 301 transitions. [2023-11-19 07:09:33,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 07:09:33,746 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 124 [2023-11-19 07:09:33,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:09:33,759 INFO L225 Difference]: With dead ends: 195 [2023-11-19 07:09:33,759 INFO L226 Difference]: Without dead ends: 97 [2023-11-19 07:09:33,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 07:09:33,772 INFO L413 NwaCegarLoop]: 139 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, 139 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 [2023-11-19 07:09:33,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:09:33,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-11-19 07:09:33,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2023-11-19 07:09:33,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 80 states have (on average 1.3625) internal successors, (109), 80 states have internal predecessors, (109), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-19 07:09:33,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 139 transitions. [2023-11-19 07:09:33,860 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 139 transitions. Word has length 124 [2023-11-19 07:09:33,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:09:33,860 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 139 transitions. [2023-11-19 07:09:33,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-19 07:09:33,861 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 139 transitions. [2023-11-19 07:09:33,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-19 07:09:33,865 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:09:33,865 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:09:33,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:09:33,866 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:09:33,867 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:09:33,867 INFO L85 PathProgramCache]: Analyzing trace with hash -984360163, now seen corresponding path program 1 times [2023-11-19 07:09:33,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:09:33,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500144681] [2023-11-19 07:09:33,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:09:33,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:09:34,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:34,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:09:34,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:34,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:09:34,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:34,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:09:34,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:34,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:09:34,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:34,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:09:34,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:34,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:09:34,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:34,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:09:34,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:34,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:09:34,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:34,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-19 07:09:34,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:34,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:09:34,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:34,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:09:34,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:34,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:09:34,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:34,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:09:34,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:34,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:09:34,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:34,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:09:34,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:34,394 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-19 07:09:34,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:09:34,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500144681] [2023-11-19 07:09:34,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500144681] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:09:34,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:09:34,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:09:34,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555200691] [2023-11-19 07:09:34,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:09:34,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:09:34,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:09:34,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:09:34,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:09:34,400 INFO L87 Difference]: Start difference. First operand 97 states and 139 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-19 07:09:34,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:09:34,482 INFO L93 Difference]: Finished difference Result 197 states and 284 transitions. [2023-11-19 07:09:34,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:09:34,488 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 124 [2023-11-19 07:09:34,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:09:34,494 INFO L225 Difference]: With dead ends: 197 [2023-11-19 07:09:34,495 INFO L226 Difference]: Without dead ends: 103 [2023-11-19 07:09:34,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:09:34,501 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 10 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:09:34,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 402 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:09:34,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-11-19 07:09:34,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2023-11-19 07:09:34,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 82 states have (on average 1.353658536585366) internal successors, (111), 82 states have internal predecessors, (111), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-19 07:09:34,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 141 transitions. [2023-11-19 07:09:34,533 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 141 transitions. Word has length 124 [2023-11-19 07:09:34,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:09:34,535 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 141 transitions. [2023-11-19 07:09:34,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-19 07:09:34,535 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 141 transitions. [2023-11-19 07:09:34,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-19 07:09:34,538 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:09:34,539 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:09:34,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:09:34,539 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:09:34,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:09:34,540 INFO L85 PathProgramCache]: Analyzing trace with hash -140354661, now seen corresponding path program 1 times [2023-11-19 07:09:34,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:09:34,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930572067] [2023-11-19 07:09:34,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:09:34,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:09:34,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:34,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:09:34,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:34,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:09:34,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:34,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:09:34,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:34,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:09:34,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:34,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:09:34,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:34,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:09:34,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:34,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:09:34,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:34,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:09:34,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:34,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-19 07:09:34,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:34,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:09:34,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:34,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:09:34,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:34,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:09:34,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:34,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:09:34,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:34,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:09:34,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:34,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:09:34,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:34,739 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-19 07:09:34,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:09:34,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930572067] [2023-11-19 07:09:34,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930572067] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:09:34,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:09:34,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:09:34,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911112156] [2023-11-19 07:09:34,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:09:34,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:09:34,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:09:34,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:09:34,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:09:34,744 INFO L87 Difference]: Start difference. First operand 99 states and 141 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:09:34,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:09:34,777 INFO L93 Difference]: Finished difference Result 196 states and 281 transitions. [2023-11-19 07:09:34,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:09:34,778 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2023-11-19 07:09:34,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:09:34,780 INFO L225 Difference]: With dead ends: 196 [2023-11-19 07:09:34,780 INFO L226 Difference]: Without dead ends: 100 [2023-11-19 07:09:34,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:09:34,783 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:09:34,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 270 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:09:34,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-11-19 07:09:34,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2023-11-19 07:09:34,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 83 states have (on average 1.3493975903614457) internal successors, (112), 83 states have internal predecessors, (112), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-19 07:09:34,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 142 transitions. [2023-11-19 07:09:34,797 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 142 transitions. Word has length 124 [2023-11-19 07:09:34,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:09:34,798 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 142 transitions. [2023-11-19 07:09:34,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:09:34,798 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 142 transitions. [2023-11-19 07:09:34,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-19 07:09:34,801 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:09:34,802 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:09:34,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:09:34,802 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:09:34,803 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:09:34,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1945792995, now seen corresponding path program 1 times [2023-11-19 07:09:34,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:09:34,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133735457] [2023-11-19 07:09:34,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:09:34,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:09:34,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:35,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:09:35,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:35,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:09:35,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:35,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:09:35,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:35,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:09:35,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:35,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:09:35,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:35,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:09:35,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:35,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:09:35,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:35,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:09:35,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:35,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-19 07:09:35,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:35,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:09:35,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:35,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:09:35,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:35,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:09:35,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:35,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:09:35,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:35,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:09:35,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:35,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:09:35,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:35,112 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-19 07:09:35,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:09:35,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133735457] [2023-11-19 07:09:35,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133735457] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:09:35,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:09:35,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:09:35,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533433899] [2023-11-19 07:09:35,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:09:35,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:09:35,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:09:35,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:09:35,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:09:35,117 INFO L87 Difference]: Start difference. First operand 100 states and 142 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:09:35,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:09:35,161 INFO L93 Difference]: Finished difference Result 217 states and 311 transitions. [2023-11-19 07:09:35,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:09:35,162 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2023-11-19 07:09:35,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:09:35,166 INFO L225 Difference]: With dead ends: 217 [2023-11-19 07:09:35,166 INFO L226 Difference]: Without dead ends: 120 [2023-11-19 07:09:35,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:09:35,178 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 40 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:09:35,180 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 286 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:09:35,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-11-19 07:09:35,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 101. [2023-11-19 07:09:35,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 84 states have (on average 1.3452380952380953) internal successors, (113), 84 states have internal predecessors, (113), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-19 07:09:35,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 143 transitions. [2023-11-19 07:09:35,200 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 143 transitions. Word has length 124 [2023-11-19 07:09:35,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:09:35,202 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 143 transitions. [2023-11-19 07:09:35,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:09:35,203 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 143 transitions. [2023-11-19 07:09:35,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-19 07:09:35,214 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:09:35,214 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:09:35,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:09:35,214 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:09:35,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:09:35,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1328105947, now seen corresponding path program 1 times [2023-11-19 07:09:35,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:09:35,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576956818] [2023-11-19 07:09:35,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:09:35,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:09:35,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:35,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:09:35,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:35,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:09:35,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:35,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:09:35,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:35,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:09:35,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:35,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:09:35,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:35,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:09:35,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:35,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:09:35,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:35,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:09:35,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:35,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-19 07:09:35,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:35,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:09:35,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:35,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:09:35,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:35,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:09:35,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:35,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:09:35,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:35,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:09:35,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:35,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:09:35,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:35,540 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-19 07:09:35,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:09:35,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576956818] [2023-11-19 07:09:35,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576956818] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:09:35,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:09:35,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:09:35,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134316986] [2023-11-19 07:09:35,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:09:35,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:09:35,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:09:35,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:09:35,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:09:35,544 INFO L87 Difference]: Start difference. First operand 101 states and 143 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:09:35,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:09:35,590 INFO L93 Difference]: Finished difference Result 211 states and 300 transitions. [2023-11-19 07:09:35,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:09:35,591 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2023-11-19 07:09:35,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:09:35,593 INFO L225 Difference]: With dead ends: 211 [2023-11-19 07:09:35,593 INFO L226 Difference]: Without dead ends: 113 [2023-11-19 07:09:35,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:09:35,597 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 21 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:09:35,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 404 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:09:35,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-11-19 07:09:35,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 103. [2023-11-19 07:09:35,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 86 states have (on average 1.3372093023255813) internal successors, (115), 86 states have internal predecessors, (115), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-19 07:09:35,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 145 transitions. [2023-11-19 07:09:35,620 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 145 transitions. Word has length 124 [2023-11-19 07:09:35,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:09:35,622 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 145 transitions. [2023-11-19 07:09:35,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:09:35,622 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 145 transitions. [2023-11-19 07:09:35,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-19 07:09:35,624 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:09:35,624 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:09:35,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 07:09:35,625 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:09:35,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:09:35,630 INFO L85 PathProgramCache]: Analyzing trace with hash 2008164317, now seen corresponding path program 1 times [2023-11-19 07:09:35,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:09:35,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448107095] [2023-11-19 07:09:35,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:09:35,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:09:35,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:35,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:09:35,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:35,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:09:35,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:35,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:09:35,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:35,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:09:35,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:35,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:09:35,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:35,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:09:35,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:35,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:09:35,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:35,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:09:35,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:35,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-19 07:09:35,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:35,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:09:35,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:35,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:09:35,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:35,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:09:35,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:35,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:09:35,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:35,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:09:35,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:35,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:09:35,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:35,883 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-19 07:09:35,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:09:35,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448107095] [2023-11-19 07:09:35,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448107095] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:09:35,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:09:35,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:09:35,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043807433] [2023-11-19 07:09:35,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:09:35,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:09:35,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:09:35,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:09:35,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:09:35,890 INFO L87 Difference]: Start difference. First operand 103 states and 145 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:09:35,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:09:35,935 INFO L93 Difference]: Finished difference Result 211 states and 298 transitions. [2023-11-19 07:09:35,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:09:35,936 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2023-11-19 07:09:35,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:09:35,942 INFO L225 Difference]: With dead ends: 211 [2023-11-19 07:09:35,942 INFO L226 Difference]: Without dead ends: 111 [2023-11-19 07:09:35,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:09:35,946 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 12 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:09:35,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 402 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:09:35,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-11-19 07:09:35,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 105. [2023-11-19 07:09:35,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 88 states have (on average 1.3295454545454546) internal successors, (117), 88 states have internal predecessors, (117), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-19 07:09:35,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 147 transitions. [2023-11-19 07:09:35,969 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 147 transitions. Word has length 124 [2023-11-19 07:09:35,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:09:35,970 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 147 transitions. [2023-11-19 07:09:35,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:09:35,971 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 147 transitions. [2023-11-19 07:09:35,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-19 07:09:35,972 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:09:35,973 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:09:35,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 07:09:35,973 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:09:35,973 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:09:35,974 INFO L85 PathProgramCache]: Analyzing trace with hash -511795617, now seen corresponding path program 1 times [2023-11-19 07:09:35,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:09:35,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373940382] [2023-11-19 07:09:35,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:09:35,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:09:36,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:36,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:09:36,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:36,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:09:36,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:36,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:09:36,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:36,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:09:36,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:36,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:09:36,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:36,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:09:36,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:36,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:09:36,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:36,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:09:36,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:36,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-19 07:09:36,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:36,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:09:36,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:36,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:09:36,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:36,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:09:36,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:36,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:09:36,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:36,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:09:36,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:36,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:09:36,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:36,167 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-19 07:09:36,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:09:36,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373940382] [2023-11-19 07:09:36,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373940382] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:09:36,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:09:36,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:09:36,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308161789] [2023-11-19 07:09:36,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:09:36,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:09:36,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:09:36,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:09:36,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:09:36,170 INFO L87 Difference]: Start difference. First operand 105 states and 147 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:09:36,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:09:36,232 INFO L93 Difference]: Finished difference Result 211 states and 296 transitions. [2023-11-19 07:09:36,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:09:36,233 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2023-11-19 07:09:36,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:09:36,235 INFO L225 Difference]: With dead ends: 211 [2023-11-19 07:09:36,235 INFO L226 Difference]: Without dead ends: 109 [2023-11-19 07:09:36,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:09:36,236 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 3 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:09:36,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 401 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:09:36,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-11-19 07:09:36,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2023-11-19 07:09:36,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 90 states have (on average 1.3222222222222222) internal successors, (119), 90 states have internal predecessors, (119), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-19 07:09:36,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 149 transitions. [2023-11-19 07:09:36,244 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 149 transitions. Word has length 124 [2023-11-19 07:09:36,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:09:36,245 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 149 transitions. [2023-11-19 07:09:36,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:09:36,245 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 149 transitions. [2023-11-19 07:09:36,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-19 07:09:36,247 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:09:36,247 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:09:36,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 07:09:36,248 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:09:36,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:09:36,248 INFO L85 PathProgramCache]: Analyzing trace with hash -509948575, now seen corresponding path program 1 times [2023-11-19 07:09:36,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:09:36,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055948954] [2023-11-19 07:09:36,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:09:36,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:09:36,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:36,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:09:36,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:36,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:09:36,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:36,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:09:36,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:36,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:09:36,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:36,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:09:36,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:36,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:09:36,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:36,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:09:36,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:36,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:09:36,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:36,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-19 07:09:36,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:36,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:09:36,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:36,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:09:36,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:36,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:09:36,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:36,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:09:36,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:36,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:09:36,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:36,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:09:36,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:36,821 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-19 07:09:36,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:09:36,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055948954] [2023-11-19 07:09:36,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055948954] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:09:36,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:09:36,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:09:36,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493630756] [2023-11-19 07:09:36,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:09:36,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:09:36,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:09:36,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:09:36,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:09:36,824 INFO L87 Difference]: Start difference. First operand 107 states and 149 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:09:37,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:09:37,187 INFO L93 Difference]: Finished difference Result 286 states and 397 transitions. [2023-11-19 07:09:37,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 07:09:37,188 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2023-11-19 07:09:37,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:09:37,190 INFO L225 Difference]: With dead ends: 286 [2023-11-19 07:09:37,190 INFO L226 Difference]: Without dead ends: 182 [2023-11-19 07:09:37,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-11-19 07:09:37,192 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 234 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:09:37,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 446 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:09:37,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2023-11-19 07:09:37,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 116. [2023-11-19 07:09:37,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 99 states have (on average 1.3333333333333333) internal successors, (132), 99 states have internal predecessors, (132), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-19 07:09:37,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 162 transitions. [2023-11-19 07:09:37,201 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 162 transitions. Word has length 124 [2023-11-19 07:09:37,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:09:37,202 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 162 transitions. [2023-11-19 07:09:37,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:09:37,203 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 162 transitions. [2023-11-19 07:09:37,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-11-19 07:09:37,204 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:09:37,205 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:09:37,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 07:09:37,205 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:09:37,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:09:37,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1378439380, now seen corresponding path program 1 times [2023-11-19 07:09:37,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:09:37,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144281185] [2023-11-19 07:09:37,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:09:37,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:09:37,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:38,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:09:38,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:38,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:09:38,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:38,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:09:38,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:38,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:09:38,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:38,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:09:38,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:38,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:09:38,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:38,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:09:38,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:38,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:09:38,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:38,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-19 07:09:38,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:38,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:09:38,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:38,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:09:38,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:38,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:09:38,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:38,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:09:38,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:38,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:09:38,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:38,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:09:38,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:38,256 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-19 07:09:38,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:09:38,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144281185] [2023-11-19 07:09:38,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144281185] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:09:38,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:09:38,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:09:38,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040211017] [2023-11-19 07:09:38,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:09:38,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:09:38,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:09:38,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:09:38,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:09:38,260 INFO L87 Difference]: Start difference. First operand 116 states and 162 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:09:38,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:09:38,701 INFO L93 Difference]: Finished difference Result 310 states and 432 transitions. [2023-11-19 07:09:38,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:09:38,702 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 125 [2023-11-19 07:09:38,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:09:38,704 INFO L225 Difference]: With dead ends: 310 [2023-11-19 07:09:38,704 INFO L226 Difference]: Without dead ends: 197 [2023-11-19 07:09:38,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:09:38,706 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 210 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-19 07:09:38,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 428 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-19 07:09:38,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2023-11-19 07:09:38,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 129. [2023-11-19 07:09:38,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 112 states have (on average 1.3482142857142858) internal successors, (151), 112 states have internal predecessors, (151), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-19 07:09:38,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 181 transitions. [2023-11-19 07:09:38,732 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 181 transitions. Word has length 125 [2023-11-19 07:09:38,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:09:38,732 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 181 transitions. [2023-11-19 07:09:38,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:09:38,733 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 181 transitions. [2023-11-19 07:09:38,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-11-19 07:09:38,735 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:09:38,735 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:09:38,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 07:09:38,735 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:09:38,736 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:09:38,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1244425874, now seen corresponding path program 1 times [2023-11-19 07:09:38,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:09:38,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778524843] [2023-11-19 07:09:38,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:09:38,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:09:39,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:39,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:09:39,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:39,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:09:39,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:39,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:09:39,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:39,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:09:39,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:39,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:09:39,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:39,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:09:39,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:39,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:09:39,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:39,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:09:39,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:39,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-19 07:09:39,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:39,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:09:39,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:39,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:09:39,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:39,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:09:39,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:39,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:09:39,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:39,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:09:39,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:39,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:09:39,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:39,522 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-19 07:09:39,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:09:39,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778524843] [2023-11-19 07:09:39,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778524843] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:09:39,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:09:39,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:09:39,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918782358] [2023-11-19 07:09:39,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:09:39,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:09:39,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:09:39,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:09:39,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:09:39,525 INFO L87 Difference]: Start difference. First operand 129 states and 181 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:09:39,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:09:39,738 INFO L93 Difference]: Finished difference Result 257 states and 361 transitions. [2023-11-19 07:09:39,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:09:39,739 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 125 [2023-11-19 07:09:39,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:09:39,740 INFO L225 Difference]: With dead ends: 257 [2023-11-19 07:09:39,741 INFO L226 Difference]: Without dead ends: 131 [2023-11-19 07:09:39,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:09:39,742 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 14 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 07:09:39,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 424 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 07:09:39,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-11-19 07:09:39,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2023-11-19 07:09:39,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 112 states have (on average 1.3392857142857142) internal successors, (150), 112 states have internal predecessors, (150), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-19 07:09:39,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 180 transitions. [2023-11-19 07:09:39,753 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 180 transitions. Word has length 125 [2023-11-19 07:09:39,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:09:39,753 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 180 transitions. [2023-11-19 07:09:39,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:09:39,754 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 180 transitions. [2023-11-19 07:09:39,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-11-19 07:09:39,756 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:09:39,756 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:09:39,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 07:09:39,756 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:09:39,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:09:39,757 INFO L85 PathProgramCache]: Analyzing trace with hash -2064726594, now seen corresponding path program 1 times [2023-11-19 07:09:39,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:09:39,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070144651] [2023-11-19 07:09:39,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:09:39,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:09:39,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:40,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:09:40,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:40,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:09:40,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:40,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:09:40,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:40,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:09:40,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:40,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:09:40,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:40,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:09:40,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:40,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:09:40,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:40,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:09:40,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:40,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-19 07:09:40,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:40,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:09:40,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:40,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:09:40,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:40,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:09:40,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:40,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:09:40,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:40,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:09:40,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:40,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:09:40,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:40,560 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-19 07:09:40,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:09:40,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070144651] [2023-11-19 07:09:40,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070144651] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:09:40,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:09:40,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 07:09:40,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990455823] [2023-11-19 07:09:40,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:09:40,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:09:40,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:09:40,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:09:40,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:09:40,563 INFO L87 Difference]: Start difference. First operand 129 states and 180 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:09:40,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:09:40,987 INFO L93 Difference]: Finished difference Result 350 states and 486 transitions. [2023-11-19 07:09:40,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:09:40,988 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 126 [2023-11-19 07:09:40,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:09:40,990 INFO L225 Difference]: With dead ends: 350 [2023-11-19 07:09:40,990 INFO L226 Difference]: Without dead ends: 224 [2023-11-19 07:09:40,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-11-19 07:09:40,992 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 392 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-19 07:09:40,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 332 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-19 07:09:40,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2023-11-19 07:09:41,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 131. [2023-11-19 07:09:41,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 114 states have (on average 1.3245614035087718) internal successors, (151), 114 states have internal predecessors, (151), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-19 07:09:41,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 181 transitions. [2023-11-19 07:09:41,003 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 181 transitions. Word has length 126 [2023-11-19 07:09:41,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:09:41,007 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 181 transitions. [2023-11-19 07:09:41,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:09:41,008 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 181 transitions. [2023-11-19 07:09:41,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-11-19 07:09:41,010 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:09:41,010 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:09:41,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 07:09:41,010 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:09:41,011 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:09:41,011 INFO L85 PathProgramCache]: Analyzing trace with hash 236095996, now seen corresponding path program 1 times [2023-11-19 07:09:41,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:09:41,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315053995] [2023-11-19 07:09:41,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:09:41,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:09:41,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:41,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:09:41,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:41,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:09:41,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:41,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:09:41,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:41,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:09:41,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:41,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:09:41,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:41,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:09:41,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:41,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:09:41,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:41,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:09:41,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:41,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-19 07:09:41,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:41,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:09:41,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:41,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:09:41,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:41,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:09:41,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:41,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:09:41,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:41,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:09:41,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:41,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:09:41,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:41,494 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-19 07:09:41,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:09:41,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315053995] [2023-11-19 07:09:41,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315053995] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:09:41,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:09:41,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:09:41,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000035379] [2023-11-19 07:09:41,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:09:41,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:09:41,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:09:41,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:09:41,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:09:41,499 INFO L87 Difference]: Start difference. First operand 131 states and 181 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:09:41,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:09:41,766 INFO L93 Difference]: Finished difference Result 350 states and 481 transitions. [2023-11-19 07:09:41,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:09:41,767 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 126 [2023-11-19 07:09:41,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:09:41,770 INFO L225 Difference]: With dead ends: 350 [2023-11-19 07:09:41,770 INFO L226 Difference]: Without dead ends: 222 [2023-11-19 07:09:41,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:09:41,771 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 213 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 07:09:41,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 347 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 07:09:41,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2023-11-19 07:09:41,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 132. [2023-11-19 07:09:41,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 115 states have (on average 1.3217391304347825) internal successors, (152), 115 states have internal predecessors, (152), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-19 07:09:41,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 182 transitions. [2023-11-19 07:09:41,784 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 182 transitions. Word has length 126 [2023-11-19 07:09:41,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:09:41,784 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 182 transitions. [2023-11-19 07:09:41,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:09:41,785 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 182 transitions. [2023-11-19 07:09:41,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-11-19 07:09:41,786 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:09:41,787 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:09:41,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-19 07:09:41,787 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:09:41,787 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:09:41,788 INFO L85 PathProgramCache]: Analyzing trace with hash -519849880, now seen corresponding path program 1 times [2023-11-19 07:09:41,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:09:41,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203808815] [2023-11-19 07:09:41,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:09:41,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:09:41,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:42,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:09:42,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:42,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:09:42,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:42,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:09:42,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:42,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:09:42,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:42,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:09:42,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:42,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:09:42,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:42,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:09:42,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:42,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:09:42,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:42,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-19 07:09:42,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:42,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:09:42,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:42,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:09:42,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:42,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:09:42,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:42,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:09:42,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:42,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:09:42,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:42,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:09:42,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:42,588 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-19 07:09:42,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:09:42,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203808815] [2023-11-19 07:09:42,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203808815] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:09:42,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:09:42,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 07:09:42,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52783571] [2023-11-19 07:09:42,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:09:42,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:09:42,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:09:42,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:09:42,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:09:42,592 INFO L87 Difference]: Start difference. First operand 132 states and 182 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:09:42,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:09:42,970 INFO L93 Difference]: Finished difference Result 333 states and 458 transitions. [2023-11-19 07:09:42,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 07:09:42,971 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 126 [2023-11-19 07:09:42,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:09:42,973 INFO L225 Difference]: With dead ends: 333 [2023-11-19 07:09:42,974 INFO L226 Difference]: Without dead ends: 204 [2023-11-19 07:09:42,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-11-19 07:09:42,975 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 328 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:09:42,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 430 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:09:42,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2023-11-19 07:09:42,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 136. [2023-11-19 07:09:42,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 119 states have (on average 1.3277310924369747) internal successors, (158), 119 states have internal predecessors, (158), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-19 07:09:42,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 188 transitions. [2023-11-19 07:09:42,989 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 188 transitions. Word has length 126 [2023-11-19 07:09:42,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:09:42,989 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 188 transitions. [2023-11-19 07:09:42,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:09:42,990 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 188 transitions. [2023-11-19 07:09:42,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-11-19 07:09:42,992 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:09:42,992 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:09:42,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-19 07:09:42,992 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:09:42,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:09:42,993 INFO L85 PathProgramCache]: Analyzing trace with hash 199899249, now seen corresponding path program 1 times [2023-11-19 07:09:42,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:09:42,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442702104] [2023-11-19 07:09:42,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:09:42,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:09:43,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:45,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:09:45,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:45,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:09:45,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:45,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:09:45,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:45,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:09:45,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:45,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:09:45,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:45,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:09:45,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:45,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:09:45,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:45,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:09:45,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:45,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-19 07:09:45,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:45,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:09:45,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:45,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:09:45,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:45,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:09:45,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:45,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:09:45,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:45,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:09:45,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:45,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:09:45,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:45,156 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-19 07:09:45,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:09:45,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442702104] [2023-11-19 07:09:45,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442702104] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:09:45,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:09:45,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 07:09:45,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644180371] [2023-11-19 07:09:45,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:09:45,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:09:45,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:09:45,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:09:45,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:09:45,159 INFO L87 Difference]: Start difference. First operand 136 states and 188 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:09:45,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:09:45,712 INFO L93 Difference]: Finished difference Result 344 states and 473 transitions. [2023-11-19 07:09:45,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-19 07:09:45,713 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 127 [2023-11-19 07:09:45,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:09:45,715 INFO L225 Difference]: With dead ends: 344 [2023-11-19 07:09:45,715 INFO L226 Difference]: Without dead ends: 211 [2023-11-19 07:09:45,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2023-11-19 07:09:45,717 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 238 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-19 07:09:45,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 599 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-19 07:09:45,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2023-11-19 07:09:45,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 145. [2023-11-19 07:09:45,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 128 states have (on average 1.328125) internal successors, (170), 128 states have internal predecessors, (170), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-19 07:09:45,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 200 transitions. [2023-11-19 07:09:45,732 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 200 transitions. Word has length 127 [2023-11-19 07:09:45,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:09:45,732 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 200 transitions. [2023-11-19 07:09:45,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:09:45,733 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 200 transitions. [2023-11-19 07:09:45,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-11-19 07:09:45,734 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:09:45,735 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:09:45,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-19 07:09:45,735 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:09:45,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:09:45,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1744775963, now seen corresponding path program 1 times [2023-11-19 07:09:45,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:09:45,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622354035] [2023-11-19 07:09:45,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:09:45,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:09:46,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:46,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:09:46,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:46,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:09:46,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:46,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:09:46,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:46,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:09:46,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:46,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:09:46,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:46,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:09:46,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:46,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:09:46,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:46,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:09:46,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:46,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-19 07:09:46,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:46,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:09:46,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:46,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:09:46,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:46,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:09:46,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:46,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:09:46,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:46,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:09:46,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:46,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:09:46,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:46,741 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-19 07:09:46,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:09:46,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622354035] [2023-11-19 07:09:46,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622354035] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:09:46,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:09:46,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 07:09:46,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668891461] [2023-11-19 07:09:46,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:09:46,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:09:46,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:09:46,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:09:46,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:09:46,744 INFO L87 Difference]: Start difference. First operand 145 states and 200 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:09:47,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:09:47,272 INFO L93 Difference]: Finished difference Result 359 states and 493 transitions. [2023-11-19 07:09:47,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:09:47,273 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 127 [2023-11-19 07:09:47,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:09:47,275 INFO L225 Difference]: With dead ends: 359 [2023-11-19 07:09:47,275 INFO L226 Difference]: Without dead ends: 217 [2023-11-19 07:09:47,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-19 07:09:47,277 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 224 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-19 07:09:47,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 478 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-19 07:09:47,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2023-11-19 07:09:47,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 147. [2023-11-19 07:09:47,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 130 states have (on average 1.3307692307692307) internal successors, (173), 130 states have internal predecessors, (173), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-19 07:09:47,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 203 transitions. [2023-11-19 07:09:47,292 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 203 transitions. Word has length 127 [2023-11-19 07:09:47,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:09:47,293 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 203 transitions. [2023-11-19 07:09:47,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:09:47,294 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 203 transitions. [2023-11-19 07:09:47,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-11-19 07:09:47,295 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:09:47,296 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:09:47,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-19 07:09:47,296 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:09:47,297 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:09:47,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1335042000, now seen corresponding path program 1 times [2023-11-19 07:09:47,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:09:47,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341667426] [2023-11-19 07:09:47,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:09:47,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:09:47,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:47,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:09:47,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:47,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:09:47,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:47,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:09:47,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:47,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:09:47,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:47,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:09:47,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:47,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:09:47,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:47,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:09:47,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:47,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:09:47,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:47,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-19 07:09:47,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:47,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:09:47,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:47,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:09:47,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:47,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:09:47,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:47,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:09:47,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:47,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:09:47,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:47,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:09:47,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:47,662 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-19 07:09:47,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:09:47,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341667426] [2023-11-19 07:09:47,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341667426] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:09:47,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:09:47,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:09:47,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136677369] [2023-11-19 07:09:47,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:09:47,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:09:47,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:09:47,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:09:47,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:09:47,674 INFO L87 Difference]: Start difference. First operand 147 states and 203 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:09:47,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:09:47,744 INFO L93 Difference]: Finished difference Result 307 states and 424 transitions. [2023-11-19 07:09:47,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:09:47,745 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 128 [2023-11-19 07:09:47,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:09:47,748 INFO L225 Difference]: With dead ends: 307 [2023-11-19 07:09:47,748 INFO L226 Difference]: Without dead ends: 163 [2023-11-19 07:09:47,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:09:47,750 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 42 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:09:47,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 532 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:09:47,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2023-11-19 07:09:47,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 150. [2023-11-19 07:09:47,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 133 states have (on average 1.3233082706766917) internal successors, (176), 133 states have internal predecessors, (176), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-19 07:09:47,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 206 transitions. [2023-11-19 07:09:47,773 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 206 transitions. Word has length 128 [2023-11-19 07:09:47,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:09:47,774 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 206 transitions. [2023-11-19 07:09:47,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:09:47,775 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 206 transitions. [2023-11-19 07:09:47,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-11-19 07:09:47,777 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:09:47,777 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:09:47,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-19 07:09:47,778 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:09:47,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:09:47,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1305021189, now seen corresponding path program 1 times [2023-11-19 07:09:47,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:09:47,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551461616] [2023-11-19 07:09:47,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:09:47,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:09:48,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:48,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:09:48,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:48,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:09:48,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:48,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:09:48,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:48,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:09:48,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:48,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:09:48,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:48,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:09:48,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:48,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:09:48,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:48,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:09:48,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:48,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-19 07:09:48,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:48,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:09:48,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:48,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:09:48,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:48,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:09:48,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:48,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:09:48,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:48,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:09:48,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:48,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:09:48,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:48,799 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-19 07:09:48,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:09:48,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551461616] [2023-11-19 07:09:48,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551461616] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:09:48,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:09:48,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 07:09:48,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471261235] [2023-11-19 07:09:48,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:09:48,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:09:48,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:09:48,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:09:48,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:09:48,803 INFO L87 Difference]: Start difference. First operand 150 states and 206 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:09:49,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:09:49,223 INFO L93 Difference]: Finished difference Result 369 states and 502 transitions. [2023-11-19 07:09:49,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:09:49,223 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 128 [2023-11-19 07:09:49,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:09:49,226 INFO L225 Difference]: With dead ends: 369 [2023-11-19 07:09:49,227 INFO L226 Difference]: Without dead ends: 222 [2023-11-19 07:09:49,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:09:49,228 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 435 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-19 07:09:49,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 316 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-19 07:09:49,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2023-11-19 07:09:49,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 146. [2023-11-19 07:09:49,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 129 states have (on average 1.317829457364341) internal successors, (170), 129 states have internal predecessors, (170), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-19 07:09:49,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 200 transitions. [2023-11-19 07:09:49,251 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 200 transitions. Word has length 128 [2023-11-19 07:09:49,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:09:49,252 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 200 transitions. [2023-11-19 07:09:49,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:09:49,252 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 200 transitions. [2023-11-19 07:09:49,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-11-19 07:09:49,255 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:09:49,255 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:09:49,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-19 07:09:49,256 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:09:49,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:09:49,257 INFO L85 PathProgramCache]: Analyzing trace with hash 62037240, now seen corresponding path program 1 times [2023-11-19 07:09:49,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:09:49,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965794731] [2023-11-19 07:09:49,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:09:49,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:09:50,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:51,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:09:51,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:51,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:09:51,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:51,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:09:51,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:51,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:09:51,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:51,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:09:51,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:51,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:09:51,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:51,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:09:51,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:51,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:09:51,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:51,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-19 07:09:51,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:51,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:09:51,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:51,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:09:51,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:51,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:09:51,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:51,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:09:51,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:51,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:09:51,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:51,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:09:51,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:51,934 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-19 07:09:51,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:09:51,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965794731] [2023-11-19 07:09:51,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965794731] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:09:51,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:09:51,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-19 07:09:51,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611847299] [2023-11-19 07:09:51,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:09:51,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-19 07:09:51,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:09:51,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-19 07:09:51,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-19 07:09:51,938 INFO L87 Difference]: Start difference. First operand 146 states and 200 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:09:52,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:09:52,688 INFO L93 Difference]: Finished difference Result 368 states and 499 transitions. [2023-11-19 07:09:52,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-19 07:09:52,689 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2023-11-19 07:09:52,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:09:52,692 INFO L225 Difference]: With dead ends: 368 [2023-11-19 07:09:52,693 INFO L226 Difference]: Without dead ends: 225 [2023-11-19 07:09:52,693 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2023-11-19 07:09:52,694 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 234 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-19 07:09:52,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 703 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-19 07:09:52,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2023-11-19 07:09:52,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 148. [2023-11-19 07:09:52,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 131 states have (on average 1.3206106870229009) internal successors, (173), 131 states have internal predecessors, (173), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-19 07:09:52,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 203 transitions. [2023-11-19 07:09:52,718 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 203 transitions. Word has length 129 [2023-11-19 07:09:52,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:09:52,722 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 203 transitions. [2023-11-19 07:09:52,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:09:52,722 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 203 transitions. [2023-11-19 07:09:52,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-11-19 07:09:52,724 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:09:52,724 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:09:52,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-19 07:09:52,725 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:09:52,725 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:09:52,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1530403510, now seen corresponding path program 1 times [2023-11-19 07:09:52,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:09:52,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381519799] [2023-11-19 07:09:52,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:09:52,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:09:53,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:54,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:09:54,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:54,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:09:54,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:54,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:09:54,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:54,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:09:54,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:54,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:09:54,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:54,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:09:54,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:54,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:09:54,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:54,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:09:54,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:54,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-19 07:09:54,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:54,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:09:54,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:54,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:09:54,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:54,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:09:54,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:54,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:09:54,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:54,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:09:54,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:54,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:09:54,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:54,387 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 30 proven. 12 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-11-19 07:09:54,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:09:54,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381519799] [2023-11-19 07:09:54,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381519799] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:09:54,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904323167] [2023-11-19 07:09:54,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:09:54,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:09:54,389 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd8d38f-d69e-457c-b00b-46395482ef64/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:09:54,391 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd8d38f-d69e-457c-b00b-46395482ef64/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:09:54,401 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd8d38f-d69e-457c-b00b-46395482ef64/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 07:09:54,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:09:54,807 INFO L262 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 40 conjunts are in the unsatisfiable core [2023-11-19 07:09:54,827 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:09:57,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-19 07:09:57,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:09:57,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-19 07:09:58,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:09:58,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-19 07:09:58,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2023-11-19 07:09:58,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:09:58,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:09:58,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:09:58,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:09:58,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2023-11-19 07:09:58,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:09:58,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:09:58,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2023-11-19 07:09:58,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:09:58,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:09:58,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:09:58,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:09:58,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2023-11-19 07:09:58,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:09:58,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:09:58,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:09:58,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:09:58,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:09:58,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:09:58,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 25 [2023-11-19 07:09:58,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:09:58,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:09:58,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:09:58,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:09:58,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2023-11-19 07:09:58,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:09:58,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:09:58,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2023-11-19 07:09:58,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:09:58,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:09:58,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2023-11-19 07:09:59,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 26 [2023-11-19 07:09:59,054 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 1 proven. 235 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2023-11-19 07:09:59,054 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:09:59,107 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1064 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| c_~var_1_1_Pointer~0.base v_ArrVal_1064) c_~var_1_12_Pointer~0.base) c_~var_1_12_Pointer~0.offset) 256) 0))) is different from false [2023-11-19 07:09:59,249 WARN L854 $PredicateComparison]: unable to prove that (forall ((~var_1_12_Pointer~0.offset Int) (v_ArrVal_1064 (Array Int Int)) (v_ArrVal_1063 (Array Int Int)) (v_ArrVal_1062 (Array Int Int)) (v_ArrVal_1061 (Array Int Int))) (not (= (mod (select (select (store (store (store (store (store |c_#memory_int| c_~var_1_12_Pointer~0.base (store (select |c_#memory_int| c_~var_1_12_Pointer~0.base) ~var_1_12_Pointer~0.offset (select (select |c_#memory_int| c_~var_1_14_Pointer~0.base) c_~var_1_14_Pointer~0.offset))) c_~var_1_16_Pointer~0.base v_ArrVal_1061) c_~var_1_17_Pointer~0.base v_ArrVal_1063) c_~var_1_19_Pointer~0.base v_ArrVal_1062) c_~var_1_1_Pointer~0.base v_ArrVal_1064) c_~var_1_12_Pointer~0.base) ~var_1_12_Pointer~0.offset) 256) 0))) is different from false [2023-11-19 07:09:59,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1904323167] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:09:59,292 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-19 07:09:59,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2023-11-19 07:09:59,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081271206] [2023-11-19 07:09:59,293 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-19 07:09:59,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-19 07:09:59,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:09:59,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-19 07:09:59,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=606, Unknown=12, NotChecked=102, Total=812 [2023-11-19 07:09:59,298 INFO L87 Difference]: Start difference. First operand 148 states and 203 transitions. Second operand has 25 states, 22 states have (on average 5.181818181818182) internal successors, (114), 22 states have internal predecessors, (114), 10 states have call successors, (30), 6 states have call predecessors, (30), 7 states have return successors, (30), 9 states have call predecessors, (30), 10 states have call successors, (30) [2023-11-19 07:10:02,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:10:02,205 INFO L93 Difference]: Finished difference Result 494 states and 662 transitions. [2023-11-19 07:10:02,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-19 07:10:02,207 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 5.181818181818182) internal successors, (114), 22 states have internal predecessors, (114), 10 states have call successors, (30), 6 states have call predecessors, (30), 7 states have return successors, (30), 9 states have call predecessors, (30), 10 states have call successors, (30) Word has length 129 [2023-11-19 07:10:02,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:10:02,209 INFO L225 Difference]: With dead ends: 494 [2023-11-19 07:10:02,209 INFO L226 Difference]: Without dead ends: 349 [2023-11-19 07:10:02,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=302, Invalid=1416, Unknown=12, NotChecked=162, Total=1892 [2023-11-19 07:10:02,211 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 1067 mSDsluCounter, 842 mSDsCounter, 0 mSdLazyCounter, 1563 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1067 SdHoareTripleChecker+Valid, 939 SdHoareTripleChecker+Invalid, 1659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 1563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-11-19 07:10:02,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1067 Valid, 939 Invalid, 1659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 1563 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-11-19 07:10:02,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2023-11-19 07:10:02,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 154. [2023-11-19 07:10:02,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 136 states have (on average 1.3088235294117647) internal successors, (178), 136 states have internal predecessors, (178), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-19 07:10:02,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 208 transitions. [2023-11-19 07:10:02,231 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 208 transitions. Word has length 129 [2023-11-19 07:10:02,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:10:02,236 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 208 transitions. [2023-11-19 07:10:02,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 5.181818181818182) internal successors, (114), 22 states have internal predecessors, (114), 10 states have call successors, (30), 6 states have call predecessors, (30), 7 states have return successors, (30), 9 states have call predecessors, (30), 10 states have call successors, (30) [2023-11-19 07:10:02,237 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 208 transitions. [2023-11-19 07:10:02,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-11-19 07:10:02,239 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:10:02,239 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:10:02,261 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd8d38f-d69e-457c-b00b-46395482ef64/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-19 07:10:02,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd8d38f-d69e-457c-b00b-46395482ef64/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:10:02,461 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:10:02,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:10:02,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1507771256, now seen corresponding path program 1 times [2023-11-19 07:10:02,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:10:02,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587910236] [2023-11-19 07:10:02,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:10:02,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:10:02,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:10:02,905 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:10:03,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:10:03,344 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:10:03,344 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 07:10:03,345 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-19 07:10:03,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-19 07:10:03,350 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:10:03,354 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 07:10:03,479 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem44 could not be translated [2023-11-19 07:10:03,492 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem44 could not be translated [2023-11-19 07:10:03,496 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem45 could not be translated [2023-11-19 07:10:03,500 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem45 could not be translated [2023-11-19 07:10:03,502 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem47 could not be translated [2023-11-19 07:10:03,504 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem47 could not be translated [2023-11-19 07:10:03,506 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem48 could not be translated [2023-11-19 07:10:03,509 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem48 could not be translated [2023-11-19 07:10:03,510 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem50 could not be translated [2023-11-19 07:10:03,511 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem50 could not be translated [2023-11-19 07:10:03,512 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem51 could not be translated [2023-11-19 07:10:03,513 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem51 could not be translated [2023-11-19 07:10:03,514 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem53 could not be translated [2023-11-19 07:10:03,515 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem53 could not be translated [2023-11-19 07:10:03,516 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem54 could not be translated [2023-11-19 07:10:03,517 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem54 could not be translated [2023-11-19 07:10:03,517 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem56 could not be translated [2023-11-19 07:10:03,518 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem56 could not be translated [2023-11-19 07:10:03,519 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem57 could not be translated [2023-11-19 07:10:03,519 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem57 could not be translated [2023-11-19 07:10:03,520 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem59 could not be translated [2023-11-19 07:10:03,521 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem59 could not be translated [2023-11-19 07:10:03,521 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem60 could not be translated [2023-11-19 07:10:03,521 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem60 could not be translated [2023-11-19 07:10:03,522 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem62 could not be translated [2023-11-19 07:10:03,522 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem62 could not be translated [2023-11-19 07:10:03,523 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem63 could not be translated [2023-11-19 07:10:03,524 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem63 could not be translated [2023-11-19 07:10:03,524 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem66 could not be translated [2023-11-19 07:10:03,524 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem65 could not be translated [2023-11-19 07:10:03,525 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short67 could not be translated [2023-11-19 07:10:03,525 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem65 could not be translated [2023-11-19 07:10:03,525 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short71 could not be translated [2023-11-19 07:10:03,525 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem66 could not be translated [2023-11-19 07:10:03,526 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem66 could not be translated [2023-11-19 07:10:03,526 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short71 could not be translated [2023-11-19 07:10:03,526 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem65 could not be translated [2023-11-19 07:10:03,526 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short67 could not be translated [2023-11-19 07:10:03,527 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem4 could not be translated [2023-11-19 07:10:03,527 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem11 could not be translated [2023-11-19 07:10:03,527 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem10 could not be translated [2023-11-19 07:10:03,528 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem13 could not be translated [2023-11-19 07:10:03,532 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem17 could not be translated [2023-11-19 07:10:03,532 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem16 could not be translated [2023-11-19 07:10:03,533 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem18 could not be translated [2023-11-19 07:10:03,533 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem17 could not be translated [2023-11-19 07:10:03,533 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem16 could not be translated [2023-11-19 07:10:03,533 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite20 could not be translated [2023-11-19 07:10:03,534 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite20 could not be translated [2023-11-19 07:10:03,534 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem17 could not be translated [2023-11-19 07:10:03,534 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem18 could not be translated [2023-11-19 07:10:03,534 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem21 could not be translated [2023-11-19 07:10:03,535 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem16 could not be translated [2023-11-19 07:10:03,535 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem16 could not be translated [2023-11-19 07:10:03,535 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite28 could not be translated [2023-11-19 07:10:03,535 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem18 could not be translated [2023-11-19 07:10:03,536 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem17 could not be translated [2023-11-19 07:10:03,536 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem21 could not be translated [2023-11-19 07:10:03,536 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite20 could not be translated [2023-11-19 07:10:03,536 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem27 could not be translated [2023-11-19 07:10:03,537 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem31 could not be translated [2023-11-19 07:10:03,537 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem30 could not be translated [2023-11-19 07:10:03,537 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem30 could not be translated [2023-11-19 07:10:03,537 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem32 could not be translated [2023-11-19 07:10:03,538 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem31 could not be translated [2023-11-19 07:10:03,538 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem32 could not be translated [2023-11-19 07:10:03,538 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem31 could not be translated [2023-11-19 07:10:03,538 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem35 could not be translated [2023-11-19 07:10:03,538 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem30 could not be translated [2023-11-19 07:10:03,539 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem73 could not be translated [2023-11-19 07:10:03,539 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem72 could not be translated [2023-11-19 07:10:03,540 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem72 could not be translated [2023-11-19 07:10:03,540 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem94 could not be translated [2023-11-19 07:10:03,540 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem73 could not be translated [2023-11-19 07:10:03,540 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem95 could not be translated [2023-11-19 07:10:03,540 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite96 could not be translated [2023-11-19 07:10:03,540 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short74 could not be translated [2023-11-19 07:10:03,541 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem72 could not be translated [2023-11-19 07:10:03,541 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem95 could not be translated [2023-11-19 07:10:03,541 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem94 could not be translated [2023-11-19 07:10:03,541 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite96 could not be translated [2023-11-19 07:10:03,542 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem73 could not be translated [2023-11-19 07:10:03,542 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short112 could not be translated [2023-11-19 07:10:03,542 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short74 could not be translated [2023-11-19 07:10:03,542 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short74 could not be translated [2023-11-19 07:10:03,543 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem94 could not be translated [2023-11-19 07:10:03,543 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem73 could not be translated [2023-11-19 07:10:03,543 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short112 could not be translated [2023-11-19 07:10:03,543 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite96 could not be translated [2023-11-19 07:10:03,543 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short119 could not be translated [2023-11-19 07:10:03,543 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem95 could not be translated [2023-11-19 07:10:03,544 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem72 could not be translated [2023-11-19 07:10:03,544 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short74 could not be translated [2023-11-19 07:10:03,544 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem95 could not be translated [2023-11-19 07:10:03,545 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short119 could not be translated [2023-11-19 07:10:03,545 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem72 could not be translated [2023-11-19 07:10:03,545 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem73 could not be translated [2023-11-19 07:10:03,545 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem94 could not be translated [2023-11-19 07:10:03,545 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short122 could not be translated [2023-11-19 07:10:03,545 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite96 could not be translated [2023-11-19 07:10:03,546 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short112 could not be translated [2023-11-19 07:10:03,546 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short122 could not be translated [2023-11-19 07:10:03,546 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short119 could not be translated [2023-11-19 07:10:03,546 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem95 could not be translated [2023-11-19 07:10:03,547 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem72 could not be translated [2023-11-19 07:10:03,547 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short125 could not be translated [2023-11-19 07:10:03,547 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem73 could not be translated [2023-11-19 07:10:03,547 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short74 could not be translated [2023-11-19 07:10:03,547 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short112 could not be translated [2023-11-19 07:10:03,547 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem94 could not be translated [2023-11-19 07:10:03,548 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite96 could not be translated [2023-11-19 07:10:03,548 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem94 could not be translated [2023-11-19 07:10:03,548 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short128 could not be translated [2023-11-19 07:10:03,548 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short125 could not be translated [2023-11-19 07:10:03,549 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short112 could not be translated [2023-11-19 07:10:03,549 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite96 could not be translated [2023-11-19 07:10:03,549 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short74 could not be translated [2023-11-19 07:10:03,549 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short122 could not be translated [2023-11-19 07:10:03,549 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem72 could not be translated [2023-11-19 07:10:03,549 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem95 could not be translated [2023-11-19 07:10:03,550 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short119 could not be translated [2023-11-19 07:10:03,550 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem73 could not be translated [2023-11-19 07:10:03,591 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:10:03 BoogieIcfgContainer [2023-11-19 07:10:03,591 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 07:10:03,592 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 07:10:03,592 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 07:10:03,592 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 07:10:03,593 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:09:32" (3/4) ... [2023-11-19 07:10:03,595 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-19 07:10:03,596 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 07:10:03,597 INFO L158 Benchmark]: Toolchain (without parser) took 32177.64ms. Allocated memory was 132.1MB in the beginning and 610.3MB in the end (delta: 478.2MB). Free memory was 88.8MB in the beginning and 480.6MB in the end (delta: -391.8MB). Peak memory consumption was 87.4MB. Max. memory is 16.1GB. [2023-11-19 07:10:03,597 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 132.1MB. Free memory is still 88.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:10:03,598 INFO L158 Benchmark]: CACSL2BoogieTranslator took 432.34ms. Allocated memory is still 132.1MB. Free memory was 88.3MB in the beginning and 74.5MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-19 07:10:03,601 INFO L158 Benchmark]: Boogie Procedure Inliner took 101.13ms. Allocated memory is still 132.1MB. Free memory was 74.5MB in the beginning and 71.3MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 07:10:03,601 INFO L158 Benchmark]: Boogie Preprocessor took 58.13ms. Allocated memory is still 132.1MB. Free memory was 71.3MB in the beginning and 68.5MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-19 07:10:03,601 INFO L158 Benchmark]: RCFGBuilder took 936.65ms. Allocated memory is still 132.1MB. Free memory was 68.5MB in the beginning and 86.4MB in the end (delta: -17.8MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. [2023-11-19 07:10:03,606 INFO L158 Benchmark]: TraceAbstraction took 30624.31ms. Allocated memory was 132.1MB in the beginning and 610.3MB in the end (delta: 478.2MB). Free memory was 85.8MB in the beginning and 481.7MB in the end (delta: -395.9MB). Peak memory consumption was 351.7MB. Max. memory is 16.1GB. [2023-11-19 07:10:03,607 INFO L158 Benchmark]: Witness Printer took 4.24ms. Allocated memory is still 610.3MB. Free memory was 481.7MB in the beginning and 480.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:10:03,609 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.33ms. Allocated memory is still 132.1MB. Free memory is still 88.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 432.34ms. Allocated memory is still 132.1MB. Free memory was 88.3MB in the beginning and 74.5MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 101.13ms. Allocated memory is still 132.1MB. Free memory was 74.5MB in the beginning and 71.3MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.13ms. Allocated memory is still 132.1MB. Free memory was 71.3MB in the beginning and 68.5MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 936.65ms. Allocated memory is still 132.1MB. Free memory was 68.5MB in the beginning and 86.4MB in the end (delta: -17.8MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. * TraceAbstraction took 30624.31ms. Allocated memory was 132.1MB in the beginning and 610.3MB in the end (delta: 478.2MB). Free memory was 85.8MB in the beginning and 481.7MB in the end (delta: -395.9MB). Peak memory consumption was 351.7MB. Max. memory is 16.1GB. * Witness Printer took 4.24ms. Allocated memory is still 610.3MB. Free memory was 481.7MB in the beginning and 480.6MB 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.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem44 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem44 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem45 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem45 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem47 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem47 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem48 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem48 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem50 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem50 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem51 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem51 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem53 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem53 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem54 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem54 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem56 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem56 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem57 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem57 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem59 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem59 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem60 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem60 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem62 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem62 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem63 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem63 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem66 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem65 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short67 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem65 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short71 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem66 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem66 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short71 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem65 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short67 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem10 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem13 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem16 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem18 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem16 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite20 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite20 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem18 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem21 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem16 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem16 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite28 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem18 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem21 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite20 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem27 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem31 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem30 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem30 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem32 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem31 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem32 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem31 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem35 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem30 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem73 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem72 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem72 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem94 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem73 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem95 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite96 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short74 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem72 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem95 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem94 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite96 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem73 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short112 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short74 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short74 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem94 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem73 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short112 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite96 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short119 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem95 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem72 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short74 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem95 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short119 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem72 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem73 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem94 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short122 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite96 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short112 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short122 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short119 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem95 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem72 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short125 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem73 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short74 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short112 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem94 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite96 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem94 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short128 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short125 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short112 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite96 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short74 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short122 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem72 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem95 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short119 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem73 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 102, overapproximation of someBinaryDOUBLEComparisonOperation at line 70, overapproximation of someBinaryArithmeticDOUBLEoperation at line 70. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 32; [L23] signed char* var_1_1_Pointer = &(var_1_1); [L24] unsigned char var_1_2 = 0; [L25] unsigned char* var_1_2_Pointer = &(var_1_2); [L26] signed char var_1_4 = 16; [L27] signed char* var_1_4_Pointer = &(var_1_4); [L28] signed char var_1_5 = 4; [L29] signed char* var_1_5_Pointer = &(var_1_5); [L30] signed char var_1_6 = 0; [L31] signed char* var_1_6_Pointer = &(var_1_6); [L32] unsigned short int var_1_7 = 0; [L33] unsigned short int* var_1_7_Pointer = &(var_1_7); [L34] unsigned short int var_1_10 = 55182; [L35] unsigned short int* var_1_10_Pointer = &(var_1_10); [L36] unsigned char var_1_12 = 0; [L37] unsigned char* var_1_12_Pointer = &(var_1_12); [L38] unsigned char var_1_14 = 1; [L39] unsigned char* var_1_14_Pointer = &(var_1_14); [L40] unsigned char var_1_15 = 1; [L41] unsigned char* var_1_15_Pointer = &(var_1_15); [L42] unsigned char var_1_16 = 100; [L43] unsigned char* var_1_16_Pointer = &(var_1_16); [L44] float var_1_17 = 2.25; [L45] float* var_1_17_Pointer = &(var_1_17); [L46] float var_1_18 = 199.4; [L47] float* var_1_18_Pointer = &(var_1_18); [L48] signed char var_1_19 = -128; [L49] signed char* var_1_19_Pointer = &(var_1_19); VAL [isInitial=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L106] isInitial = 1 [L107] FCALL initially() [L108] COND TRUE 1 [L109] FCALL updateLastVariables() [L110] CALL updateVariables() [L75] var_1_2 = __VERIFIER_nondet_uchar() [L76] EXPR \read(var_1_2) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L76] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L76] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L77] EXPR \read(var_1_2) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L77] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L77] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L78] var_1_4 = __VERIFIER_nondet_char() [L79] EXPR \read(var_1_4) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L79] CALL assume_abort_if_not(var_1_4 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L79] RET assume_abort_if_not(var_1_4 >= -1) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L80] EXPR \read(var_1_4) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L80] CALL assume_abort_if_not(var_1_4 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L80] RET assume_abort_if_not(var_1_4 <= 126) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L81] var_1_5 = __VERIFIER_nondet_char() [L82] EXPR \read(var_1_5) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L82] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L82] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L83] EXPR \read(var_1_5) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L83] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L83] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L84] var_1_6 = __VERIFIER_nondet_char() [L85] EXPR \read(var_1_6) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L85] CALL assume_abort_if_not(var_1_6 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L85] RET assume_abort_if_not(var_1_6 >= -127) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L86] EXPR \read(var_1_6) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L86] CALL assume_abort_if_not(var_1_6 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L86] RET assume_abort_if_not(var_1_6 <= 126) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L87] var_1_10 = __VERIFIER_nondet_ushort() [L88] EXPR \read(var_1_10) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L88] CALL assume_abort_if_not(var_1_10 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L88] RET assume_abort_if_not(var_1_10 >= 32767) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L89] EXPR \read(var_1_10) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L89] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L89] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L90] var_1_14 = __VERIFIER_nondet_uchar() [L91] EXPR \read(var_1_14) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L91] CALL assume_abort_if_not(var_1_14 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L91] RET assume_abort_if_not(var_1_14 >= 1) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L92] EXPR \read(var_1_14) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L92] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L92] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L93] var_1_15 = __VERIFIER_nondet_uchar() [L94] EXPR \read(var_1_15) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L94] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L94] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L95] EXPR \read(var_1_15) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L95] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L95] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L96] var_1_18 = __VERIFIER_nondet_float() [L97] EXPR \read(var_1_18) [L97] EXPR var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F [L97] EXPR \read(var_1_18) [L97] EXPR var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L97] EXPR (var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L97] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L97] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L110] RET updateVariables() [L111] CALL step() [L53] EXPR \read(*var_1_2_Pointer) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L53] COND FALSE !(! (*(var_1_2_Pointer))) [L56] EXPR \read(*var_1_15_Pointer) [L56] (*(var_1_12_Pointer)) = ((! (*(var_1_15_Pointer))) || (! (! 0))) [L58] EXPR \read(*var_1_5_Pointer) [L58] (*(var_1_16_Pointer)) = (*(var_1_5_Pointer)) [L59] EXPR \read(*var_1_18_Pointer) [L59] (*(var_1_17_Pointer)) = (*(var_1_18_Pointer)) [L60] EXPR \read(*var_1_4_Pointer) [L60] (*(var_1_19_Pointer)) = (*(var_1_4_Pointer)) [L61] EXPR \read(*var_1_12_Pointer) [L61] (*(var_1_12_Pointer)) || (64.75f < (*(var_1_17_Pointer))) [L61] EXPR \read(*var_1_17_Pointer) [L61] (*(var_1_12_Pointer)) || (64.75f < (*(var_1_17_Pointer))) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L61] COND TRUE (*(var_1_12_Pointer)) || (64.75f < (*(var_1_17_Pointer))) [L62] EXPR \read(*var_1_12_Pointer) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L62] COND FALSE !((*(var_1_12_Pointer))) [L65] EXPR \read(*var_1_4_Pointer) [L65] EXPR \read(*var_1_5_Pointer) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L65] EXPR (((*(var_1_4_Pointer))) > ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer))) [L65] EXPR \read(*var_1_4_Pointer) [L65] EXPR (((*(var_1_4_Pointer))) > ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer))) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L65] EXPR \read(*var_1_6_Pointer) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L65] EXPR (((((((*(var_1_4_Pointer))) > ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer)))))) < ((*(var_1_6_Pointer)))) ? ((((((*(var_1_4_Pointer))) > ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer)))))) : ((*(var_1_6_Pointer))) [L65] EXPR \read(*var_1_6_Pointer) [L65] EXPR (((((((*(var_1_4_Pointer))) > ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer)))))) < ((*(var_1_6_Pointer)))) ? ((((((*(var_1_4_Pointer))) > ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer)))))) : ((*(var_1_6_Pointer))) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L65] (*(var_1_1_Pointer)) = (((((((((*(var_1_4_Pointer))) > ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer)))))) < ((*(var_1_6_Pointer)))) ? ((((((*(var_1_4_Pointer))) > ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer)))))) : ((*(var_1_6_Pointer))))) [L70] EXPR \read(*var_1_17_Pointer) [L70] EXPR \read(*var_1_17_Pointer) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L70] EXPR ((((*(var_1_17_Pointer)) * 127.75)) > (((*(var_1_17_Pointer)) / 3.4))) ? (((*(var_1_17_Pointer)) * 127.75)) : (((*(var_1_17_Pointer)) / 3.4)) [L70] EXPR \read(*var_1_17_Pointer) [L70] EXPR ((((*(var_1_17_Pointer)) * 127.75)) > (((*(var_1_17_Pointer)) / 3.4))) ? (((*(var_1_17_Pointer)) * 127.75)) : (((*(var_1_17_Pointer)) / 3.4)) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L70] EXPR \read(*var_1_17_Pointer) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L70] COND FALSE !(((((((*(var_1_17_Pointer)) * 127.75)) > (((*(var_1_17_Pointer)) / 3.4))) ? (((*(var_1_17_Pointer)) * 127.75)) : (((*(var_1_17_Pointer)) / 3.4)))) >= (*(var_1_17_Pointer))) [L111] RET step() [L112] CALL, EXPR property() [L102] EXPR \read(*var_1_12_Pointer) [L102] EXPR (*(var_1_12_Pointer)) || (64.75f < (*(var_1_17_Pointer))) [L102] EXPR \read(*var_1_17_Pointer) [L102] EXPR (*(var_1_12_Pointer)) || (64.75f < (*(var_1_17_Pointer))) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L102] EXPR ((*(var_1_12_Pointer)) || (64.75f < (*(var_1_17_Pointer)))) ? ((*(var_1_12_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed char) ((*(var_1_4_Pointer)) - (*(var_1_5_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (((((((((*(var_1_4_Pointer))) > ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer)))))) < ((*(var_1_6_Pointer)))) ? ((((((*(var_1_4_Pointer))) > ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer)))))) : ((*(var_1_6_Pointer)))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_4_Pointer)))) [L102] EXPR \read(*var_1_1_Pointer) [L102] EXPR \read(*var_1_4_Pointer) [L102] EXPR ((*(var_1_12_Pointer)) || (64.75f < (*(var_1_17_Pointer)))) ? ((*(var_1_12_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed char) ((*(var_1_4_Pointer)) - (*(var_1_5_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (((((((((*(var_1_4_Pointer))) > ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer)))))) < ((*(var_1_6_Pointer)))) ? ((((((*(var_1_4_Pointer))) > ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer)))))) : ((*(var_1_6_Pointer)))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_4_Pointer)))) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L102] EXPR (((*(var_1_12_Pointer)) || (64.75f < (*(var_1_17_Pointer)))) ? ((*(var_1_12_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed char) ((*(var_1_4_Pointer)) - (*(var_1_5_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (((((((((*(var_1_4_Pointer))) > ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer)))))) < ((*(var_1_6_Pointer)))) ? ((((((*(var_1_4_Pointer))) > ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer)))))) : ((*(var_1_6_Pointer)))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_4_Pointer))))) && ((((((((*(var_1_17_Pointer)) * 127.75)) > (((*(var_1_17_Pointer)) / 3.4))) ? (((*(var_1_17_Pointer)) * 127.75)) : (((*(var_1_17_Pointer)) / 3.4)))) >= (*(var_1_17_Pointer))) ? ((*(var_1_7_Pointer)) == ((unsigned short int) ((((((*(var_1_10_Pointer)) - (22925 - (*(var_1_5_Pointer))))) < ((*(var_1_16_Pointer)))) ? (((*(var_1_10_Pointer)) - (22925 - (*(var_1_5_Pointer))))) : ((*(var_1_16_Pointer))))))) : 1) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L102] EXPR ((((*(var_1_12_Pointer)) || (64.75f < (*(var_1_17_Pointer)))) ? ((*(var_1_12_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed char) ((*(var_1_4_Pointer)) - (*(var_1_5_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (((((((((*(var_1_4_Pointer))) > ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer)))))) < ((*(var_1_6_Pointer)))) ? ((((((*(var_1_4_Pointer))) > ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer)))))) : ((*(var_1_6_Pointer)))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_4_Pointer))))) && ((((((((*(var_1_17_Pointer)) * 127.75)) > (((*(var_1_17_Pointer)) / 3.4))) ? (((*(var_1_17_Pointer)) * 127.75)) : (((*(var_1_17_Pointer)) / 3.4)))) >= (*(var_1_17_Pointer))) ? ((*(var_1_7_Pointer)) == ((unsigned short int) ((((((*(var_1_10_Pointer)) - (22925 - (*(var_1_5_Pointer))))) < ((*(var_1_16_Pointer)))) ? (((*(var_1_10_Pointer)) - (22925 - (*(var_1_5_Pointer))))) : ((*(var_1_16_Pointer))))))) : 1)) && ((! (*(var_1_2_Pointer))) ? ((*(var_1_12_Pointer)) == ((unsigned char) (*(var_1_14_Pointer)))) : ((*(var_1_12_Pointer)) == ((unsigned char) ((! (*(var_1_15_Pointer))) || (! (! 0)))))) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L102] EXPR (((((*(var_1_12_Pointer)) || (64.75f < (*(var_1_17_Pointer)))) ? ((*(var_1_12_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed char) ((*(var_1_4_Pointer)) - (*(var_1_5_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (((((((((*(var_1_4_Pointer))) > ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer)))))) < ((*(var_1_6_Pointer)))) ? ((((((*(var_1_4_Pointer))) > ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer)))))) : ((*(var_1_6_Pointer)))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_4_Pointer))))) && ((((((((*(var_1_17_Pointer)) * 127.75)) > (((*(var_1_17_Pointer)) / 3.4))) ? (((*(var_1_17_Pointer)) * 127.75)) : (((*(var_1_17_Pointer)) / 3.4)))) >= (*(var_1_17_Pointer))) ? ((*(var_1_7_Pointer)) == ((unsigned short int) ((((((*(var_1_10_Pointer)) - (22925 - (*(var_1_5_Pointer))))) < ((*(var_1_16_Pointer)))) ? (((*(var_1_10_Pointer)) - (22925 - (*(var_1_5_Pointer))))) : ((*(var_1_16_Pointer))))))) : 1)) && ((! (*(var_1_2_Pointer))) ? ((*(var_1_12_Pointer)) == ((unsigned char) (*(var_1_14_Pointer)))) : ((*(var_1_12_Pointer)) == ((unsigned char) ((! (*(var_1_15_Pointer))) || (! (! 0))))))) && ((*(var_1_16_Pointer)) == ((unsigned char) (*(var_1_5_Pointer)))) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L102] EXPR ((((((*(var_1_12_Pointer)) || (64.75f < (*(var_1_17_Pointer)))) ? ((*(var_1_12_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed char) ((*(var_1_4_Pointer)) - (*(var_1_5_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (((((((((*(var_1_4_Pointer))) > ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer)))))) < ((*(var_1_6_Pointer)))) ? ((((((*(var_1_4_Pointer))) > ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer)))))) : ((*(var_1_6_Pointer)))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_4_Pointer))))) && ((((((((*(var_1_17_Pointer)) * 127.75)) > (((*(var_1_17_Pointer)) / 3.4))) ? (((*(var_1_17_Pointer)) * 127.75)) : (((*(var_1_17_Pointer)) / 3.4)))) >= (*(var_1_17_Pointer))) ? ((*(var_1_7_Pointer)) == ((unsigned short int) ((((((*(var_1_10_Pointer)) - (22925 - (*(var_1_5_Pointer))))) < ((*(var_1_16_Pointer)))) ? (((*(var_1_10_Pointer)) - (22925 - (*(var_1_5_Pointer))))) : ((*(var_1_16_Pointer))))))) : 1)) && ((! (*(var_1_2_Pointer))) ? ((*(var_1_12_Pointer)) == ((unsigned char) (*(var_1_14_Pointer)))) : ((*(var_1_12_Pointer)) == ((unsigned char) ((! (*(var_1_15_Pointer))) || (! (! 0))))))) && ((*(var_1_16_Pointer)) == ((unsigned char) (*(var_1_5_Pointer))))) && ((*(var_1_17_Pointer)) == ((float) (*(var_1_18_Pointer)))) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L102] EXPR (((((((*(var_1_12_Pointer)) || (64.75f < (*(var_1_17_Pointer)))) ? ((*(var_1_12_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed char) ((*(var_1_4_Pointer)) - (*(var_1_5_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (((((((((*(var_1_4_Pointer))) > ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer)))))) < ((*(var_1_6_Pointer)))) ? ((((((*(var_1_4_Pointer))) > ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer)))))) : ((*(var_1_6_Pointer)))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_4_Pointer))))) && ((((((((*(var_1_17_Pointer)) * 127.75)) > (((*(var_1_17_Pointer)) / 3.4))) ? (((*(var_1_17_Pointer)) * 127.75)) : (((*(var_1_17_Pointer)) / 3.4)))) >= (*(var_1_17_Pointer))) ? ((*(var_1_7_Pointer)) == ((unsigned short int) ((((((*(var_1_10_Pointer)) - (22925 - (*(var_1_5_Pointer))))) < ((*(var_1_16_Pointer)))) ? (((*(var_1_10_Pointer)) - (22925 - (*(var_1_5_Pointer))))) : ((*(var_1_16_Pointer))))))) : 1)) && ((! (*(var_1_2_Pointer))) ? ((*(var_1_12_Pointer)) == ((unsigned char) (*(var_1_14_Pointer)))) : ((*(var_1_12_Pointer)) == ((unsigned char) ((! (*(var_1_15_Pointer))) || (! (! 0))))))) && ((*(var_1_16_Pointer)) == ((unsigned char) (*(var_1_5_Pointer))))) && ((*(var_1_17_Pointer)) == ((float) (*(var_1_18_Pointer))))) && ((*(var_1_19_Pointer)) == ((signed char) (*(var_1_4_Pointer)))) VAL [isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L102-L103] return (((((((*(var_1_12_Pointer)) || (64.75f < (*(var_1_17_Pointer)))) ? ((*(var_1_12_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed char) ((*(var_1_4_Pointer)) - (*(var_1_5_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (((((((((*(var_1_4_Pointer))) > ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer)))))) < ((*(var_1_6_Pointer)))) ? ((((((*(var_1_4_Pointer))) > ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer)))))) : ((*(var_1_6_Pointer)))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_4_Pointer))))) && ((((((((*(var_1_17_Pointer)) * 127.75)) > (((*(var_1_17_Pointer)) / 3.4))) ? (((*(var_1_17_Pointer)) * 127.75)) : (((*(var_1_17_Pointer)) / 3.4)))) >= (*(var_1_17_Pointer))) ? ((*(var_1_7_Pointer)) == ((unsigned short int) ((((((*(var_1_10_Pointer)) - (22925 - (*(var_1_5_Pointer))))) < ((*(var_1_16_Pointer)))) ? (((*(var_1_10_Pointer)) - (22925 - (*(var_1_5_Pointer))))) : ((*(var_1_16_Pointer))))))) : 1)) && ((! (*(var_1_2_Pointer))) ? ((*(var_1_12_Pointer)) == ((unsigned char) (*(var_1_14_Pointer)))) : ((*(var_1_12_Pointer)) == ((unsigned char) ((! (*(var_1_15_Pointer))) || (! (! 0))))))) && ((*(var_1_16_Pointer)) == ((unsigned char) (*(var_1_5_Pointer))))) && ((*(var_1_17_Pointer)) == ((float) (*(var_1_18_Pointer))))) && ((*(var_1_19_Pointer)) == ((signed char) (*(var_1_4_Pointer)))) ; [L112] RET, EXPR property() [L112] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_4={6:0}, var_1_4_Pointer={6:0}, var_1_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 101 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 30.3s, OverallIterations: 20, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 7.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3718 SdHoareTripleChecker+Valid, 5.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3717 mSDsluCounter, 8278 SdHoareTripleChecker+Invalid, 4.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5626 mSDsCounter, 136 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4290 IncrementalHoareTripleChecker+Invalid, 4426 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 136 mSolverCounterUnsat, 2652 mSDtfsCounter, 4290 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 905 GetRequests, 766 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=154occurred in iteration=19, InterpolantAutomatonStates: 125, 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, 19 MinimizatonAttempts, 925 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 4.1s SatisfiabilityAnalysisTime, 15.8s InterpolantComputationTime, 2646 NumberOfCodeBlocks, 2646 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 2497 ConstructedInterpolants, 13 QuantifiedInterpolants, 11580 SizeOfPredicates, 21 NumberOfNonLiveVariables, 579 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 20 InterpolantComputations, 18 PerfectInterpolantSequences, 8153/8400 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 [2023-11-19 07:10:03,677 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd8d38f-d69e-457c-b00b-46395482ef64/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd8d38f-d69e-457c-b00b-46395482ef64/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd8d38f-d69e-457c-b00b-46395482ef64/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd8d38f-d69e-457c-b00b-46395482ef64/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd8d38f-d69e-457c-b00b-46395482ef64/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-24.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd8d38f-d69e-457c-b00b-46395482ef64/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd8d38f-d69e-457c-b00b-46395482ef64/bin/uautomizer-verify-uCwYo4JHxu --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 0aa4dd51c4cd5f506c8ea883675989f435890e74667457bb82ef32d99c08b8b8 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:10:06,418 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:10:06,534 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd8d38f-d69e-457c-b00b-46395482ef64/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-19 07:10:06,541 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:10:06,541 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:10:06,572 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:10:06,573 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:10:06,574 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:10:06,575 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:10:06,575 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:10:06,576 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:10:06,577 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:10:06,578 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:10:06,578 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:10:06,579 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:10:06,579 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:10:06,580 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:10:06,581 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:10:06,581 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:10:06,582 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:10:06,583 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:10:06,583 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-19 07:10:06,584 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-19 07:10:06,585 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-19 07:10:06,585 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:10:06,586 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:10:06,586 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:10:06,587 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:10:06,587 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:10:06,588 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:10:06,588 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:10:06,589 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:10:06,589 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:10:06,590 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:10:06,590 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-19 07:10:06,591 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-19 07:10:06,591 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:10:06,592 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:10:06,592 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:10:06,592 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:10:06,593 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-19 07:10:06,593 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:10:06,594 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_0dd8d38f-d69e-457c-b00b-46395482ef64/bin/uautomizer-verify-uCwYo4JHxu/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_0dd8d38f-d69e-457c-b00b-46395482ef64/bin/uautomizer-verify-uCwYo4JHxu 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 -> 0aa4dd51c4cd5f506c8ea883675989f435890e74667457bb82ef32d99c08b8b8 [2023-11-19 07:10:06,993 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:10:07,018 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:10:07,022 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:10:07,023 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:10:07,024 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:10:07,026 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd8d38f-d69e-457c-b00b-46395482ef64/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-24.i [2023-11-19 07:10:10,484 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:10:10,779 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:10:10,781 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd8d38f-d69e-457c-b00b-46395482ef64/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-24.i [2023-11-19 07:10:10,798 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd8d38f-d69e-457c-b00b-46395482ef64/bin/uautomizer-verify-uCwYo4JHxu/data/f30a27490/babcce7740494a6abba68cc31034626a/FLAG494dc29f6 [2023-11-19 07:10:10,825 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd8d38f-d69e-457c-b00b-46395482ef64/bin/uautomizer-verify-uCwYo4JHxu/data/f30a27490/babcce7740494a6abba68cc31034626a [2023-11-19 07:10:10,833 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:10:10,837 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:10:10,839 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:10:10,839 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:10:10,845 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:10:10,849 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:10:10" (1/1) ... [2023-11-19 07:10:10,850 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e3228b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:10:10, skipping insertion in model container [2023-11-19 07:10:10,850 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:10:10" (1/1) ... [2023-11-19 07:10:10,898 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:10:11,089 WARN L240 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_0dd8d38f-d69e-457c-b00b-46395482ef64/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-24.i[916,929] [2023-11-19 07:10:11,217 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:10:11,251 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:10:11,269 WARN L240 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_0dd8d38f-d69e-457c-b00b-46395482ef64/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-24.i[916,929] [2023-11-19 07:10:11,329 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:10:11,370 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:10:11,370 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:10:11 WrapperNode [2023-11-19 07:10:11,371 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:10:11,373 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:10:11,373 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:10:11,373 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:10:11,385 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:10:11" (1/1) ... [2023-11-19 07:10:11,425 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:10:11" (1/1) ... [2023-11-19 07:10:11,492 INFO L138 Inliner]: procedures = 33, calls = 166, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 435 [2023-11-19 07:10:11,495 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:10:11,496 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:10:11,497 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:10:11,497 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:10:11,506 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:10:11" (1/1) ... [2023-11-19 07:10:11,507 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:10:11" (1/1) ... [2023-11-19 07:10:11,526 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:10:11" (1/1) ... [2023-11-19 07:10:11,540 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:10:11" (1/1) ... [2023-11-19 07:10:11,556 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:10:11" (1/1) ... [2023-11-19 07:10:11,576 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:10:11" (1/1) ... [2023-11-19 07:10:11,596 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:10:11" (1/1) ... [2023-11-19 07:10:11,600 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:10:11" (1/1) ... [2023-11-19 07:10:11,607 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:10:11,619 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:10:11,620 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:10:11,620 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:10:11,621 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:10:11" (1/1) ... [2023-11-19 07:10:11,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:10:11,643 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd8d38f-d69e-457c-b00b-46395482ef64/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:10:11,662 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd8d38f-d69e-457c-b00b-46395482ef64/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:10:11,700 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd8d38f-d69e-457c-b00b-46395482ef64/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:10:11,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:10:11,714 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-11-19 07:10:11,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2023-11-19 07:10:11,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-19 07:10:11,714 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2023-11-19 07:10:11,715 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2023-11-19 07:10:11,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2023-11-19 07:10:11,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2023-11-19 07:10:11,715 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-19 07:10:11,718 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-19 07:10:11,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:10:11,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:10:11,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2023-11-19 07:10:11,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2023-11-19 07:10:11,939 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:10:11,942 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation