./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-62.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a8f516-3bd1-4cab-a5cf-aeb231f4001f/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a8f516-3bd1-4cab-a5cf-aeb231f4001f/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_c4a8f516-3bd1-4cab-a5cf-aeb231f4001f/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a8f516-3bd1-4cab-a5cf-aeb231f4001f/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-62.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a8f516-3bd1-4cab-a5cf-aeb231f4001f/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_c4a8f516-3bd1-4cab-a5cf-aeb231f4001f/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 e13ee54c81e57197c9e1d82387e2e01bbf563310cc95985b0138918208043d56 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:48:07,118 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:48:07,266 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a8f516-3bd1-4cab-a5cf-aeb231f4001f/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-19 07:48:07,278 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:48:07,279 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:48:07,326 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:48:07,327 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:48:07,327 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:48:07,329 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:48:07,335 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:48:07,336 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:48:07,337 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:48:07,337 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:48:07,340 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:48:07,340 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:48:07,341 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:48:07,341 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:48:07,342 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:48:07,342 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:48:07,343 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:48:07,343 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:48:07,344 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:48:07,345 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:48:07,345 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:48:07,346 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:48:07,347 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:48:07,347 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:48:07,348 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:48:07,348 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:48:07,349 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:48:07,350 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:48:07,350 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:48:07,351 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:48:07,351 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:48:07,351 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:48:07,352 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:48:07,352 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:48:07,352 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:48:07,353 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:48:07,353 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_c4a8f516-3bd1-4cab-a5cf-aeb231f4001f/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_c4a8f516-3bd1-4cab-a5cf-aeb231f4001f/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 -> e13ee54c81e57197c9e1d82387e2e01bbf563310cc95985b0138918208043d56 [2023-11-19 07:48:07,655 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:48:07,687 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:48:07,691 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:48:07,693 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:48:07,694 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:48:07,695 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a8f516-3bd1-4cab-a5cf-aeb231f4001f/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-62.i [2023-11-19 07:48:11,108 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:48:11,502 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:48:11,503 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a8f516-3bd1-4cab-a5cf-aeb231f4001f/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-62.i [2023-11-19 07:48:11,523 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a8f516-3bd1-4cab-a5cf-aeb231f4001f/bin/uautomizer-verify-uCwYo4JHxu/data/6f83fe34e/23f59a49b9bc4c65acd6b75f8bf146b0/FLAGe84e08792 [2023-11-19 07:48:11,548 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a8f516-3bd1-4cab-a5cf-aeb231f4001f/bin/uautomizer-verify-uCwYo4JHxu/data/6f83fe34e/23f59a49b9bc4c65acd6b75f8bf146b0 [2023-11-19 07:48:11,558 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:48:11,561 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:48:11,566 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:48:11,567 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:48:11,574 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:48:11,577 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:48:11" (1/1) ... [2023-11-19 07:48:11,583 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ac2f481 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:48:11, skipping insertion in model container [2023-11-19 07:48:11,583 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:48:11" (1/1) ... [2023-11-19 07:48:11,641 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:48:11,897 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_c4a8f516-3bd1-4cab-a5cf-aeb231f4001f/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-62.i[916,929] [2023-11-19 07:48:11,995 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:48:12,011 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:48:12,030 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_c4a8f516-3bd1-4cab-a5cf-aeb231f4001f/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-62.i[916,929] [2023-11-19 07:48:12,111 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:48:12,146 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:48:12,146 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:48:12 WrapperNode [2023-11-19 07:48:12,147 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:48:12,149 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:48:12,150 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:48:12,150 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:48:12,160 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:48:12" (1/1) ... [2023-11-19 07:48:12,195 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:48:12" (1/1) ... [2023-11-19 07:48:12,262 INFO L138 Inliner]: procedures = 26, calls = 111, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 287 [2023-11-19 07:48:12,263 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:48:12,264 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:48:12,264 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:48:12,264 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:48:12,282 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:48:12" (1/1) ... [2023-11-19 07:48:12,283 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:48:12" (1/1) ... [2023-11-19 07:48:12,307 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:48:12" (1/1) ... [2023-11-19 07:48:12,307 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:48:12" (1/1) ... [2023-11-19 07:48:12,341 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:48:12" (1/1) ... [2023-11-19 07:48:12,360 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:48:12" (1/1) ... [2023-11-19 07:48:12,366 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:48:12" (1/1) ... [2023-11-19 07:48:12,369 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:48:12" (1/1) ... [2023-11-19 07:48:12,382 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:48:12,384 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:48:12,384 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:48:12,384 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:48:12,385 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:48:12" (1/1) ... [2023-11-19 07:48:12,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:48:12,420 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a8f516-3bd1-4cab-a5cf-aeb231f4001f/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:48:12,443 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a8f516-3bd1-4cab-a5cf-aeb231f4001f/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:48:12,453 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a8f516-3bd1-4cab-a5cf-aeb231f4001f/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:48:12,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:48:12,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 07:48:12,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 07:48:12,492 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-19 07:48:12,492 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-19 07:48:12,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:48:12,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:48:12,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:48:12,642 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:48:12,646 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:48:13,154 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:48:13,166 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:48:13,167 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-19 07:48:13,172 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:48:13 BoogieIcfgContainer [2023-11-19 07:48:13,173 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:48:13,176 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:48:13,177 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:48:13,182 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:48:13,182 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:48:11" (1/3) ... [2023-11-19 07:48:13,184 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46919090 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:48:13, skipping insertion in model container [2023-11-19 07:48:13,184 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:48:12" (2/3) ... [2023-11-19 07:48:13,185 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46919090 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:48:13, skipping insertion in model container [2023-11-19 07:48:13,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:48:13" (3/3) ... [2023-11-19 07:48:13,187 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-62.i [2023-11-19 07:48:13,216 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:48:13,216 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 07:48:13,283 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:48:13,292 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;@6b6622eb, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:48:13,292 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-19 07:48:13,298 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 62 states have (on average 1.4193548387096775) internal successors, (88), 63 states have internal predecessors, (88), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-19 07:48:13,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-11-19 07:48:13,313 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:48:13,314 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:13,315 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:48:13,322 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:48:13,323 INFO L85 PathProgramCache]: Analyzing trace with hash -256564704, now seen corresponding path program 1 times [2023-11-19 07:48:13,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:48:13,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883486155] [2023-11-19 07:48:13,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:48:13,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:48:13,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:13,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:48:13,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:13,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:48:13,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:13,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:48:13,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:13,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:48:13,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:13,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:48:13,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:13,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:48:13,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:13,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:48:13,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:13,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:48:13,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:13,815 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-19 07:48:13,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:48:13,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883486155] [2023-11-19 07:48:13,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883486155] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:48:13,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:48:13,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:48:13,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228034310] [2023-11-19 07:48:13,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:48:13,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 07:48:13,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:48:13,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 07:48:13,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 07:48:13,879 INFO L87 Difference]: Start difference. First operand has 73 states, 62 states have (on average 1.4193548387096775) internal successors, (88), 63 states have internal predecessors, (88), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-19 07:48:13,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:48:13,923 INFO L93 Difference]: Finished difference Result 139 states and 210 transitions. [2023-11-19 07:48:13,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 07:48:13,927 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 73 [2023-11-19 07:48:13,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:48:13,937 INFO L225 Difference]: With dead ends: 139 [2023-11-19 07:48:13,937 INFO L226 Difference]: Without dead ends: 69 [2023-11-19 07:48:13,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 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:48:13,947 INFO L413 NwaCegarLoop]: 97 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, 97 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:48:13,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:48:13,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-11-19 07:48:14,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2023-11-19 07:48:14,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 59 states have (on average 1.3728813559322033) internal successors, (81), 59 states have internal predecessors, (81), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-19 07:48:14,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 97 transitions. [2023-11-19 07:48:14,029 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 97 transitions. Word has length 73 [2023-11-19 07:48:14,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:48:14,031 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 97 transitions. [2023-11-19 07:48:14,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-19 07:48:14,033 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 97 transitions. [2023-11-19 07:48:14,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-11-19 07:48:14,044 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:48:14,045 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:14,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:48:14,046 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:48:14,047 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:48:14,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1770871312, now seen corresponding path program 1 times [2023-11-19 07:48:14,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:48:14,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655223360] [2023-11-19 07:48:14,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:48:14,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:48:14,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:14,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:48:14,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:14,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:48:14,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:14,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:48:14,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:14,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:48:14,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:14,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:48:14,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:14,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:48:14,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:14,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:48:14,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:14,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:48:14,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:14,590 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-19 07:48:14,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:48:14,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655223360] [2023-11-19 07:48:14,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655223360] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:48:14,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:48:14,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:48:14,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62731510] [2023-11-19 07:48:14,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:48:14,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:48:14,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:48:14,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:48:14,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:48:14,599 INFO L87 Difference]: Start difference. First operand 69 states and 97 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-19 07:48:14,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:48:14,672 INFO L93 Difference]: Finished difference Result 143 states and 202 transitions. [2023-11-19 07:48:14,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:48:14,673 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 73 [2023-11-19 07:48:14,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:48:14,675 INFO L225 Difference]: With dead ends: 143 [2023-11-19 07:48:14,675 INFO L226 Difference]: Without dead ends: 77 [2023-11-19 07:48:14,676 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 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:48:14,678 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 12 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 275 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:48:14,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 275 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:48:14,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-11-19 07:48:14,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 71. [2023-11-19 07:48:14,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 61 states have (on average 1.360655737704918) internal successors, (83), 61 states have internal predecessors, (83), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-19 07:48:14,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 99 transitions. [2023-11-19 07:48:14,691 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 99 transitions. Word has length 73 [2023-11-19 07:48:14,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:48:14,693 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 99 transitions. [2023-11-19 07:48:14,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-19 07:48:14,694 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 99 transitions. [2023-11-19 07:48:14,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-11-19 07:48:14,696 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:48:14,696 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:14,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:48:14,697 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:48:14,698 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:48:14,698 INFO L85 PathProgramCache]: Analyzing trace with hash -749088622, now seen corresponding path program 1 times [2023-11-19 07:48:14,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:48:14,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479516681] [2023-11-19 07:48:14,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:48:14,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:48:14,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:14,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:48:14,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:14,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:48:14,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:14,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:48:14,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:14,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:48:14,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:14,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:48:14,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:14,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:48:14,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:14,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:48:14,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:14,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:48:14,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:14,920 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-19 07:48:14,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:48:14,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479516681] [2023-11-19 07:48:14,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479516681] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:48:14,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:48:14,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:48:14,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377510618] [2023-11-19 07:48:14,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:48:14,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:48:14,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:48:14,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:48:14,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:48:14,924 INFO L87 Difference]: Start difference. First operand 71 states and 99 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-19 07:48:14,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:48:14,964 INFO L93 Difference]: Finished difference Result 143 states and 200 transitions. [2023-11-19 07:48:14,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:48:14,965 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 73 [2023-11-19 07:48:14,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:48:14,967 INFO L225 Difference]: With dead ends: 143 [2023-11-19 07:48:14,967 INFO L226 Difference]: Without dead ends: 75 [2023-11-19 07:48:14,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 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:48:14,971 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 3 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 275 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:48:14,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 275 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:48:14,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-11-19 07:48:14,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2023-11-19 07:48:14,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 63 states have (on average 1.3492063492063493) internal successors, (85), 63 states have internal predecessors, (85), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-19 07:48:14,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 101 transitions. [2023-11-19 07:48:14,983 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 101 transitions. Word has length 73 [2023-11-19 07:48:14,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:48:14,984 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 101 transitions. [2023-11-19 07:48:14,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-19 07:48:14,985 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 101 transitions. [2023-11-19 07:48:14,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-11-19 07:48:14,987 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:48:14,987 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:14,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:48:14,988 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:48:14,988 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:48:14,988 INFO L85 PathProgramCache]: Analyzing trace with hash -747241580, now seen corresponding path program 1 times [2023-11-19 07:48:14,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:48:14,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913694671] [2023-11-19 07:48:14,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:48:14,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:48:15,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:15,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:48:15,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:15,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:48:15,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:15,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:48:15,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:15,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:48:15,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:15,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:48:15,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:15,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:48:15,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:15,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:48:15,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:15,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:48:15,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:15,525 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-19 07:48:15,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:48:15,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913694671] [2023-11-19 07:48:15,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913694671] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:48:15,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:48:15,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:48:15,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628913193] [2023-11-19 07:48:15,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:48:15,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:48:15,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:48:15,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:48:15,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:48:15,530 INFO L87 Difference]: Start difference. First operand 73 states and 101 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-19 07:48:15,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:48:15,774 INFO L93 Difference]: Finished difference Result 181 states and 250 transitions. [2023-11-19 07:48:15,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:48:15,775 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 73 [2023-11-19 07:48:15,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:48:15,777 INFO L225 Difference]: With dead ends: 181 [2023-11-19 07:48:15,777 INFO L226 Difference]: Without dead ends: 111 [2023-11-19 07:48:15,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:48:15,780 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 126 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 07:48:15,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 172 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 07:48:15,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-11-19 07:48:15,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 75. [2023-11-19 07:48:15,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 65 states have (on average 1.3384615384615384) internal successors, (87), 65 states have internal predecessors, (87), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-19 07:48:15,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 103 transitions. [2023-11-19 07:48:15,793 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 103 transitions. Word has length 73 [2023-11-19 07:48:15,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:48:15,794 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 103 transitions. [2023-11-19 07:48:15,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-19 07:48:15,795 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 103 transitions. [2023-11-19 07:48:15,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-11-19 07:48:15,796 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:48:15,797 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:15,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:48:15,797 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:48:15,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:48:15,798 INFO L85 PathProgramCache]: Analyzing trace with hash -991247921, now seen corresponding path program 1 times [2023-11-19 07:48:15,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:48:15,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914527247] [2023-11-19 07:48:15,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:48:15,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:48:15,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:16,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:48:16,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:16,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:48:16,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:16,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:48:16,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:16,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:48:16,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:16,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:48:16,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:16,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:48:16,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:16,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:48:16,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:16,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:48:16,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:16,277 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-19 07:48:16,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:48:16,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914527247] [2023-11-19 07:48:16,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914527247] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:48:16,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:48:16,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-19 07:48:16,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869344063] [2023-11-19 07:48:16,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:48:16,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 07:48:16,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:48:16,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 07:48:16,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:48:16,281 INFO L87 Difference]: Start difference. First operand 75 states and 103 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-19 07:48:16,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:48:16,657 INFO L93 Difference]: Finished difference Result 215 states and 296 transitions. [2023-11-19 07:48:16,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-19 07:48:16,657 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 75 [2023-11-19 07:48:16,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:48:16,659 INFO L225 Difference]: With dead ends: 215 [2023-11-19 07:48:16,659 INFO L226 Difference]: Without dead ends: 143 [2023-11-19 07:48:16,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2023-11-19 07:48:16,662 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 344 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:48:16,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 316 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:48:16,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2023-11-19 07:48:16,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 85. [2023-11-19 07:48:16,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 75 states have (on average 1.3466666666666667) internal successors, (101), 75 states have internal predecessors, (101), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-19 07:48:16,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 117 transitions. [2023-11-19 07:48:16,674 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 117 transitions. Word has length 75 [2023-11-19 07:48:16,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:48:16,675 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 117 transitions. [2023-11-19 07:48:16,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-19 07:48:16,675 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 117 transitions. [2023-11-19 07:48:16,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-11-19 07:48:16,677 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:48:16,677 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:16,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 07:48:16,678 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:48:16,678 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:48:16,679 INFO L85 PathProgramCache]: Analyzing trace with hash -387496087, now seen corresponding path program 1 times [2023-11-19 07:48:16,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:48:16,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824564311] [2023-11-19 07:48:16,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:48:16,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:48:16,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:17,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:48:17,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:17,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:48:17,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:17,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:48:17,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:17,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:48:17,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:17,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:48:17,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:17,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:48:17,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:17,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:48:17,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:17,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:48:17,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:17,209 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-19 07:48:17,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:48:17,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824564311] [2023-11-19 07:48:17,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824564311] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:48:17,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:48:17,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 07:48:17,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501679899] [2023-11-19 07:48:17,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:48:17,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:48:17,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:48:17,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:48:17,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:48:17,212 INFO L87 Difference]: Start difference. First operand 85 states and 117 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-19 07:48:17,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:48:17,402 INFO L93 Difference]: Finished difference Result 169 states and 233 transitions. [2023-11-19 07:48:17,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:48:17,402 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 75 [2023-11-19 07:48:17,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:48:17,404 INFO L225 Difference]: With dead ends: 169 [2023-11-19 07:48:17,404 INFO L226 Difference]: Without dead ends: 87 [2023-11-19 07:48:17,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:48:17,410 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 181 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 07:48:17,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 115 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 07:48:17,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-11-19 07:48:17,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2023-11-19 07:48:17,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 73 states have (on average 1.3424657534246576) internal successors, (98), 73 states have internal predecessors, (98), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-19 07:48:17,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 114 transitions. [2023-11-19 07:48:17,437 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 114 transitions. Word has length 75 [2023-11-19 07:48:17,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:48:17,438 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 114 transitions. [2023-11-19 07:48:17,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-19 07:48:17,438 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 114 transitions. [2023-11-19 07:48:17,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-11-19 07:48:17,444 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:48:17,445 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:17,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 07:48:17,445 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:48:17,446 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:48:17,446 INFO L85 PathProgramCache]: Analyzing trace with hash 184374234, now seen corresponding path program 1 times [2023-11-19 07:48:17,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:48:17,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190021933] [2023-11-19 07:48:17,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:48:17,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:48:17,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:17,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:48:17,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:17,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:48:17,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:17,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:48:17,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:17,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:48:17,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:17,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:48:17,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:17,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:48:17,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:17,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:48:17,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:17,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:48:17,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:17,658 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-19 07:48:17,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:48:17,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190021933] [2023-11-19 07:48:17,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190021933] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:48:17,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:48:17,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:48:17,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122913638] [2023-11-19 07:48:17,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:48:17,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:48:17,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:48:17,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:48:17,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:48:17,665 INFO L87 Difference]: Start difference. First operand 83 states and 114 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-19 07:48:17,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:48:17,729 INFO L93 Difference]: Finished difference Result 179 states and 247 transitions. [2023-11-19 07:48:17,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:48:17,730 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 77 [2023-11-19 07:48:17,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:48:17,732 INFO L225 Difference]: With dead ends: 179 [2023-11-19 07:48:17,732 INFO L226 Difference]: Without dead ends: 99 [2023-11-19 07:48:17,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 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:48:17,736 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 60 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 350 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:48:17,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 350 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:48:17,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-11-19 07:48:17,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 86. [2023-11-19 07:48:17,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 76 states have (on average 1.3289473684210527) internal successors, (101), 76 states have internal predecessors, (101), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-19 07:48:17,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 117 transitions. [2023-11-19 07:48:17,759 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 117 transitions. Word has length 77 [2023-11-19 07:48:17,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:48:17,760 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 117 transitions. [2023-11-19 07:48:17,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-19 07:48:17,762 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 117 transitions. [2023-11-19 07:48:17,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-11-19 07:48:17,765 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:48:17,765 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:17,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 07:48:17,766 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:48:17,766 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:48:17,767 INFO L85 PathProgramCache]: Analyzing trace with hash 376483499, now seen corresponding path program 1 times [2023-11-19 07:48:17,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:48:17,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759037482] [2023-11-19 07:48:17,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:48:17,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:48:17,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:18,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:48:18,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:18,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:48:18,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:18,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:48:18,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:18,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:48:18,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:18,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:48:18,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:18,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:48:18,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:18,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:48:18,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:18,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:48:18,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:18,709 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-19 07:48:18,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:48:18,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759037482] [2023-11-19 07:48:18,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759037482] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:48:18,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:48:18,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-19 07:48:18,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095149250] [2023-11-19 07:48:18,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:48:18,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-19 07:48:18,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:48:18,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-19 07:48:18,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-19 07:48:18,712 INFO L87 Difference]: Start difference. First operand 86 states and 117 transitions. Second operand has 9 states, 8 states have (on average 5.0) internal successors, (40), 9 states have internal predecessors, (40), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-19 07:48:19,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:48:19,247 INFO L93 Difference]: Finished difference Result 237 states and 320 transitions. [2023-11-19 07:48:19,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 07:48:19,248 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.0) internal successors, (40), 9 states have internal predecessors, (40), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 77 [2023-11-19 07:48:19,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:48:19,252 INFO L225 Difference]: With dead ends: 237 [2023-11-19 07:48:19,252 INFO L226 Difference]: Without dead ends: 154 [2023-11-19 07:48:19,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2023-11-19 07:48:19,255 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 407 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-19 07:48:19,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 230 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-19 07:48:19,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2023-11-19 07:48:19,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 89. [2023-11-19 07:48:19,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 79 states have internal predecessors, (103), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-19 07:48:19,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 119 transitions. [2023-11-19 07:48:19,273 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 119 transitions. Word has length 77 [2023-11-19 07:48:19,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:48:19,274 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 119 transitions. [2023-11-19 07:48:19,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.0) internal successors, (40), 9 states have internal predecessors, (40), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-19 07:48:19,275 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 119 transitions. [2023-11-19 07:48:19,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-11-19 07:48:19,276 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:48:19,276 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:19,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 07:48:19,277 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:48:19,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:48:19,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1126787172, now seen corresponding path program 1 times [2023-11-19 07:48:19,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:48:19,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479092589] [2023-11-19 07:48:19,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:48:19,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:48:19,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:19,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:48:19,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:19,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:48:19,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:19,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:48:19,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:19,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:48:19,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:19,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:48:19,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:19,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:48:19,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:19,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:48:19,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:19,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:48:19,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:19,757 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-19 07:48:19,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:48:19,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479092589] [2023-11-19 07:48:19,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479092589] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:48:19,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:48:19,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-19 07:48:19,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811096650] [2023-11-19 07:48:19,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:48:19,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-19 07:48:19,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:48:19,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-19 07:48:19,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-19 07:48:19,761 INFO L87 Difference]: Start difference. First operand 89 states and 119 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-19 07:48:20,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:48:20,176 INFO L93 Difference]: Finished difference Result 211 states and 281 transitions. [2023-11-19 07:48:20,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-19 07:48:20,176 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 77 [2023-11-19 07:48:20,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:48:20,178 INFO L225 Difference]: With dead ends: 211 [2023-11-19 07:48:20,178 INFO L226 Difference]: Without dead ends: 125 [2023-11-19 07:48:20,179 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2023-11-19 07:48:20,181 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 198 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:48:20,181 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 327 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:48:20,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-11-19 07:48:20,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 86. [2023-11-19 07:48:20,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 76 states have (on average 1.3157894736842106) internal successors, (100), 76 states have internal predecessors, (100), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-19 07:48:20,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 116 transitions. [2023-11-19 07:48:20,192 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 116 transitions. Word has length 77 [2023-11-19 07:48:20,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:48:20,193 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 116 transitions. [2023-11-19 07:48:20,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-19 07:48:20,193 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 116 transitions. [2023-11-19 07:48:20,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-11-19 07:48:20,194 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:48:20,195 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:20,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 07:48:20,195 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:48:20,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:48:20,196 INFO L85 PathProgramCache]: Analyzing trace with hash -736098379, now seen corresponding path program 1 times [2023-11-19 07:48:20,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:48:20,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152930768] [2023-11-19 07:48:20,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:48:20,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:48:20,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:21,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:48:21,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:21,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:48:21,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:21,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:48:21,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:21,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:48:21,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:21,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:48:21,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:21,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:48:21,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:21,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:48:21,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:21,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:48:21,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:21,254 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-19 07:48:21,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:48:21,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152930768] [2023-11-19 07:48:21,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152930768] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:48:21,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:48:21,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-19 07:48:21,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165506676] [2023-11-19 07:48:21,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:48:21,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-19 07:48:21,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:48:21,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-19 07:48:21,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-11-19 07:48:21,258 INFO L87 Difference]: Start difference. First operand 86 states and 116 transitions. Second operand has 9 states, 8 states have (on average 5.0) internal successors, (40), 9 states have internal predecessors, (40), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-19 07:48:21,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:48:21,738 INFO L93 Difference]: Finished difference Result 202 states and 271 transitions. [2023-11-19 07:48:21,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:48:21,739 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.0) internal successors, (40), 9 states have internal predecessors, (40), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 77 [2023-11-19 07:48:21,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:48:21,740 INFO L225 Difference]: With dead ends: 202 [2023-11-19 07:48:21,740 INFO L226 Difference]: Without dead ends: 119 [2023-11-19 07:48:21,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2023-11-19 07:48:21,741 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 208 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-19 07:48:21,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 253 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-19 07:48:21,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-11-19 07:48:21,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 86. [2023-11-19 07:48:21,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 76 states have (on average 1.3026315789473684) internal successors, (99), 76 states have internal predecessors, (99), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-19 07:48:21,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 115 transitions. [2023-11-19 07:48:21,753 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 115 transitions. Word has length 77 [2023-11-19 07:48:21,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:48:21,753 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 115 transitions. [2023-11-19 07:48:21,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.0) internal successors, (40), 9 states have internal predecessors, (40), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-19 07:48:21,754 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 115 transitions. [2023-11-19 07:48:21,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-11-19 07:48:21,755 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:48:21,755 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:21,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 07:48:21,756 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:48:21,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:48:21,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1071179512, now seen corresponding path program 1 times [2023-11-19 07:48:21,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:48:21,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942526364] [2023-11-19 07:48:21,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:48:21,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:48:21,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:21,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:48:21,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:21,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:48:21,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:21,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:48:21,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:21,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:48:21,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:21,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:48:21,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:21,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:48:21,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:21,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:48:21,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:21,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:48:21,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:21,956 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-19 07:48:21,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:48:21,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942526364] [2023-11-19 07:48:21,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942526364] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:48:21,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:48:21,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:48:21,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971977432] [2023-11-19 07:48:21,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:48:21,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:48:21,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:48:21,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:48:21,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:48:21,965 INFO L87 Difference]: Start difference. First operand 86 states and 115 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-19 07:48:22,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:48:22,062 INFO L93 Difference]: Finished difference Result 199 states and 268 transitions. [2023-11-19 07:48:22,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-19 07:48:22,063 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 79 [2023-11-19 07:48:22,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:48:22,067 INFO L225 Difference]: With dead ends: 199 [2023-11-19 07:48:22,067 INFO L226 Difference]: Without dead ends: 116 [2023-11-19 07:48:22,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-11-19 07:48:22,068 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 80 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:48:22,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 448 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:48:22,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-11-19 07:48:22,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 87. [2023-11-19 07:48:22,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 77 states have (on average 1.2987012987012987) internal successors, (100), 77 states have internal predecessors, (100), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-19 07:48:22,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 116 transitions. [2023-11-19 07:48:22,081 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 116 transitions. Word has length 79 [2023-11-19 07:48:22,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:48:22,082 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 116 transitions. [2023-11-19 07:48:22,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-19 07:48:22,082 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 116 transitions. [2023-11-19 07:48:22,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-11-19 07:48:22,083 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:48:22,084 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:22,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 07:48:22,084 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:48:22,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:48:22,085 INFO L85 PathProgramCache]: Analyzing trace with hash 818027873, now seen corresponding path program 1 times [2023-11-19 07:48:22,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:48:22,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629661681] [2023-11-19 07:48:22,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:48:22,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:48:22,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:23,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:48:23,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:23,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:48:23,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:23,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:48:23,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:23,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:48:23,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:23,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:48:23,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:23,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:48:23,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:23,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:48:23,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:23,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:48:23,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:23,668 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-11-19 07:48:23,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:48:23,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629661681] [2023-11-19 07:48:23,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629661681] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:48:23,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028167948] [2023-11-19 07:48:23,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:48:23,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:48:23,669 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a8f516-3bd1-4cab-a5cf-aeb231f4001f/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:48:23,673 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a8f516-3bd1-4cab-a5cf-aeb231f4001f/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:48:23,710 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a8f516-3bd1-4cab-a5cf-aeb231f4001f/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 07:48:23,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:23,876 INFO L262 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 34 conjunts are in the unsatisfiable core [2023-11-19 07:48:23,889 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:48:24,248 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:48:24,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:48:24,559 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 23 treesize of output 11 [2023-11-19 07:48:25,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:48:25,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:48:25,047 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 23 treesize of output 21 [2023-11-19 07:48:25,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:48:25,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-19 07:48:25,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:48:25,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:48:25,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 137 [2023-11-19 07:48:25,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 43 [2023-11-19 07:48:25,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:48:25,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:48:25,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 129 [2023-11-19 07:48:25,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 17 [2023-11-19 07:48:26,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:48:26,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:48:26,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 279 treesize of output 261 [2023-11-19 07:48:26,146 INFO L349 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2023-11-19 07:48:26,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 155 treesize of output 170 [2023-11-19 07:48:26,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 154 [2023-11-19 07:48:26,212 INFO L349 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2023-11-19 07:48:26,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 143 treesize of output 158 [2023-11-19 07:48:26,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 142 [2023-11-19 07:48:26,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-19 07:48:26,462 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:48:26,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2023-11-19 07:48:26,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 81 [2023-11-19 07:48:26,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 treesize of output 7 [2023-11-19 07:48:26,741 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:48:26,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 91 [2023-11-19 07:48:26,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 treesize of output 7 [2023-11-19 07:48:26,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:48:26,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:48:26,893 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:48:26,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 19 [2023-11-19 07:48:26,934 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 81 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-11-19 07:48:26,934 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:48:28,764 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_~#signed_long_int_Array_0~0.base|)) (.cse4 (+ 4 |c_~#signed_long_int_Array_0~0.offset|))) (let ((.cse6 (+ 2 |c_~#signed_char_Array_0~0.offset|)) (.cse7 (+ |c_~#signed_char_Array_0~0.offset| 1)) (.cse9 (+ 8 |c_~#signed_long_int_Array_0~0.offset|)) (.cse10 (select .cse8 .cse4)) (.cse12 (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|))) (and (forall ((v_z_3 Int)) (or (< 65535 v_z_3) (< v_z_3 0) (forall ((|~#unsigned_char_Array_0~0.offset| Int)) (let ((.cse11 (mod (select .cse12 |~#unsigned_char_Array_0~0.offset|) 256))) (let ((.cse0 (+ (mod (+ .cse10 (* .cse11 65535)) 65536) v_z_3))) (or (< 32767 .cse0) (forall ((v_y_3 Int) (|~#signed_short_int_Array_0~0.offset| Int) (v_ArrVal_245 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| (store .cse8 .cse9 (+ .cse10 (* v_y_3 (- 65536)) (* v_z_3 (- 65535)) (* (- 1) .cse11)))))) (let ((.cse1 (store (store (select (store .cse5 |c_~#signed_short_int_Array_0~0.base| (store (select .cse5 |c_~#signed_short_int_Array_0~0.base|) |~#signed_short_int_Array_0~0.offset| .cse0)) |c_~#signed_char_Array_0~0.base|) .cse6 14) .cse7 4))) (let ((.cse2 (select (store (store .cse5 |c_~#signed_short_int_Array_0~0.base| v_ArrVal_245) |c_~#signed_char_Array_0~0.base| .cse1) |c_~#signed_long_int_Array_0~0.base|))) (let ((.cse3 (select .cse2 .cse4))) (< (select (select (store (store (store |c_#memory_int| |c_~#signed_short_int_Array_0~0.base| v_ArrVal_245) |c_~#signed_char_Array_0~0.base| .cse1) |c_~#signed_long_int_Array_0~0.base| (store .cse2 |c_~#signed_long_int_Array_0~0.offset| .cse3)) |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|) .cse3)))))))))))) (forall ((v_z_1 Int)) (or (< v_z_1 0) (forall ((|~#unsigned_char_Array_0~0.offset| Int)) (let ((.cse19 (mod (select .cse12 |~#unsigned_char_Array_0~0.offset|) 256))) (let ((.cse18 (mod (+ .cse10 (* .cse19 65535)) 65536))) (let ((.cse13 (+ .cse18 v_z_1))) (or (< 65535 .cse13) (forall ((|~#signed_short_int_Array_0~0.offset| Int) (v_y_1 Int) (v_ArrVal_245 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| (store .cse8 .cse9 (+ .cse10 (* v_z_1 (- 65535)) (* (- 1) .cse19) (* v_y_1 (- 65536))))))) (let ((.cse14 (store (store (select (store .cse17 |c_~#signed_short_int_Array_0~0.base| (store (select .cse17 |c_~#signed_short_int_Array_0~0.base|) |~#signed_short_int_Array_0~0.offset| (+ .cse18 v_z_1 (- 65536)))) |c_~#signed_char_Array_0~0.base|) .cse6 14) .cse7 4))) (let ((.cse15 (select (store (store .cse17 |c_~#signed_short_int_Array_0~0.base| v_ArrVal_245) |c_~#signed_char_Array_0~0.base| .cse14) |c_~#signed_long_int_Array_0~0.base|))) (let ((.cse16 (select .cse15 .cse4))) (< (select (select (store (store (store |c_#memory_int| |c_~#signed_short_int_Array_0~0.base| v_ArrVal_245) |c_~#signed_char_Array_0~0.base| .cse14) |c_~#signed_long_int_Array_0~0.base| (store .cse15 |c_~#signed_long_int_Array_0~0.offset| .cse16)) |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|) .cse16)))))) (< .cse13 32768)))))) (< 65535 v_z_1))) (forall ((v_z_3 Int)) (or (< 65535 v_z_3) (< v_z_3 0) (forall ((v_y_3 Int) (|~#signed_short_int_Array_0~0.offset| Int) (|~#unsigned_char_Array_0~0.offset| Int) (v_ArrVal_245 (Array Int Int))) (let ((.cse32 (mod (select .cse12 |~#unsigned_char_Array_0~0.offset|) 256))) (let ((.cse26 (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| (store .cse8 .cse9 (+ .cse10 (* v_y_3 (- 65536)) (* v_z_3 (- 65535)) (* (- 1) .cse32))))) (.cse31 (mod (+ .cse10 (* .cse32 65535)) 65536))) (let ((.cse20 (+ .cse31 v_z_3)) (.cse21 (store |c_#memory_int| |c_~#signed_short_int_Array_0~0.base| v_ArrVal_245)) (.cse25 (store .cse26 |c_~#signed_short_int_Array_0~0.base| v_ArrVal_245)) (.cse27 (select .cse26 |c_~#signed_short_int_Array_0~0.base|))) (or (< 32767 .cse20) (let ((.cse22 (store (store (select (store .cse26 |c_~#signed_short_int_Array_0~0.base| (store .cse27 |~#signed_short_int_Array_0~0.offset| .cse20)) |c_~#signed_char_Array_0~0.base|) .cse6 14) .cse7 4))) (let ((.cse23 (select (store .cse25 |c_~#signed_char_Array_0~0.base| .cse22) |c_~#signed_long_int_Array_0~0.base|))) (let ((.cse24 (select .cse23 .cse4))) (< (select (select (store (store .cse21 |c_~#signed_char_Array_0~0.base| .cse22) |c_~#signed_long_int_Array_0~0.base| (store .cse23 |c_~#signed_long_int_Array_0~0.offset| .cse24)) |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|) .cse24)))) (let ((.cse28 (store (store (select (store .cse26 |c_~#signed_short_int_Array_0~0.base| (store .cse27 |~#signed_short_int_Array_0~0.offset| (+ .cse31 v_z_3 (- 65536)))) |c_~#signed_char_Array_0~0.base|) .cse6 14) .cse7 4))) (let ((.cse29 (select (store .cse25 |c_~#signed_char_Array_0~0.base| .cse28) |c_~#signed_long_int_Array_0~0.base|))) (let ((.cse30 (select .cse29 .cse4))) (< (select (select (store (store .cse21 |c_~#signed_char_Array_0~0.base| .cse28) |c_~#signed_long_int_Array_0~0.base| (store .cse29 |c_~#signed_long_int_Array_0~0.offset| .cse30)) |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|) .cse30))))))))))) (forall ((v_z_1 Int)) (or (forall ((|~#signed_short_int_Array_0~0.offset| Int) (v_y_1 Int) (|~#unsigned_char_Array_0~0.offset| Int) (v_ArrVal_245 (Array Int Int))) (let ((.cse45 (mod (select .cse12 |~#unsigned_char_Array_0~0.offset|) 256))) (let ((.cse40 (mod (+ .cse10 (* .cse45 65535)) 65536)) (.cse38 (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| (store .cse8 .cse9 (+ .cse10 (* v_z_1 (- 65535)) (* (- 1) .cse45) (* v_y_1 (- 65536))))))) (let ((.cse33 (store |c_#memory_int| |c_~#signed_short_int_Array_0~0.base| v_ArrVal_245)) (.cse37 (store .cse38 |c_~#signed_short_int_Array_0~0.base| v_ArrVal_245)) (.cse39 (select .cse38 |c_~#signed_short_int_Array_0~0.base|)) (.cse44 (+ .cse40 v_z_1))) (or (let ((.cse34 (store (store (select (store .cse38 |c_~#signed_short_int_Array_0~0.base| (store .cse39 |~#signed_short_int_Array_0~0.offset| (+ .cse40 v_z_1 (- 65536)))) |c_~#signed_char_Array_0~0.base|) .cse6 14) .cse7 4))) (let ((.cse35 (select (store .cse37 |c_~#signed_char_Array_0~0.base| .cse34) |c_~#signed_long_int_Array_0~0.base|))) (let ((.cse36 (select .cse35 .cse4))) (< (select (select (store (store .cse33 |c_~#signed_char_Array_0~0.base| .cse34) |c_~#signed_long_int_Array_0~0.base| (store .cse35 |c_~#signed_long_int_Array_0~0.offset| .cse36)) |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|) .cse36)))) (let ((.cse41 (store (store (select (store .cse38 |c_~#signed_short_int_Array_0~0.base| (store .cse39 |~#signed_short_int_Array_0~0.offset| (+ .cse40 (- 131072) v_z_1))) |c_~#signed_char_Array_0~0.base|) .cse6 14) .cse7 4))) (let ((.cse42 (select (store .cse37 |c_~#signed_char_Array_0~0.base| .cse41) |c_~#signed_long_int_Array_0~0.base|))) (let ((.cse43 (select .cse42 .cse4))) (< (select (select (store (store .cse33 |c_~#signed_char_Array_0~0.base| .cse41) |c_~#signed_long_int_Array_0~0.base| (store .cse42 |c_~#signed_long_int_Array_0~0.offset| .cse43)) |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|) .cse43)))) (< 65535 .cse44) (< .cse44 32768)))))) (< v_z_1 0) (< 65535 v_z_1))) (forall ((v_z_1 Int)) (or (< v_z_1 0) (forall ((|~#unsigned_char_Array_0~0.offset| Int)) (let ((.cse51 (mod (select .cse12 |~#unsigned_char_Array_0~0.offset|) 256))) (let ((.cse46 (mod (+ .cse10 (* .cse51 65535)) 65536))) (or (< (+ .cse46 v_z_1) 98304) (forall ((|~#signed_short_int_Array_0~0.offset| Int) (v_y_1 Int) (v_ArrVal_245 (Array Int Int))) (let ((.cse50 (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| (store .cse8 .cse9 (+ .cse10 (* v_z_1 (- 65535)) (* (- 1) .cse51) (* v_y_1 (- 65536))))))) (let ((.cse47 (store (store (select (store .cse50 |c_~#signed_short_int_Array_0~0.base| (store (select .cse50 |c_~#signed_short_int_Array_0~0.base|) |~#signed_short_int_Array_0~0.offset| (+ .cse46 (- 131072) v_z_1))) |c_~#signed_char_Array_0~0.base|) .cse6 14) .cse7 4))) (let ((.cse48 (select (store (store .cse50 |c_~#signed_short_int_Array_0~0.base| v_ArrVal_245) |c_~#signed_char_Array_0~0.base| .cse47) |c_~#signed_long_int_Array_0~0.base|))) (let ((.cse49 (select .cse48 .cse4))) (< (select (select (store (store (store |c_#memory_int| |c_~#signed_short_int_Array_0~0.base| v_ArrVal_245) |c_~#signed_char_Array_0~0.base| .cse47) |c_~#signed_long_int_Array_0~0.base| (store .cse48 |c_~#signed_long_int_Array_0~0.offset| .cse49)) |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|) .cse49)))))))))) (< 65535 v_z_1))) (forall ((v_z_3 Int)) (or (< 65535 v_z_3) (forall ((|~#unsigned_char_Array_0~0.offset| Int)) (let ((.cse58 (mod (select .cse12 |~#unsigned_char_Array_0~0.offset|) 256))) (let ((.cse57 (mod (+ .cse10 (* .cse58 65535)) 65536))) (let ((.cse52 (+ .cse57 v_z_3))) (or (< .cse52 65536) (forall ((v_y_3 Int) (|~#signed_short_int_Array_0~0.offset| Int) (v_ArrVal_245 (Array Int Int))) (let ((.cse56 (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| (store .cse8 .cse9 (+ .cse10 (* v_y_3 (- 65536)) (* v_z_3 (- 65535)) (* (- 1) .cse58)))))) (let ((.cse53 (store (store (select (store .cse56 |c_~#signed_short_int_Array_0~0.base| (store (select .cse56 |c_~#signed_short_int_Array_0~0.base|) |~#signed_short_int_Array_0~0.offset| (+ .cse57 v_z_3 (- 65536)))) |c_~#signed_char_Array_0~0.base|) .cse6 14) .cse7 4))) (let ((.cse54 (select (store (store .cse56 |c_~#signed_short_int_Array_0~0.base| v_ArrVal_245) |c_~#signed_char_Array_0~0.base| .cse53) |c_~#signed_long_int_Array_0~0.base|))) (let ((.cse55 (select .cse54 .cse4))) (< (select (select (store (store (store |c_#memory_int| |c_~#signed_short_int_Array_0~0.base| v_ArrVal_245) |c_~#signed_char_Array_0~0.base| .cse53) |c_~#signed_long_int_Array_0~0.base| (store .cse54 |c_~#signed_long_int_Array_0~0.offset| .cse55)) |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|) .cse55)))))) (< 98303 .cse52)))))) (< v_z_3 0))) (forall ((v_z_1 Int)) (or (< v_z_1 0) (< 65535 v_z_1) (forall ((|~#signed_short_int_Array_0~0.offset| Int) (v_y_1 Int) (|~#unsigned_char_Array_0~0.offset| Int) (v_ArrVal_245 (Array Int Int))) (let ((.cse70 (mod (select .cse12 |~#unsigned_char_Array_0~0.offset|) 256))) (let ((.cse64 (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| (store .cse8 .cse9 (+ .cse10 (* v_z_1 (- 65535)) (* (- 1) .cse70) (* v_y_1 (- 65536))))))) (let ((.cse59 (store |c_#memory_int| |c_~#signed_short_int_Array_0~0.base| v_ArrVal_245)) (.cse63 (store .cse64 |c_~#signed_short_int_Array_0~0.base| v_ArrVal_245)) (.cse65 (select .cse64 |c_~#signed_short_int_Array_0~0.base|)) (.cse66 (mod (+ .cse10 (* .cse70 65535)) 65536))) (or (let ((.cse60 (store (store (select (store .cse64 |c_~#signed_short_int_Array_0~0.base| (store .cse65 |~#signed_short_int_Array_0~0.offset| (+ .cse66 v_z_1 (- 65536)))) |c_~#signed_char_Array_0~0.base|) .cse6 14) .cse7 4))) (let ((.cse61 (select (store .cse63 |c_~#signed_char_Array_0~0.base| .cse60) |c_~#signed_long_int_Array_0~0.base|))) (let ((.cse62 (select .cse61 .cse4))) (< (select (select (store (store .cse59 |c_~#signed_char_Array_0~0.base| .cse60) |c_~#signed_long_int_Array_0~0.base| (store .cse61 |c_~#signed_long_int_Array_0~0.offset| .cse62)) |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|) .cse62)))) (let ((.cse67 (store (store (select (store .cse64 |c_~#signed_short_int_Array_0~0.base| (store .cse65 |~#signed_short_int_Array_0~0.offset| (+ .cse66 (- 131072) v_z_1))) |c_~#signed_char_Array_0~0.base|) .cse6 14) .cse7 4))) (let ((.cse68 (select (store .cse63 |c_~#signed_char_Array_0~0.base| .cse67) |c_~#signed_long_int_Array_0~0.base|))) (let ((.cse69 (select .cse68 .cse4))) (< (select (select (store (store .cse59 |c_~#signed_char_Array_0~0.base| .cse67) |c_~#signed_long_int_Array_0~0.base| (store .cse68 |c_~#signed_long_int_Array_0~0.offset| .cse69)) |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|) .cse69)))) (< (+ .cse66 v_z_1) 98304)))))))) (forall ((v_z_3 Int)) (or (< 65535 v_z_3) (forall ((v_y_3 Int) (|~#signed_short_int_Array_0~0.offset| Int) (|~#unsigned_char_Array_0~0.offset| Int) (v_ArrVal_245 (Array Int Int))) (let ((.cse83 (mod (select .cse12 |~#unsigned_char_Array_0~0.offset|) 256))) (let ((.cse77 (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| (store .cse8 .cse9 (+ .cse10 (* v_y_3 (- 65536)) (* v_z_3 (- 65535)) (* (- 1) .cse83))))) (.cse82 (mod (+ .cse10 (* .cse83 65535)) 65536))) (let ((.cse71 (+ .cse82 v_z_3)) (.cse72 (store |c_#memory_int| |c_~#signed_short_int_Array_0~0.base| v_ArrVal_245)) (.cse76 (store .cse77 |c_~#signed_short_int_Array_0~0.base| v_ArrVal_245)) (.cse78 (select .cse77 |c_~#signed_short_int_Array_0~0.base|))) (or (< .cse71 65536) (< 98303 .cse71) (let ((.cse73 (store (store (select (store .cse77 |c_~#signed_short_int_Array_0~0.base| (store .cse78 |~#signed_short_int_Array_0~0.offset| .cse71)) |c_~#signed_char_Array_0~0.base|) .cse6 14) .cse7 4))) (let ((.cse74 (select (store .cse76 |c_~#signed_char_Array_0~0.base| .cse73) |c_~#signed_long_int_Array_0~0.base|))) (let ((.cse75 (select .cse74 .cse4))) (< (select (select (store (store .cse72 |c_~#signed_char_Array_0~0.base| .cse73) |c_~#signed_long_int_Array_0~0.base| (store .cse74 |c_~#signed_long_int_Array_0~0.offset| .cse75)) |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|) .cse75)))) (let ((.cse79 (store (store (select (store .cse77 |c_~#signed_short_int_Array_0~0.base| (store .cse78 |~#signed_short_int_Array_0~0.offset| (+ .cse82 v_z_3 (- 65536)))) |c_~#signed_char_Array_0~0.base|) .cse6 14) .cse7 4))) (let ((.cse80 (select (store .cse76 |c_~#signed_char_Array_0~0.base| .cse79) |c_~#signed_long_int_Array_0~0.base|))) (let ((.cse81 (select .cse80 .cse4))) (< (select (select (store (store .cse72 |c_~#signed_char_Array_0~0.base| .cse79) |c_~#signed_long_int_Array_0~0.base| (store .cse80 |c_~#signed_long_int_Array_0~0.offset| .cse81)) |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|) .cse81))))))))) (< v_z_3 0)))))) is different from false [2023-11-19 07:48:30,781 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_~#signed_long_int_Array_0~0.base|)) (.cse4 (+ 4 |c_~#signed_long_int_Array_0~0.offset|))) (let ((.cse6 (+ 2 |c_~#signed_char_Array_0~0.offset|)) (.cse7 (+ |c_~#signed_char_Array_0~0.offset| 1)) (.cse9 (+ 8 |c_~#signed_long_int_Array_0~0.offset|)) (.cse10 (select .cse8 .cse4)) (.cse12 (select |c_#memory_int| |c_~#unsigned_char_Array_0~0.base|))) (and (forall ((v_z_3 Int)) (or (< 65535 v_z_3) (< v_z_3 0) (forall ((|~#unsigned_char_Array_0~0.offset| Int)) (let ((.cse11 (mod (select .cse12 |~#unsigned_char_Array_0~0.offset|) 256))) (let ((.cse0 (+ (mod (+ .cse10 (* .cse11 65535)) 65536) v_z_3))) (or (< 32767 .cse0) (forall ((v_y_3 Int) (|~#signed_short_int_Array_0~0.offset| Int) (v_ArrVal_245 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| (store .cse8 .cse9 (+ .cse10 (* v_y_3 (- 65536)) (* v_z_3 (- 65535)) (* (- 1) .cse11)))))) (let ((.cse1 (store (store (select (store .cse5 |c_~#signed_short_int_Array_0~0.base| (store (select .cse5 |c_~#signed_short_int_Array_0~0.base|) |~#signed_short_int_Array_0~0.offset| .cse0)) |c_~#signed_char_Array_0~0.base|) .cse6 14) .cse7 4))) (let ((.cse2 (select (store (store .cse5 |c_~#signed_short_int_Array_0~0.base| v_ArrVal_245) |c_~#signed_char_Array_0~0.base| .cse1) |c_~#signed_long_int_Array_0~0.base|))) (let ((.cse3 (select .cse2 .cse4))) (< (select (select (store (store (store |c_#memory_int| |c_~#signed_short_int_Array_0~0.base| v_ArrVal_245) |c_~#signed_char_Array_0~0.base| .cse1) |c_~#signed_long_int_Array_0~0.base| (store .cse2 |c_~#signed_long_int_Array_0~0.offset| .cse3)) |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|) .cse3)))))))))))) (forall ((v_z_1 Int)) (or (< v_z_1 0) (forall ((|~#unsigned_char_Array_0~0.offset| Int)) (let ((.cse19 (mod (select .cse12 |~#unsigned_char_Array_0~0.offset|) 256))) (let ((.cse18 (mod (+ .cse10 (* .cse19 65535)) 65536))) (let ((.cse13 (+ .cse18 v_z_1))) (or (< 65535 .cse13) (forall ((|~#signed_short_int_Array_0~0.offset| Int) (v_y_1 Int) (v_ArrVal_245 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| (store .cse8 .cse9 (+ .cse10 (* v_z_1 (- 65535)) (* (- 1) .cse19) (* v_y_1 (- 65536))))))) (let ((.cse14 (store (store (select (store .cse17 |c_~#signed_short_int_Array_0~0.base| (store (select .cse17 |c_~#signed_short_int_Array_0~0.base|) |~#signed_short_int_Array_0~0.offset| (+ .cse18 v_z_1 (- 65536)))) |c_~#signed_char_Array_0~0.base|) .cse6 14) .cse7 4))) (let ((.cse15 (select (store (store .cse17 |c_~#signed_short_int_Array_0~0.base| v_ArrVal_245) |c_~#signed_char_Array_0~0.base| .cse14) |c_~#signed_long_int_Array_0~0.base|))) (let ((.cse16 (select .cse15 .cse4))) (< (select (select (store (store (store |c_#memory_int| |c_~#signed_short_int_Array_0~0.base| v_ArrVal_245) |c_~#signed_char_Array_0~0.base| .cse14) |c_~#signed_long_int_Array_0~0.base| (store .cse15 |c_~#signed_long_int_Array_0~0.offset| .cse16)) |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|) .cse16)))))) (< .cse13 32768)))))) (< 65535 v_z_1))) (forall ((v_z_3 Int)) (or (< 65535 v_z_3) (< v_z_3 0) (forall ((v_y_3 Int) (|~#signed_short_int_Array_0~0.offset| Int) (|~#unsigned_char_Array_0~0.offset| Int) (v_ArrVal_245 (Array Int Int))) (let ((.cse32 (mod (select .cse12 |~#unsigned_char_Array_0~0.offset|) 256))) (let ((.cse26 (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| (store .cse8 .cse9 (+ .cse10 (* v_y_3 (- 65536)) (* v_z_3 (- 65535)) (* (- 1) .cse32))))) (.cse31 (mod (+ .cse10 (* .cse32 65535)) 65536))) (let ((.cse20 (+ .cse31 v_z_3)) (.cse21 (store |c_#memory_int| |c_~#signed_short_int_Array_0~0.base| v_ArrVal_245)) (.cse25 (store .cse26 |c_~#signed_short_int_Array_0~0.base| v_ArrVal_245)) (.cse27 (select .cse26 |c_~#signed_short_int_Array_0~0.base|))) (or (< 32767 .cse20) (let ((.cse22 (store (store (select (store .cse26 |c_~#signed_short_int_Array_0~0.base| (store .cse27 |~#signed_short_int_Array_0~0.offset| .cse20)) |c_~#signed_char_Array_0~0.base|) .cse6 14) .cse7 4))) (let ((.cse23 (select (store .cse25 |c_~#signed_char_Array_0~0.base| .cse22) |c_~#signed_long_int_Array_0~0.base|))) (let ((.cse24 (select .cse23 .cse4))) (< (select (select (store (store .cse21 |c_~#signed_char_Array_0~0.base| .cse22) |c_~#signed_long_int_Array_0~0.base| (store .cse23 |c_~#signed_long_int_Array_0~0.offset| .cse24)) |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|) .cse24)))) (let ((.cse28 (store (store (select (store .cse26 |c_~#signed_short_int_Array_0~0.base| (store .cse27 |~#signed_short_int_Array_0~0.offset| (+ .cse31 v_z_3 (- 65536)))) |c_~#signed_char_Array_0~0.base|) .cse6 14) .cse7 4))) (let ((.cse29 (select (store .cse25 |c_~#signed_char_Array_0~0.base| .cse28) |c_~#signed_long_int_Array_0~0.base|))) (let ((.cse30 (select .cse29 .cse4))) (< (select (select (store (store .cse21 |c_~#signed_char_Array_0~0.base| .cse28) |c_~#signed_long_int_Array_0~0.base| (store .cse29 |c_~#signed_long_int_Array_0~0.offset| .cse30)) |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|) .cse30))))))))))) (forall ((v_z_1 Int)) (or (forall ((|~#signed_short_int_Array_0~0.offset| Int) (v_y_1 Int) (|~#unsigned_char_Array_0~0.offset| Int) (v_ArrVal_245 (Array Int Int))) (let ((.cse45 (mod (select .cse12 |~#unsigned_char_Array_0~0.offset|) 256))) (let ((.cse40 (mod (+ .cse10 (* .cse45 65535)) 65536)) (.cse38 (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| (store .cse8 .cse9 (+ .cse10 (* v_z_1 (- 65535)) (* (- 1) .cse45) (* v_y_1 (- 65536))))))) (let ((.cse33 (store |c_#memory_int| |c_~#signed_short_int_Array_0~0.base| v_ArrVal_245)) (.cse37 (store .cse38 |c_~#signed_short_int_Array_0~0.base| v_ArrVal_245)) (.cse39 (select .cse38 |c_~#signed_short_int_Array_0~0.base|)) (.cse44 (+ .cse40 v_z_1))) (or (let ((.cse34 (store (store (select (store .cse38 |c_~#signed_short_int_Array_0~0.base| (store .cse39 |~#signed_short_int_Array_0~0.offset| (+ .cse40 v_z_1 (- 65536)))) |c_~#signed_char_Array_0~0.base|) .cse6 14) .cse7 4))) (let ((.cse35 (select (store .cse37 |c_~#signed_char_Array_0~0.base| .cse34) |c_~#signed_long_int_Array_0~0.base|))) (let ((.cse36 (select .cse35 .cse4))) (< (select (select (store (store .cse33 |c_~#signed_char_Array_0~0.base| .cse34) |c_~#signed_long_int_Array_0~0.base| (store .cse35 |c_~#signed_long_int_Array_0~0.offset| .cse36)) |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|) .cse36)))) (let ((.cse41 (store (store (select (store .cse38 |c_~#signed_short_int_Array_0~0.base| (store .cse39 |~#signed_short_int_Array_0~0.offset| (+ .cse40 (- 131072) v_z_1))) |c_~#signed_char_Array_0~0.base|) .cse6 14) .cse7 4))) (let ((.cse42 (select (store .cse37 |c_~#signed_char_Array_0~0.base| .cse41) |c_~#signed_long_int_Array_0~0.base|))) (let ((.cse43 (select .cse42 .cse4))) (< (select (select (store (store .cse33 |c_~#signed_char_Array_0~0.base| .cse41) |c_~#signed_long_int_Array_0~0.base| (store .cse42 |c_~#signed_long_int_Array_0~0.offset| .cse43)) |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|) .cse43)))) (< 65535 .cse44) (< .cse44 32768)))))) (< v_z_1 0) (< 65535 v_z_1))) (forall ((v_z_1 Int)) (or (< v_z_1 0) (forall ((|~#unsigned_char_Array_0~0.offset| Int)) (let ((.cse51 (mod (select .cse12 |~#unsigned_char_Array_0~0.offset|) 256))) (let ((.cse46 (mod (+ .cse10 (* .cse51 65535)) 65536))) (or (< (+ .cse46 v_z_1) 98304) (forall ((|~#signed_short_int_Array_0~0.offset| Int) (v_y_1 Int) (v_ArrVal_245 (Array Int Int))) (let ((.cse50 (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| (store .cse8 .cse9 (+ .cse10 (* v_z_1 (- 65535)) (* (- 1) .cse51) (* v_y_1 (- 65536))))))) (let ((.cse47 (store (store (select (store .cse50 |c_~#signed_short_int_Array_0~0.base| (store (select .cse50 |c_~#signed_short_int_Array_0~0.base|) |~#signed_short_int_Array_0~0.offset| (+ .cse46 (- 131072) v_z_1))) |c_~#signed_char_Array_0~0.base|) .cse6 14) .cse7 4))) (let ((.cse48 (select (store (store .cse50 |c_~#signed_short_int_Array_0~0.base| v_ArrVal_245) |c_~#signed_char_Array_0~0.base| .cse47) |c_~#signed_long_int_Array_0~0.base|))) (let ((.cse49 (select .cse48 .cse4))) (< (select (select (store (store (store |c_#memory_int| |c_~#signed_short_int_Array_0~0.base| v_ArrVal_245) |c_~#signed_char_Array_0~0.base| .cse47) |c_~#signed_long_int_Array_0~0.base| (store .cse48 |c_~#signed_long_int_Array_0~0.offset| .cse49)) |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|) .cse49)))))))))) (< 65535 v_z_1))) (forall ((v_z_3 Int)) (or (< 65535 v_z_3) (forall ((|~#unsigned_char_Array_0~0.offset| Int)) (let ((.cse58 (mod (select .cse12 |~#unsigned_char_Array_0~0.offset|) 256))) (let ((.cse57 (mod (+ .cse10 (* .cse58 65535)) 65536))) (let ((.cse52 (+ .cse57 v_z_3))) (or (< .cse52 65536) (forall ((v_y_3 Int) (|~#signed_short_int_Array_0~0.offset| Int) (v_ArrVal_245 (Array Int Int))) (let ((.cse56 (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| (store .cse8 .cse9 (+ .cse10 (* v_y_3 (- 65536)) (* v_z_3 (- 65535)) (* (- 1) .cse58)))))) (let ((.cse53 (store (store (select (store .cse56 |c_~#signed_short_int_Array_0~0.base| (store (select .cse56 |c_~#signed_short_int_Array_0~0.base|) |~#signed_short_int_Array_0~0.offset| (+ .cse57 v_z_3 (- 65536)))) |c_~#signed_char_Array_0~0.base|) .cse6 14) .cse7 4))) (let ((.cse54 (select (store (store .cse56 |c_~#signed_short_int_Array_0~0.base| v_ArrVal_245) |c_~#signed_char_Array_0~0.base| .cse53) |c_~#signed_long_int_Array_0~0.base|))) (let ((.cse55 (select .cse54 .cse4))) (< (select (select (store (store (store |c_#memory_int| |c_~#signed_short_int_Array_0~0.base| v_ArrVal_245) |c_~#signed_char_Array_0~0.base| .cse53) |c_~#signed_long_int_Array_0~0.base| (store .cse54 |c_~#signed_long_int_Array_0~0.offset| .cse55)) |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|) .cse55)))))) (< 98303 .cse52)))))) (< v_z_3 0))) (forall ((v_z_1 Int)) (or (< v_z_1 0) (< 65535 v_z_1) (forall ((|~#signed_short_int_Array_0~0.offset| Int) (v_y_1 Int) (|~#unsigned_char_Array_0~0.offset| Int) (v_ArrVal_245 (Array Int Int))) (let ((.cse70 (mod (select .cse12 |~#unsigned_char_Array_0~0.offset|) 256))) (let ((.cse64 (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| (store .cse8 .cse9 (+ .cse10 (* v_z_1 (- 65535)) (* (- 1) .cse70) (* v_y_1 (- 65536))))))) (let ((.cse59 (store |c_#memory_int| |c_~#signed_short_int_Array_0~0.base| v_ArrVal_245)) (.cse63 (store .cse64 |c_~#signed_short_int_Array_0~0.base| v_ArrVal_245)) (.cse65 (select .cse64 |c_~#signed_short_int_Array_0~0.base|)) (.cse66 (mod (+ .cse10 (* .cse70 65535)) 65536))) (or (let ((.cse60 (store (store (select (store .cse64 |c_~#signed_short_int_Array_0~0.base| (store .cse65 |~#signed_short_int_Array_0~0.offset| (+ .cse66 v_z_1 (- 65536)))) |c_~#signed_char_Array_0~0.base|) .cse6 14) .cse7 4))) (let ((.cse61 (select (store .cse63 |c_~#signed_char_Array_0~0.base| .cse60) |c_~#signed_long_int_Array_0~0.base|))) (let ((.cse62 (select .cse61 .cse4))) (< (select (select (store (store .cse59 |c_~#signed_char_Array_0~0.base| .cse60) |c_~#signed_long_int_Array_0~0.base| (store .cse61 |c_~#signed_long_int_Array_0~0.offset| .cse62)) |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|) .cse62)))) (let ((.cse67 (store (store (select (store .cse64 |c_~#signed_short_int_Array_0~0.base| (store .cse65 |~#signed_short_int_Array_0~0.offset| (+ .cse66 (- 131072) v_z_1))) |c_~#signed_char_Array_0~0.base|) .cse6 14) .cse7 4))) (let ((.cse68 (select (store .cse63 |c_~#signed_char_Array_0~0.base| .cse67) |c_~#signed_long_int_Array_0~0.base|))) (let ((.cse69 (select .cse68 .cse4))) (< (select (select (store (store .cse59 |c_~#signed_char_Array_0~0.base| .cse67) |c_~#signed_long_int_Array_0~0.base| (store .cse68 |c_~#signed_long_int_Array_0~0.offset| .cse69)) |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|) .cse69)))) (< (+ .cse66 v_z_1) 98304)))))))) (forall ((v_z_3 Int)) (or (< 65535 v_z_3) (forall ((v_y_3 Int) (|~#signed_short_int_Array_0~0.offset| Int) (|~#unsigned_char_Array_0~0.offset| Int) (v_ArrVal_245 (Array Int Int))) (let ((.cse83 (mod (select .cse12 |~#unsigned_char_Array_0~0.offset|) 256))) (let ((.cse77 (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| (store .cse8 .cse9 (+ .cse10 (* v_y_3 (- 65536)) (* v_z_3 (- 65535)) (* (- 1) .cse83))))) (.cse82 (mod (+ .cse10 (* .cse83 65535)) 65536))) (let ((.cse71 (+ .cse82 v_z_3)) (.cse72 (store |c_#memory_int| |c_~#signed_short_int_Array_0~0.base| v_ArrVal_245)) (.cse76 (store .cse77 |c_~#signed_short_int_Array_0~0.base| v_ArrVal_245)) (.cse78 (select .cse77 |c_~#signed_short_int_Array_0~0.base|))) (or (< .cse71 65536) (< 98303 .cse71) (let ((.cse73 (store (store (select (store .cse77 |c_~#signed_short_int_Array_0~0.base| (store .cse78 |~#signed_short_int_Array_0~0.offset| .cse71)) |c_~#signed_char_Array_0~0.base|) .cse6 14) .cse7 4))) (let ((.cse74 (select (store .cse76 |c_~#signed_char_Array_0~0.base| .cse73) |c_~#signed_long_int_Array_0~0.base|))) (let ((.cse75 (select .cse74 .cse4))) (< (select (select (store (store .cse72 |c_~#signed_char_Array_0~0.base| .cse73) |c_~#signed_long_int_Array_0~0.base| (store .cse74 |c_~#signed_long_int_Array_0~0.offset| .cse75)) |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|) .cse75)))) (let ((.cse79 (store (store (select (store .cse77 |c_~#signed_short_int_Array_0~0.base| (store .cse78 |~#signed_short_int_Array_0~0.offset| (+ .cse82 v_z_3 (- 65536)))) |c_~#signed_char_Array_0~0.base|) .cse6 14) .cse7 4))) (let ((.cse80 (select (store .cse76 |c_~#signed_char_Array_0~0.base| .cse79) |c_~#signed_long_int_Array_0~0.base|))) (let ((.cse81 (select .cse80 .cse4))) (< (select (select (store (store .cse72 |c_~#signed_char_Array_0~0.base| .cse79) |c_~#signed_long_int_Array_0~0.base| (store .cse80 |c_~#signed_long_int_Array_0~0.offset| .cse81)) |c_~#signed_char_Array_0~0.base|) |c_~#signed_char_Array_0~0.offset|) .cse81))))))))) (< v_z_3 0)))))) is different from true [2023-11-19 07:48:32,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2028167948] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:48:32,673 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-19 07:48:32,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 23 [2023-11-19 07:48:32,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688190721] [2023-11-19 07:48:32,673 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-19 07:48:32,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-19 07:48:32,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:48:32,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-19 07:48:32,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=592, Unknown=6, NotChecked=50, Total=756 [2023-11-19 07:48:32,676 INFO L87 Difference]: Start difference. First operand 87 states and 116 transitions. Second operand has 23 states, 21 states have (on average 3.619047619047619) internal successors, (76), 23 states have internal predecessors, (76), 9 states have call successors, (16), 4 states have call predecessors, (16), 6 states have return successors, (16), 7 states have call predecessors, (16), 9 states have call successors, (16) [2023-11-19 07:48:38,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:48:38,145 INFO L93 Difference]: Finished difference Result 217 states and 282 transitions. [2023-11-19 07:48:38,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-19 07:48:38,146 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 3.619047619047619) internal successors, (76), 23 states have internal predecessors, (76), 9 states have call successors, (16), 4 states have call predecessors, (16), 6 states have return successors, (16), 7 states have call predecessors, (16), 9 states have call successors, (16) Word has length 79 [2023-11-19 07:48:38,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:48:38,147 INFO L225 Difference]: With dead ends: 217 [2023-11-19 07:48:38,147 INFO L226 Difference]: Without dead ends: 133 [2023-11-19 07:48:38,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=379, Invalid=1507, Unknown=10, NotChecked=84, Total=1980 [2023-11-19 07:48:38,150 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 711 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 86 mSolverCounterUnsat, 48 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 48 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-11-19 07:48:38,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [711 Valid, 373 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 671 Invalid, 48 Unknown, 0 Unchecked, 1.7s Time] [2023-11-19 07:48:38,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-11-19 07:48:38,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 95. [2023-11-19 07:48:38,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 83 states have (on average 1.2530120481927711) internal successors, (104), 83 states have internal predecessors, (104), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-19 07:48:38,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 120 transitions. [2023-11-19 07:48:38,160 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 120 transitions. Word has length 79 [2023-11-19 07:48:38,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:48:38,161 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 120 transitions. [2023-11-19 07:48:38,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 3.619047619047619) internal successors, (76), 23 states have internal predecessors, (76), 9 states have call successors, (16), 4 states have call predecessors, (16), 6 states have return successors, (16), 7 states have call predecessors, (16), 9 states have call successors, (16) [2023-11-19 07:48:38,162 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 120 transitions. [2023-11-19 07:48:38,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-11-19 07:48:38,163 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:48:38,163 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:38,185 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a8f516-3bd1-4cab-a5cf-aeb231f4001f/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-19 07:48:38,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a8f516-3bd1-4cab-a5cf-aeb231f4001f/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-19 07:48:38,377 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:48:38,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:48:38,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1012296544, now seen corresponding path program 1 times [2023-11-19 07:48:38,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:48:38,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417983947] [2023-11-19 07:48:38,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:48:38,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:48:38,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:38,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:48:38,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:38,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:48:38,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:38,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:48:38,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:38,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:48:38,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:38,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:48:38,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:38,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:48:38,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:38,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:48:38,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:38,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:48:38,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:38,566 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-19 07:48:38,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:48:38,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417983947] [2023-11-19 07:48:38,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417983947] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:48:38,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:48:38,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:48:38,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322863904] [2023-11-19 07:48:38,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:48:38,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:48:38,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:48:38,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:48:38,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:48:38,569 INFO L87 Difference]: Start difference. First operand 95 states and 120 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-19 07:48:38,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:48:38,821 INFO L93 Difference]: Finished difference Result 272 states and 345 transitions. [2023-11-19 07:48:38,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:48:38,821 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 80 [2023-11-19 07:48:38,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:48:38,823 INFO L225 Difference]: With dead ends: 272 [2023-11-19 07:48:38,823 INFO L226 Difference]: Without dead ends: 180 [2023-11-19 07:48:38,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:48:38,824 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 107 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 07:48:38,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 284 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 07:48:38,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2023-11-19 07:48:38,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 110. [2023-11-19 07:48:38,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 98 states have (on average 1.2346938775510203) internal successors, (121), 98 states have internal predecessors, (121), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-19 07:48:38,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 137 transitions. [2023-11-19 07:48:38,837 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 137 transitions. Word has length 80 [2023-11-19 07:48:38,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:48:38,837 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 137 transitions. [2023-11-19 07:48:38,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-19 07:48:38,838 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 137 transitions. [2023-11-19 07:48:38,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-11-19 07:48:38,839 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:48:38,839 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:38,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-19 07:48:38,839 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:48:38,840 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:48:38,840 INFO L85 PathProgramCache]: Analyzing trace with hash -220227388, now seen corresponding path program 1 times [2023-11-19 07:48:38,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:48:38,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85087579] [2023-11-19 07:48:38,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:48:38,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:48:38,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:39,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:48:39,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:39,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:48:39,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:39,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:48:39,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:39,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:48:39,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:39,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:48:39,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:39,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:48:39,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:39,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:48:39,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:39,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:48:39,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:39,196 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-19 07:48:39,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:48:39,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85087579] [2023-11-19 07:48:39,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85087579] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:48:39,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:48:39,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-19 07:48:39,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674045860] [2023-11-19 07:48:39,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:48:39,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 07:48:39,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:48:39,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 07:48:39,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:48:39,201 INFO L87 Difference]: Start difference. First operand 110 states and 137 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-19 07:48:39,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:48:39,710 INFO L93 Difference]: Finished difference Result 300 states and 377 transitions. [2023-11-19 07:48:39,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-19 07:48:39,710 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 80 [2023-11-19 07:48:39,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:48:39,712 INFO L225 Difference]: With dead ends: 300 [2023-11-19 07:48:39,712 INFO L226 Difference]: Without dead ends: 193 [2023-11-19 07:48:39,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2023-11-19 07:48:39,713 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 197 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-19 07:48:39,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 333 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-19 07:48:39,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2023-11-19 07:48:39,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 119. [2023-11-19 07:48:39,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 107 states have (on average 1.233644859813084) internal successors, (132), 107 states have internal predecessors, (132), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-19 07:48:39,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 148 transitions. [2023-11-19 07:48:39,727 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 148 transitions. Word has length 80 [2023-11-19 07:48:39,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:48:39,727 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 148 transitions. [2023-11-19 07:48:39,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-19 07:48:39,727 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 148 transitions. [2023-11-19 07:48:39,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-11-19 07:48:39,729 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:48:39,730 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:39,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-19 07:48:39,731 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:48:39,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:48:39,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1059636290, now seen corresponding path program 1 times [2023-11-19 07:48:39,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:48:39,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357763557] [2023-11-19 07:48:39,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:48:39,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:48:39,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:41,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:48:41,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:41,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:48:41,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:41,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:48:41,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:41,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:48:41,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:41,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:48:41,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:41,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:48:41,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:41,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:48:41,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:41,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:48:41,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:41,629 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-11-19 07:48:41,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:48:41,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357763557] [2023-11-19 07:48:41,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357763557] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:48:41,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277373260] [2023-11-19 07:48:41,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:48:41,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:48:41,631 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a8f516-3bd1-4cab-a5cf-aeb231f4001f/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:48:41,632 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a8f516-3bd1-4cab-a5cf-aeb231f4001f/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:48:41,656 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a8f516-3bd1-4cab-a5cf-aeb231f4001f/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-19 07:48:41,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:41,801 INFO L262 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-19 07:48:41,807 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:48:42,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 55 [2023-11-19 07:48:42,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2023-11-19 07:48:42,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-19 07:48:42,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:48:42,421 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 70 treesize of output 55 [2023-11-19 07:48:42,722 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:48:42,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 42 [2023-11-19 07:48:42,988 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-11-19 07:48:42,988 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:48:43,448 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_~#signed_char_Array_0~0.offset| 1))) (and (forall ((v_ArrVal_321 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| v_ArrVal_321) |c_~#signed_char_Array_0~0.base|))) (let ((.cse1 (select .cse2 |c_~#signed_char_Array_0~0.offset|))) (let ((.cse0 (* 256 (div (* (- 1) .cse1) 256)))) (or (< 0 (+ .cse0 .cse1 128)) (= (+ .cse0 256 .cse1 (select .cse2 .cse3)) 0)))))) (forall ((v_ArrVal_321 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| v_ArrVal_321) |c_~#signed_char_Array_0~0.base|))) (let ((.cse5 (select .cse6 |c_~#signed_char_Array_0~0.offset|))) (let ((.cse4 (* 256 (div (* (- 1) .cse5) 256)))) (or (< (+ .cse4 .cse5 127) 0) (= (+ .cse4 .cse5 (select .cse6 .cse3)) 0)))))) (forall ((v_ArrVal_321 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| v_ArrVal_321) |c_~#signed_char_Array_0~0.base|))) (let ((.cse8 (select .cse10 |c_~#signed_char_Array_0~0.offset|))) (let ((.cse7 (* 256 (div (* (- 1) .cse8) 256))) (.cse9 (select .cse10 .cse3))) (or (= (+ .cse7 256 .cse8 .cse9) 0) (= (+ .cse7 .cse8 .cse9) 0)))))))) is different from false [2023-11-19 07:48:44,989 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:48:44,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 530 treesize of output 230 [2023-11-19 07:48:45,010 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:48:45,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 350 treesize of output 264 [2023-11-19 07:48:45,044 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:48:45,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 236 treesize of output 224 [2023-11-19 07:48:45,058 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:48:45,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 224 treesize of output 208 [2023-11-19 07:48:45,077 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:48:45,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 208 treesize of output 196 [2023-11-19 07:48:45,132 INFO L349 Elim1Store]: treesize reduction 22, result has 4.3 percent of original size [2023-11-19 07:48:45,133 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 498 treesize of output 1 [2023-11-19 07:48:45,332 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-19 07:48:45,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1277373260] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-19 07:48:45,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-19 07:48:45,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [21, 12] total 35 [2023-11-19 07:48:45,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932123862] [2023-11-19 07:48:45,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:48:45,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-19 07:48:45,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:48:45,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-19 07:48:45,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=992, Unknown=1, NotChecked=64, Total=1190 [2023-11-19 07:48:45,336 INFO L87 Difference]: Start difference. First operand 119 states and 148 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-19 07:48:48,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:48:48,852 INFO L93 Difference]: Finished difference Result 273 states and 340 transitions. [2023-11-19 07:48:48,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-19 07:48:48,853 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 80 [2023-11-19 07:48:48,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:48:48,854 INFO L225 Difference]: With dead ends: 273 [2023-11-19 07:48:48,855 INFO L226 Difference]: Without dead ends: 157 [2023-11-19 07:48:48,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 159 SyntacticMatches, 5 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=211, Invalid=1514, Unknown=1, NotChecked=80, Total=1806 [2023-11-19 07:48:48,857 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 239 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 143 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-19 07:48:48,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 454 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 481 Invalid, 0 Unknown, 143 Unchecked, 1.2s Time] [2023-11-19 07:48:48,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2023-11-19 07:48:48,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 120. [2023-11-19 07:48:48,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 108 states have (on average 1.2314814814814814) internal successors, (133), 108 states have internal predecessors, (133), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-19 07:48:48,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 149 transitions. [2023-11-19 07:48:48,869 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 149 transitions. Word has length 80 [2023-11-19 07:48:48,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:48:48,870 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 149 transitions. [2023-11-19 07:48:48,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-19 07:48:48,870 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 149 transitions. [2023-11-19 07:48:48,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-11-19 07:48:48,872 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:48:48,872 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:48,892 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a8f516-3bd1-4cab-a5cf-aeb231f4001f/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-19 07:48:49,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4a8f516-3bd1-4cab-a5cf-aeb231f4001f/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-19 07:48:49,081 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:48:49,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:48:49,081 INFO L85 PathProgramCache]: Analyzing trace with hash -2025665722, now seen corresponding path program 1 times [2023-11-19 07:48:49,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:48:49,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890272527] [2023-11-19 07:48:49,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:48:49,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:48:49,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:50,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:48:50,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:50,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:48:50,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:50,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:48:50,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:50,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:48:50,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:50,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:48:50,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:50,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:48:50,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:50,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:48:50,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:50,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:48:50,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:50,588 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-19 07:48:50,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:48:50,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890272527] [2023-11-19 07:48:50,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890272527] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:48:50,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:48:50,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2023-11-19 07:48:50,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415270907] [2023-11-19 07:48:50,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:48:50,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-19 07:48:50,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:48:50,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-19 07:48:50,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2023-11-19 07:48:50,591 INFO L87 Difference]: Start difference. First operand 120 states and 149 transitions. Second operand has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-19 07:48:53,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:48:53,554 INFO L93 Difference]: Finished difference Result 490 states and 612 transitions. [2023-11-19 07:48:53,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-19 07:48:53,555 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 80 [2023-11-19 07:48:53,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:48:53,564 INFO L225 Difference]: With dead ends: 490 [2023-11-19 07:48:53,564 INFO L226 Difference]: Without dead ends: 373 [2023-11-19 07:48:53,569 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=281, Invalid=1125, Unknown=0, NotChecked=0, Total=1406 [2023-11-19 07:48:53,570 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 506 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 1263 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 1293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-11-19 07:48:53,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [506 Valid, 835 Invalid, 1293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1263 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-11-19 07:48:53,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2023-11-19 07:48:53,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 164. [2023-11-19 07:48:53,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 141 states have (on average 1.2198581560283688) internal successors, (172), 141 states have internal predecessors, (172), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-19 07:48:53,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 204 transitions. [2023-11-19 07:48:53,592 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 204 transitions. Word has length 80 [2023-11-19 07:48:53,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:48:53,592 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 204 transitions. [2023-11-19 07:48:53,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-19 07:48:53,593 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 204 transitions. [2023-11-19 07:48:53,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-11-19 07:48:53,594 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:48:53,594 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:53,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-19 07:48:53,594 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:48:53,595 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:48:53,595 INFO L85 PathProgramCache]: Analyzing trace with hash -745802044, now seen corresponding path program 1 times [2023-11-19 07:48:53,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:48:53,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173099642] [2023-11-19 07:48:53,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:48:53,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:48:53,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat