./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-76.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ab41c9d-9030-46ad-858c-27aa5846a49e/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ab41c9d-9030-46ad-858c-27aa5846a49e/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ab41c9d-9030-46ad-858c-27aa5846a49e/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ab41c9d-9030-46ad-858c-27aa5846a49e/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-76.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ab41c9d-9030-46ad-858c-27aa5846a49e/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ab41c9d-9030-46ad-858c-27aa5846a49e/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 8cc1254b56c35a5957910a792c61c07dcc83238ffe78e59788d87f7ad9ed5713 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:51:28,152 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:51:28,266 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ab41c9d-9030-46ad-858c-27aa5846a49e/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:51:28,279 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:51:28,280 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:51:28,317 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:51:28,318 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:51:28,318 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:51:28,319 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:51:28,324 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:51:28,326 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:51:28,327 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:51:28,327 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:51:28,329 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:51:28,329 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:51:28,330 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:51:28,330 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:51:28,331 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:51:28,331 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:51:28,332 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:51:28,332 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:51:28,333 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:51:28,333 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:51:28,334 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:51:28,334 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:51:28,335 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:51:28,336 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:51:28,336 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:51:28,337 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:51:28,337 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:51:28,339 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:51:28,339 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:51:28,339 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:51:28,340 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:51:28,340 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:51:28,340 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:51:28,341 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:51:28,341 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:51:28,341 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:51:28,342 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_2ab41c9d-9030-46ad-858c-27aa5846a49e/bin/uautomizer-verify-WvqO1wxjHP/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_2ab41c9d-9030-46ad-858c-27aa5846a49e/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 8cc1254b56c35a5957910a792c61c07dcc83238ffe78e59788d87f7ad9ed5713 [2023-11-06 22:51:28,662 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:51:28,696 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:51:28,699 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:51:28,701 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:51:28,702 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:51:28,703 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ab41c9d-9030-46ad-858c-27aa5846a49e/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-76.i [2023-11-06 22:51:31,816 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:51:32,094 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:51:32,095 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ab41c9d-9030-46ad-858c-27aa5846a49e/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-76.i [2023-11-06 22:51:32,104 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ab41c9d-9030-46ad-858c-27aa5846a49e/bin/uautomizer-verify-WvqO1wxjHP/data/e136af942/f6934d1b3a5f46f28229ede9e7d3fa4e/FLAG09acf9b1d [2023-11-06 22:51:32,119 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ab41c9d-9030-46ad-858c-27aa5846a49e/bin/uautomizer-verify-WvqO1wxjHP/data/e136af942/f6934d1b3a5f46f28229ede9e7d3fa4e [2023-11-06 22:51:32,121 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:51:32,123 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:51:32,124 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:51:32,125 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:51:32,130 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:51:32,131 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:51:32" (1/1) ... [2023-11-06 22:51:32,132 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e48c263 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:32, skipping insertion in model container [2023-11-06 22:51:32,132 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:51:32" (1/1) ... [2023-11-06 22:51:32,173 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:51:32,358 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_2ab41c9d-9030-46ad-858c-27aa5846a49e/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-76.i[917,930] [2023-11-06 22:51:32,414 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:51:32,427 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:51:32,439 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_2ab41c9d-9030-46ad-858c-27aa5846a49e/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-76.i[917,930] [2023-11-06 22:51:32,489 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:51:32,525 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:51:32,526 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:32 WrapperNode [2023-11-06 22:51:32,526 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:51:32,527 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:51:32,527 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:51:32,528 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:51:32,535 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:32" (1/1) ... [2023-11-06 22:51:32,548 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:32" (1/1) ... [2023-11-06 22:51:32,597 INFO L138 Inliner]: procedures = 29, calls = 134, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 374 [2023-11-06 22:51:32,597 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:51:32,598 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:51:32,598 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:51:32,598 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:51:32,608 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:32" (1/1) ... [2023-11-06 22:51:32,608 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:32" (1/1) ... [2023-11-06 22:51:32,615 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:32" (1/1) ... [2023-11-06 22:51:32,615 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:32" (1/1) ... [2023-11-06 22:51:32,632 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:32" (1/1) ... [2023-11-06 22:51:32,637 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:32" (1/1) ... [2023-11-06 22:51:32,641 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:32" (1/1) ... [2023-11-06 22:51:32,643 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:32" (1/1) ... [2023-11-06 22:51:32,649 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:51:32,650 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:51:32,650 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:51:32,650 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:51:32,651 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:32" (1/1) ... [2023-11-06 22:51:32,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:51:32,674 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ab41c9d-9030-46ad-858c-27aa5846a49e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:51:32,710 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ab41c9d-9030-46ad-858c-27aa5846a49e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:51:32,748 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ab41c9d-9030-46ad-858c-27aa5846a49e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:51:32,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:51:32,764 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2023-11-06 22:51:32,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:51:32,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2023-11-06 22:51:32,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:51:32,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2023-11-06 22:51:32,765 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:51:32,767 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:51:32,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:51:32,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:51:32,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:51:32,897 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:51:32,899 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:51:33,476 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:51:33,486 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:51:33,486 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:51:33,489 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:51:33 BoogieIcfgContainer [2023-11-06 22:51:33,489 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:51:33,491 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:51:33,492 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:51:33,495 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:51:33,495 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:51:32" (1/3) ... [2023-11-06 22:51:33,499 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e077fc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:51:33, skipping insertion in model container [2023-11-06 22:51:33,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:32" (2/3) ... [2023-11-06 22:51:33,502 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e077fc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:51:33, skipping insertion in model container [2023-11-06 22:51:33,502 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:51:33" (3/3) ... [2023-11-06 22:51:33,504 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-76.i [2023-11-06 22:51:33,549 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:51:33,550 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:51:33,633 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:51:33,645 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=LoopsAndPotentialCycles, 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;@781431a9, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:51:33,645 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:51:33,651 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 84 states have (on average 1.4166666666666667) internal successors, (119), 85 states have internal predecessors, (119), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-06 22:51:33,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-06 22:51:33,669 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:51:33,669 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:51:33,670 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:51:33,675 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:51:33,676 INFO L85 PathProgramCache]: Analyzing trace with hash -2020212237, now seen corresponding path program 1 times [2023-11-06 22:51:33,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:51:33,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16125405] [2023-11-06 22:51:33,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:33,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:51:33,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:34,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:51:34,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:34,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:51:34,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:34,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:51:34,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:34,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:51:34,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:34,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:51:34,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:34,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:51:34,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:34,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:51:34,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:34,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:51:34,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:34,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:51:34,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:34,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:51:34,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:34,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:51:34,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:34,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:51:34,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:34,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:51:34,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:34,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:51:34,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:34,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:51:34,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:34,230 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-06 22:51:34,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:51:34,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16125405] [2023-11-06 22:51:34,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16125405] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:51:34,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:51:34,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:51:34,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842223868] [2023-11-06 22:51:34,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:51:34,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:51:34,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:51:34,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:51:34,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:51:34,289 INFO L87 Difference]: Start difference. First operand has 102 states, 84 states have (on average 1.4166666666666667) internal successors, (119), 85 states have internal predecessors, (119), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-06 22:51:34,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:51:34,333 INFO L93 Difference]: Finished difference Result 193 states and 301 transitions. [2023-11-06 22:51:34,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:51:34,339 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 119 [2023-11-06 22:51:34,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:51:34,352 INFO L225 Difference]: With dead ends: 193 [2023-11-06 22:51:34,352 INFO L226 Difference]: Without dead ends: 94 [2023-11-06 22:51:34,359 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:51:34,364 INFO L413 NwaCegarLoop]: 133 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, 133 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-06 22:51:34,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:51:34,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-11-06 22:51:34,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2023-11-06 22:51:34,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 77 states have (on average 1.3376623376623376) internal successors, (103), 77 states have internal predecessors, (103), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-06 22:51:34,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 133 transitions. [2023-11-06 22:51:34,438 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 133 transitions. Word has length 119 [2023-11-06 22:51:34,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:51:34,439 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 133 transitions. [2023-11-06 22:51:34,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-06 22:51:34,440 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 133 transitions. [2023-11-06 22:51:34,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-06 22:51:34,453 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:51:34,454 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:51:34,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:51:34,455 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:51:34,455 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:51:34,456 INFO L85 PathProgramCache]: Analyzing trace with hash 189444987, now seen corresponding path program 1 times [2023-11-06 22:51:34,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:51:34,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748438303] [2023-11-06 22:51:34,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:34,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:51:34,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:34,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:51:34,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:34,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:51:34,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:34,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:51:34,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:34,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:51:34,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:34,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:51:34,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:34,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:51:34,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:34,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:51:34,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:34,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:51:34,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:34,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:51:34,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:34,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:51:34,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:34,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:51:34,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:34,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:51:34,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:34,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:51:34,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:34,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:51:34,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:34,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:51:34,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:34,895 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-06 22:51:34,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:51:34,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748438303] [2023-11-06 22:51:34,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748438303] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:51:34,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:51:34,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:51:34,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109441057] [2023-11-06 22:51:34,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:51:34,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:51:34,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:51:34,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:51:34,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:51:34,900 INFO L87 Difference]: Start difference. First operand 94 states and 133 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-06 22:51:34,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:51:34,992 INFO L93 Difference]: Finished difference Result 191 states and 272 transitions. [2023-11-06 22:51:34,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:51:34,993 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 119 [2023-11-06 22:51:34,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:51:34,994 INFO L225 Difference]: With dead ends: 191 [2023-11-06 22:51:34,995 INFO L226 Difference]: Without dead ends: 100 [2023-11-06 22:51:34,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:51:34,997 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 10 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:51:34,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 387 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:51:34,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-11-06 22:51:35,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2023-11-06 22:51:35,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 79 states have (on average 1.3291139240506329) internal successors, (105), 79 states have internal predecessors, (105), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-06 22:51:35,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 135 transitions. [2023-11-06 22:51:35,014 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 135 transitions. Word has length 119 [2023-11-06 22:51:35,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:51:35,015 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 135 transitions. [2023-11-06 22:51:35,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-06 22:51:35,015 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 135 transitions. [2023-11-06 22:51:35,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-06 22:51:35,018 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:51:35,018 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:51:35,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:51:35,018 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:51:35,019 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:51:35,019 INFO L85 PathProgramCache]: Analyzing trace with hash -649588675, now seen corresponding path program 1 times [2023-11-06 22:51:35,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:51:35,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687781336] [2023-11-06 22:51:35,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:35,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:51:35,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:35,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:51:35,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:35,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:51:35,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:35,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:51:35,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:35,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:51:35,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:35,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:51:35,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:35,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:51:35,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:35,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:51:35,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:35,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:51:35,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:35,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:51:35,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:35,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:51:35,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:35,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:51:35,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:35,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:51:35,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:35,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:51:35,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:35,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:51:35,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:35,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:51:35,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:35,314 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-06 22:51:35,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:51:35,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687781336] [2023-11-06 22:51:35,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687781336] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:51:35,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:51:35,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:51:35,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805589534] [2023-11-06 22:51:35,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:51:35,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:51:35,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:51:35,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:51:35,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:51:35,318 INFO L87 Difference]: Start difference. First operand 96 states and 135 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:51:35,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:51:35,352 INFO L93 Difference]: Finished difference Result 189 states and 267 transitions. [2023-11-06 22:51:35,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:51:35,360 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 119 [2023-11-06 22:51:35,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:51:35,362 INFO L225 Difference]: With dead ends: 189 [2023-11-06 22:51:35,362 INFO L226 Difference]: Without dead ends: 96 [2023-11-06 22:51:35,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:51:35,365 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:51:35,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 259 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:51:35,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-11-06 22:51:35,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2023-11-06 22:51:35,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 79 states have (on average 1.3164556962025316) internal successors, (104), 79 states have internal predecessors, (104), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-06 22:51:35,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 134 transitions. [2023-11-06 22:51:35,393 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 134 transitions. Word has length 119 [2023-11-06 22:51:35,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:51:35,394 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 134 transitions. [2023-11-06 22:51:35,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:51:35,395 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 134 transitions. [2023-11-06 22:51:35,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-06 22:51:35,396 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:51:35,397 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:51:35,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:51:35,397 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:51:35,397 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:51:35,398 INFO L85 PathProgramCache]: Analyzing trace with hash 4751163, now seen corresponding path program 1 times [2023-11-06 22:51:35,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:51:35,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376844978] [2023-11-06 22:51:35,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:35,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:51:35,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:35,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:51:35,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:35,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:51:35,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:35,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:51:35,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:35,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:51:35,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:35,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:51:35,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:35,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:51:35,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:35,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:51:35,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:35,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:51:35,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:35,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:51:35,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:35,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:51:35,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:35,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:51:35,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:35,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:51:35,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:35,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:51:35,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:35,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:51:35,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:35,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:51:35,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:35,795 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-06 22:51:35,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:51:35,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376844978] [2023-11-06 22:51:35,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376844978] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:51:35,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:51:35,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:51:35,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044830139] [2023-11-06 22:51:35,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:51:35,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:51:35,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:51:35,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:51:35,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:51:35,799 INFO L87 Difference]: Start difference. First operand 96 states and 134 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:51:36,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:51:36,035 INFO L93 Difference]: Finished difference Result 190 states and 266 transitions. [2023-11-06 22:51:36,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:51:36,036 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 120 [2023-11-06 22:51:36,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:51:36,043 INFO L225 Difference]: With dead ends: 190 [2023-11-06 22:51:36,043 INFO L226 Difference]: Without dead ends: 97 [2023-11-06 22:51:36,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 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-06 22:51:36,049 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 76 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:51:36,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 204 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:51:36,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-11-06 22:51:36,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2023-11-06 22:51:36,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 79 states have internal predecessors, (103), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-06 22:51:36,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 133 transitions. [2023-11-06 22:51:36,073 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 133 transitions. Word has length 120 [2023-11-06 22:51:36,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:51:36,074 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 133 transitions. [2023-11-06 22:51:36,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:51:36,075 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 133 transitions. [2023-11-06 22:51:36,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-06 22:51:36,078 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:51:36,078 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:51:36,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:51:36,079 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:51:36,079 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:51:36,079 INFO L85 PathProgramCache]: Analyzing trace with hash 427452989, now seen corresponding path program 1 times [2023-11-06 22:51:36,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:51:36,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873522125] [2023-11-06 22:51:36,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:36,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:51:36,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:38,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:51:38,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:38,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:51:38,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:38,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:51:38,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:38,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:51:38,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:38,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:51:38,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:38,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:51:38,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:38,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:51:38,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:38,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:51:38,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:38,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:51:38,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:38,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:51:38,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:38,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:51:38,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:38,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:51:38,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:38,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:51:38,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:38,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:51:38,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:38,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:51:38,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:38,309 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-06 22:51:38,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:51:38,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873522125] [2023-11-06 22:51:38,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873522125] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:51:38,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:51:38,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-06 22:51:38,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895055479] [2023-11-06 22:51:38,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:51:38,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 22:51:38,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:51:38,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:51:38,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:51:38,315 INFO L87 Difference]: Start difference. First operand 96 states and 133 transitions. Second operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-06 22:51:39,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:51:39,006 INFO L93 Difference]: Finished difference Result 230 states and 320 transitions. [2023-11-06 22:51:39,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:51:39,007 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 120 [2023-11-06 22:51:39,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:51:39,009 INFO L225 Difference]: With dead ends: 230 [2023-11-06 22:51:39,009 INFO L226 Difference]: Without dead ends: 137 [2023-11-06 22:51:39,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2023-11-06 22:51:39,011 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 447 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:51:39,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 350 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:51:39,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2023-11-06 22:51:39,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 106. [2023-11-06 22:51:39,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 89 states have (on average 1.3146067415730338) internal successors, (117), 89 states have internal predecessors, (117), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-06 22:51:39,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 147 transitions. [2023-11-06 22:51:39,076 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 147 transitions. Word has length 120 [2023-11-06 22:51:39,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:51:39,078 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 147 transitions. [2023-11-06 22:51:39,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-06 22:51:39,078 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 147 transitions. [2023-11-06 22:51:39,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-06 22:51:39,080 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:51:39,080 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:51:39,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:51:39,080 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:51:39,082 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:51:39,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1480347512, now seen corresponding path program 1 times [2023-11-06 22:51:39,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:51:39,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638676785] [2023-11-06 22:51:39,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:39,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:51:39,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:39,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:51:39,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:39,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:51:39,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:39,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:51:39,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:39,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:51:39,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:39,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:51:39,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:39,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:51:39,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:39,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:51:39,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:39,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:51:39,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:39,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:51:39,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:39,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:51:39,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:39,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:51:39,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:39,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:51:39,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:39,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:51:39,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:39,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:51:39,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:39,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:51:39,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:39,255 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-06 22:51:39,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:51:39,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638676785] [2023-11-06 22:51:39,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638676785] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:51:39,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:51:39,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:51:39,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110262227] [2023-11-06 22:51:39,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:51:39,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:51:39,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:51:39,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:51:39,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:51:39,258 INFO L87 Difference]: Start difference. First operand 106 states and 147 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:51:39,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:51:39,286 INFO L93 Difference]: Finished difference Result 227 states and 317 transitions. [2023-11-06 22:51:39,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:51:39,287 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 122 [2023-11-06 22:51:39,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:51:39,288 INFO L225 Difference]: With dead ends: 227 [2023-11-06 22:51:39,289 INFO L226 Difference]: Without dead ends: 124 [2023-11-06 22:51:39,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:51:39,290 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 33 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:51:39,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 273 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:51:39,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-11-06 22:51:39,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 106. [2023-11-06 22:51:39,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 89 states have (on average 1.303370786516854) internal successors, (116), 89 states have internal predecessors, (116), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-06 22:51:39,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 146 transitions. [2023-11-06 22:51:39,314 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 146 transitions. Word has length 122 [2023-11-06 22:51:39,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:51:39,314 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 146 transitions. [2023-11-06 22:51:39,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:51:39,315 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 146 transitions. [2023-11-06 22:51:39,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-06 22:51:39,316 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:51:39,317 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:51:39,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:51:39,317 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:51:39,318 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:51:39,318 INFO L85 PathProgramCache]: Analyzing trace with hash -725682600, now seen corresponding path program 1 times [2023-11-06 22:51:39,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:51:39,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169831745] [2023-11-06 22:51:39,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:39,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:51:39,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:39,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:51:39,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:39,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:51:39,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:39,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:51:39,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:39,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:51:39,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:39,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:51:39,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:39,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:51:39,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:39,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:51:39,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:39,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:51:39,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:39,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:51:39,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:39,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:51:39,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:39,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:51:39,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:39,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:51:39,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:39,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:51:39,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:39,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:51:39,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:39,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:51:39,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:39,912 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-06 22:51:39,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:51:39,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169831745] [2023-11-06 22:51:39,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169831745] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:51:39,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:51:39,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:51:39,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496820382] [2023-11-06 22:51:39,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:51:39,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:51:39,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:51:39,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:51:39,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:51:39,915 INFO L87 Difference]: Start difference. First operand 106 states and 146 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:51:40,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:51:40,242 INFO L93 Difference]: Finished difference Result 211 states and 291 transitions. [2023-11-06 22:51:40,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:51:40,243 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 122 [2023-11-06 22:51:40,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:51:40,245 INFO L225 Difference]: With dead ends: 211 [2023-11-06 22:51:40,245 INFO L226 Difference]: Without dead ends: 108 [2023-11-06 22:51:40,245 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:51:40,246 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 105 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:51:40,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 328 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:51:40,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-11-06 22:51:40,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2023-11-06 22:51:40,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 89 states have (on average 1.2921348314606742) internal successors, (115), 89 states have internal predecessors, (115), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-06 22:51:40,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 145 transitions. [2023-11-06 22:51:40,271 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 145 transitions. Word has length 122 [2023-11-06 22:51:40,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:51:40,271 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 145 transitions. [2023-11-06 22:51:40,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:51:40,272 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 145 transitions. [2023-11-06 22:51:40,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-06 22:51:40,274 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:51:40,274 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:51:40,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:51:40,274 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:51:40,275 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:51:40,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1213675190, now seen corresponding path program 1 times [2023-11-06 22:51:40,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:51:40,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677532595] [2023-11-06 22:51:40,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:40,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:51:40,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:40,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:51:40,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:40,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:51:40,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:40,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:51:40,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:40,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:51:40,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:40,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:51:40,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:40,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:51:40,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:40,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:51:40,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:40,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:51:40,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:40,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:51:40,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:40,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:51:40,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:40,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:51:40,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:40,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:51:40,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:40,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:51:40,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:40,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:51:40,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:40,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:51:40,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:40,570 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-06 22:51:40,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:51:40,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677532595] [2023-11-06 22:51:40,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677532595] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:51:40,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:51:40,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:51:40,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45239013] [2023-11-06 22:51:40,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:51:40,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:51:40,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:51:40,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:51:40,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:51:40,573 INFO L87 Difference]: Start difference. First operand 106 states and 145 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:51:40,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:51:40,659 INFO L93 Difference]: Finished difference Result 229 states and 315 transitions. [2023-11-06 22:51:40,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:51:40,659 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2023-11-06 22:51:40,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:51:40,661 INFO L225 Difference]: With dead ends: 229 [2023-11-06 22:51:40,661 INFO L226 Difference]: Without dead ends: 126 [2023-11-06 22:51:40,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:51:40,662 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 98 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:51:40,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 631 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:51:40,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-11-06 22:51:40,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 110. [2023-11-06 22:51:40,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 93 states have (on average 1.2795698924731183) internal successors, (119), 93 states have internal predecessors, (119), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-06 22:51:40,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 149 transitions. [2023-11-06 22:51:40,683 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 149 transitions. Word has length 124 [2023-11-06 22:51:40,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:51:40,683 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 149 transitions. [2023-11-06 22:51:40,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:51:40,684 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 149 transitions. [2023-11-06 22:51:40,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-06 22:51:40,685 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:51:40,686 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:51:40,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:51:40,686 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:51:40,686 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:51:40,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1518996242, now seen corresponding path program 1 times [2023-11-06 22:51:40,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:51:40,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776080129] [2023-11-06 22:51:40,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:40,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:51:40,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:40,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:51:40,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:40,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:51:40,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:40,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:51:40,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:40,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:51:40,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:40,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:51:40,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:40,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:51:40,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:40,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:51:40,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:40,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:51:40,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:40,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:51:40,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:40,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:51:40,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:40,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:51:40,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:40,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:51:40,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:40,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:51:40,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:40,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:51:40,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:40,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:51:40,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:40,802 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-06 22:51:40,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:51:40,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776080129] [2023-11-06 22:51:40,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776080129] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:51:40,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:51:40,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:51:40,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70781186] [2023-11-06 22:51:40,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:51:40,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:51:40,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:51:40,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:51:40,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:51:40,805 INFO L87 Difference]: Start difference. First operand 110 states and 149 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:51:40,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:51:40,835 INFO L93 Difference]: Finished difference Result 219 states and 299 transitions. [2023-11-06 22:51:40,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:51:40,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2023-11-06 22:51:40,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:51:40,837 INFO L225 Difference]: With dead ends: 219 [2023-11-06 22:51:40,837 INFO L226 Difference]: Without dead ends: 112 [2023-11-06 22:51:40,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:51:40,840 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:51:40,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 252 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:51:40,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-11-06 22:51:40,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2023-11-06 22:51:40,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 95 states have (on average 1.2736842105263158) internal successors, (121), 95 states have internal predecessors, (121), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-06 22:51:40,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 151 transitions. [2023-11-06 22:51:40,866 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 151 transitions. Word has length 124 [2023-11-06 22:51:40,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:51:40,867 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 151 transitions. [2023-11-06 22:51:40,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:51:40,867 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 151 transitions. [2023-11-06 22:51:40,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-06 22:51:40,869 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:51:40,869 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:51:40,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:51:40,869 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:51:40,870 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:51:40,870 INFO L85 PathProgramCache]: Analyzing trace with hash 507878992, now seen corresponding path program 1 times [2023-11-06 22:51:40,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:51:40,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465271149] [2023-11-06 22:51:40,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:40,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:51:40,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:42,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:51:42,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:42,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:51:42,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:42,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:51:42,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:42,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:51:42,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:42,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:51:42,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:42,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:51:42,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:42,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:51:42,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:42,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:51:42,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:42,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:51:42,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:42,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:51:42,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:42,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:51:42,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:42,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:51:42,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:42,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:51:42,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:42,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:51:42,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:42,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:51:42,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:42,449 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-06 22:51:42,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:51:42,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465271149] [2023-11-06 22:51:42,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465271149] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:51:42,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:51:42,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 22:51:42,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914540156] [2023-11-06 22:51:42,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:51:42,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:51:42,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:51:42,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:51:42,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:51:42,453 INFO L87 Difference]: Start difference. First operand 112 states and 151 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:51:42,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:51:42,951 INFO L93 Difference]: Finished difference Result 221 states and 299 transitions. [2023-11-06 22:51:42,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:51:42,952 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2023-11-06 22:51:42,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:51:42,953 INFO L225 Difference]: With dead ends: 221 [2023-11-06 22:51:42,953 INFO L226 Difference]: Without dead ends: 112 [2023-11-06 22:51:42,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-11-06 22:51:42,955 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 117 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:51:42,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 387 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:51:42,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-11-06 22:51:42,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2023-11-06 22:51:42,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 93 states have (on average 1.2580645161290323) internal successors, (117), 93 states have internal predecessors, (117), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-06 22:51:42,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 147 transitions. [2023-11-06 22:51:42,977 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 147 transitions. Word has length 124 [2023-11-06 22:51:42,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:51:42,978 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 147 transitions. [2023-11-06 22:51:42,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:51:42,978 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 147 transitions. [2023-11-06 22:51:42,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-11-06 22:51:42,980 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:51:42,980 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:51:42,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:51:42,980 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:51:42,981 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:51:42,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1018530735, now seen corresponding path program 1 times [2023-11-06 22:51:42,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:51:42,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457122790] [2023-11-06 22:51:42,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:42,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:51:43,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:43,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:51:43,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:43,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:51:43,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:43,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:51:43,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:43,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:51:43,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:43,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:51:43,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:43,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:51:43,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:43,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:51:43,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:43,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:51:43,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:43,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:51:43,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:43,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:51:43,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:43,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:51:43,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:43,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:51:43,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:43,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:51:43,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:43,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:51:43,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:43,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:51:43,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:43,656 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-06 22:51:43,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:51:43,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457122790] [2023-11-06 22:51:43,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457122790] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:51:43,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:51:43,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:51:43,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143712515] [2023-11-06 22:51:43,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:51:43,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:51:43,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:51:43,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:51:43,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:51:43,659 INFO L87 Difference]: Start difference. First operand 110 states and 147 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:51:44,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:51:44,115 INFO L93 Difference]: Finished difference Result 262 states and 351 transitions. [2023-11-06 22:51:44,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:51:44,115 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 126 [2023-11-06 22:51:44,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:51:44,117 INFO L225 Difference]: With dead ends: 262 [2023-11-06 22:51:44,117 INFO L226 Difference]: Without dead ends: 155 [2023-11-06 22:51:44,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:51:44,118 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 182 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:51:44,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 420 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:51:44,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2023-11-06 22:51:44,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 112. [2023-11-06 22:51:44,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 95 states have (on average 1.2526315789473683) internal successors, (119), 95 states have internal predecessors, (119), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-06 22:51:44,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 149 transitions. [2023-11-06 22:51:44,143 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 149 transitions. Word has length 126 [2023-11-06 22:51:44,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:51:44,144 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 149 transitions. [2023-11-06 22:51:44,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:51:44,144 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 149 transitions. [2023-11-06 22:51:44,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-11-06 22:51:44,145 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:51:44,146 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:51:44,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 22:51:44,146 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:51:44,146 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:51:44,146 INFO L85 PathProgramCache]: Analyzing trace with hash -470688275, now seen corresponding path program 1 times [2023-11-06 22:51:44,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:51:44,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392830615] [2023-11-06 22:51:44,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:44,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:51:44,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:46,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:51:46,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:46,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:51:46,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:46,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:51:46,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:46,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:51:46,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:46,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:51:46,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:46,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:51:46,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:46,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:51:46,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:46,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:51:46,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:46,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:51:46,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:46,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:51:46,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:46,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:51:46,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:46,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:51:46,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:46,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:51:46,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:46,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:51:46,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:46,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:51:46,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:46,787 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-06 22:51:46,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:51:46,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392830615] [2023-11-06 22:51:46,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392830615] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:51:46,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:51:46,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-06 22:51:46,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858528300] [2023-11-06 22:51:46,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:51:46,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-06 22:51:46,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:51:46,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-06 22:51:46,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:51:46,791 INFO L87 Difference]: Start difference. First operand 112 states and 149 transitions. Second operand has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-06 22:51:47,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:51:47,504 INFO L93 Difference]: Finished difference Result 223 states and 297 transitions. [2023-11-06 22:51:47,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:51:47,505 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 126 [2023-11-06 22:51:47,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:51:47,506 INFO L225 Difference]: With dead ends: 223 [2023-11-06 22:51:47,506 INFO L226 Difference]: Without dead ends: 114 [2023-11-06 22:51:47,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2023-11-06 22:51:47,507 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 309 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:51:47,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 278 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:51:47,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-11-06 22:51:47,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2023-11-06 22:51:47,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 95 states have (on average 1.2421052631578948) internal successors, (118), 95 states have internal predecessors, (118), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-06 22:51:47,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 148 transitions. [2023-11-06 22:51:47,531 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 148 transitions. Word has length 126 [2023-11-06 22:51:47,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:51:47,532 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 148 transitions. [2023-11-06 22:51:47,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-06 22:51:47,532 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 148 transitions. [2023-11-06 22:51:47,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-11-06 22:51:47,534 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:51:47,534 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:51:47,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 22:51:47,534 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:51:47,535 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:51:47,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1670491939, now seen corresponding path program 1 times [2023-11-06 22:51:47,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:51:47,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254426737] [2023-11-06 22:51:47,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:47,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:51:47,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:48,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:51:48,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:48,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:51:48,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:48,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:51:48,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:48,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:51:48,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:48,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:51:48,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:48,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:51:48,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:48,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:51:48,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:48,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:51:48,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:48,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:51:48,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:48,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:51:48,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:48,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:51:48,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:48,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:51:48,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:48,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:51:48,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:48,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:51:48,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:48,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:51:48,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:48,893 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-06 22:51:48,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:51:48,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254426737] [2023-11-06 22:51:48,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254426737] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:51:48,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:51:48,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 22:51:48,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047219833] [2023-11-06 22:51:48,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:51:48,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:51:48,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:51:48,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:51:48,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:51:48,896 INFO L87 Difference]: Start difference. First operand 112 states and 148 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:51:49,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:51:49,780 INFO L93 Difference]: Finished difference Result 277 states and 366 transitions. [2023-11-06 22:51:49,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:51:49,781 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 128 [2023-11-06 22:51:49,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:51:49,783 INFO L225 Difference]: With dead ends: 277 [2023-11-06 22:51:49,783 INFO L226 Difference]: Without dead ends: 168 [2023-11-06 22:51:49,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2023-11-06 22:51:49,784 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 269 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:51:49,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 639 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:51:49,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2023-11-06 22:51:49,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 137. [2023-11-06 22:51:49,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 120 states have (on average 1.2333333333333334) internal successors, (148), 120 states have internal predecessors, (148), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-06 22:51:49,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 178 transitions. [2023-11-06 22:51:49,815 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 178 transitions. Word has length 128 [2023-11-06 22:51:49,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:51:49,815 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 178 transitions. [2023-11-06 22:51:49,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:51:49,816 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 178 transitions. [2023-11-06 22:51:49,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-11-06 22:51:49,818 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:51:49,818 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:51:49,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 22:51:49,818 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:51:49,819 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:51:49,819 INFO L85 PathProgramCache]: Analyzing trace with hash -905662791, now seen corresponding path program 1 times [2023-11-06 22:51:49,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:51:49,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085124913] [2023-11-06 22:51:49,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:49,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:51:49,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:50,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:51:50,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:50,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:51:50,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:50,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:51:50,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:50,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:51:50,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:50,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:51:50,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:50,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:51:50,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:50,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:51:50,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:50,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:51:50,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:50,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:51:50,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:50,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:51:50,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:50,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:51:50,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:50,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:51:50,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:50,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:51:50,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:50,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:51:50,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:50,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:51:50,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:50,485 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-06 22:51:50,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:51:50,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085124913] [2023-11-06 22:51:50,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085124913] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:51:50,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:51:50,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:51:50,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835150485] [2023-11-06 22:51:50,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:51:50,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:51:50,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:51:50,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:51:50,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:51:50,488 INFO L87 Difference]: Start difference. First operand 137 states and 178 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-06 22:51:50,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:51:50,959 INFO L93 Difference]: Finished difference Result 327 states and 426 transitions. [2023-11-06 22:51:50,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:51:50,960 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 129 [2023-11-06 22:51:50,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:51:50,962 INFO L225 Difference]: With dead ends: 327 [2023-11-06 22:51:50,962 INFO L226 Difference]: Without dead ends: 193 [2023-11-06 22:51:50,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-11-06 22:51:50,963 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 200 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:51:50,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 396 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:51:50,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2023-11-06 22:51:50,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 158. [2023-11-06 22:51:50,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 141 states have (on average 1.2269503546099292) internal successors, (173), 141 states have internal predecessors, (173), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-06 22:51:50,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 203 transitions. [2023-11-06 22:51:50,999 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 203 transitions. Word has length 129 [2023-11-06 22:51:51,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:51:51,000 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 203 transitions. [2023-11-06 22:51:51,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-06 22:51:51,001 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 203 transitions. [2023-11-06 22:51:51,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-11-06 22:51:51,003 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:51:51,003 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:51:51,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 22:51:51,003 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:51:51,004 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:51:51,004 INFO L85 PathProgramCache]: Analyzing trace with hash -967702405, now seen corresponding path program 1 times [2023-11-06 22:51:51,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:51:51,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482852282] [2023-11-06 22:51:51,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:51,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:51:51,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:51,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:51:51,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:51,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:51:51,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:51,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:51:51,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:51,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:51:51,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:51,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:51:51,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:51,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:51:51,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:51,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:51:51,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:51,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:51:51,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:51,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:51:51,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:51,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:51:51,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:51,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:51:51,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:51,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:51:51,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:51,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:51:51,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:51,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:51:51,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:51,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:51:51,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:51,882 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-06 22:51:51,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:51:51,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482852282] [2023-11-06 22:51:51,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482852282] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:51:51,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:51:51,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:51:51,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321023950] [2023-11-06 22:51:51,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:51:51,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:51:51,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:51:51,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:51:51,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:51:51,885 INFO L87 Difference]: Start difference. First operand 158 states and 203 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:51:52,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:51:52,350 INFO L93 Difference]: Finished difference Result 354 states and 457 transitions. [2023-11-06 22:51:52,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:51:52,351 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2023-11-06 22:51:52,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:51:52,354 INFO L225 Difference]: With dead ends: 354 [2023-11-06 22:51:52,354 INFO L226 Difference]: Without dead ends: 199 [2023-11-06 22:51:52,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:51:52,357 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 153 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:51:52,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 486 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:51:52,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2023-11-06 22:51:52,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 143. [2023-11-06 22:51:52,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 126 states have (on average 1.2222222222222223) internal successors, (154), 126 states have internal predecessors, (154), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-06 22:51:52,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 184 transitions. [2023-11-06 22:51:52,395 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 184 transitions. Word has length 129 [2023-11-06 22:51:52,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:51:52,395 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 184 transitions. [2023-11-06 22:51:52,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:51:52,396 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 184 transitions. [2023-11-06 22:51:52,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-11-06 22:51:52,398 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:51:52,398 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:51:52,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 22:51:52,398 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:51:52,399 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:51:52,399 INFO L85 PathProgramCache]: Analyzing trace with hash 829750658, now seen corresponding path program 1 times [2023-11-06 22:51:52,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:51:52,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145767845] [2023-11-06 22:51:52,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:52,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:51:52,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:53,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:51:53,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:53,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:51:53,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:53,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:51:53,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:53,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:51:53,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:53,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:51:53,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:53,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:51:53,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:53,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:51:53,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:53,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:51:53,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:53,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:51:53,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:53,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:51:53,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:53,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:51:53,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:53,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:51:53,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:53,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:51:53,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:53,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:51:53,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:53,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:51:53,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:53,113 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-06 22:51:53,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:51:53,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145767845] [2023-11-06 22:51:53,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145767845] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:51:53,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:51:53,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:51:53,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517326681] [2023-11-06 22:51:53,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:51:53,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:51:53,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:51:53,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:51:53,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:51:53,118 INFO L87 Difference]: Start difference. First operand 143 states and 184 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:51:53,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:51:53,678 INFO L93 Difference]: Finished difference Result 275 states and 354 transitions. [2023-11-06 22:51:53,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:51:53,678 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 130 [2023-11-06 22:51:53,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:51:53,681 INFO L225 Difference]: With dead ends: 275 [2023-11-06 22:51:53,681 INFO L226 Difference]: Without dead ends: 273 [2023-11-06 22:51:53,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2023-11-06 22:51:53,682 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 228 mSDsluCounter, 670 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:51:53,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 835 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:51:53,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2023-11-06 22:51:53,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 182. [2023-11-06 22:51:53,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 165 states have (on average 1.1939393939393939) internal successors, (197), 165 states have internal predecessors, (197), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-06 22:51:53,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 227 transitions. [2023-11-06 22:51:53,723 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 227 transitions. Word has length 130 [2023-11-06 22:51:53,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:51:53,723 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 227 transitions. [2023-11-06 22:51:53,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:51:53,724 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 227 transitions. [2023-11-06 22:51:53,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-11-06 22:51:53,726 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:51:53,726 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:51:53,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-06 22:51:53,726 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:51:53,727 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:51:53,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1060491747, now seen corresponding path program 1 times [2023-11-06 22:51:53,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:51:53,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729118692] [2023-11-06 22:51:53,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:53,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:51:53,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:54,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:51:54,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:54,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:51:54,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:54,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:51:54,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:54,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:51:54,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:54,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:51:54,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:54,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:51:54,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:54,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:51:54,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:54,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:51:54,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:54,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:51:54,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:54,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:51:54,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:54,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:51:54,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:54,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:51:54,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:54,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:51:54,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:54,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:51:54,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:54,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:51:54,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:54,566 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-06 22:51:54,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:51:54,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729118692] [2023-11-06 22:51:54,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729118692] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:51:54,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:51:54,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:51:54,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209922714] [2023-11-06 22:51:54,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:51:54,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:51:54,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:51:54,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:51:54,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:51:54,569 INFO L87 Difference]: Start difference. First operand 182 states and 227 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-06 22:51:55,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:51:55,114 INFO L93 Difference]: Finished difference Result 395 states and 496 transitions. [2023-11-06 22:51:55,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:51:55,115 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 130 [2023-11-06 22:51:55,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:51:55,117 INFO L225 Difference]: With dead ends: 395 [2023-11-06 22:51:55,117 INFO L226 Difference]: Without dead ends: 216 [2023-11-06 22:51:55,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-11-06 22:51:55,118 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 215 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:51:55,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 340 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:51:55,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2023-11-06 22:51:55,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 182. [2023-11-06 22:51:55,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 165 states have (on average 1.1818181818181819) internal successors, (195), 165 states have internal predecessors, (195), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-06 22:51:55,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 225 transitions. [2023-11-06 22:51:55,158 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 225 transitions. Word has length 130 [2023-11-06 22:51:55,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:51:55,158 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 225 transitions. [2023-11-06 22:51:55,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-06 22:51:55,159 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 225 transitions. [2023-11-06 22:51:55,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-11-06 22:51:55,161 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:51:55,161 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:51:55,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-06 22:51:55,161 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:51:55,162 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:51:55,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1621895359, now seen corresponding path program 1 times [2023-11-06 22:51:55,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:51:55,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341247415] [2023-11-06 22:51:55,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:55,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:51:55,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:55,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:51:55,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:55,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:51:55,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:55,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:51:55,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:55,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:51:55,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:55,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:51:55,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:55,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:51:55,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:55,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:51:55,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:55,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:51:55,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:55,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:51:55,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:55,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:51:55,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:55,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:51:55,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:55,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:51:55,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:55,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:51:55,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:55,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:51:55,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:55,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:51:55,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:55,501 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-06 22:51:55,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:51:55,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341247415] [2023-11-06 22:51:55,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341247415] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:51:55,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:51:55,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:51:55,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749828521] [2023-11-06 22:51:55,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:51:55,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:51:55,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:51:55,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:51:55,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:51:55,504 INFO L87 Difference]: Start difference. First operand 182 states and 225 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:51:55,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:51:55,750 INFO L93 Difference]: Finished difference Result 412 states and 516 transitions. [2023-11-06 22:51:55,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:51:55,751 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2023-11-06 22:51:55,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:51:55,753 INFO L225 Difference]: With dead ends: 412 [2023-11-06 22:51:55,753 INFO L226 Difference]: Without dead ends: 233 [2023-11-06 22:51:55,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:51:55,755 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 94 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:51:55,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 386 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:51:55,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2023-11-06 22:51:55,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 185. [2023-11-06 22:51:55,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 168 states have (on average 1.1785714285714286) internal successors, (198), 168 states have internal predecessors, (198), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-06 22:51:55,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 228 transitions. [2023-11-06 22:51:55,794 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 228 transitions. Word has length 131 [2023-11-06 22:51:55,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:51:55,795 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 228 transitions. [2023-11-06 22:51:55,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:51:55,795 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 228 transitions. [2023-11-06 22:51:55,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-11-06 22:51:55,798 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:51:55,798 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:51:55,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-06 22:51:55,798 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:51:55,799 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:51:55,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1228868349, now seen corresponding path program 1 times [2023-11-06 22:51:55,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:51:55,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473164362] [2023-11-06 22:51:55,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:55,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:51:55,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:55,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:51:55,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:55,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:51:55,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:56,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:51:56,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:56,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:51:56,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:56,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:51:56,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:56,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:51:56,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:56,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:51:56,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:56,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:51:56,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:56,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:51:56,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:56,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:51:56,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:56,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:51:56,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:56,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:51:56,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:56,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:51:56,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:56,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:51:56,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:56,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:51:56,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:56,029 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-06 22:51:56,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:51:56,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473164362] [2023-11-06 22:51:56,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473164362] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:51:56,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:51:56,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:51:56,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961565336] [2023-11-06 22:51:56,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:51:56,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:51:56,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:51:56,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:51:56,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:51:56,033 INFO L87 Difference]: Start difference. First operand 185 states and 228 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:51:56,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:51:56,134 INFO L93 Difference]: Finished difference Result 383 states and 475 transitions. [2023-11-06 22:51:56,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:51:56,135 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2023-11-06 22:51:56,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:51:56,137 INFO L225 Difference]: With dead ends: 383 [2023-11-06 22:51:56,137 INFO L226 Difference]: Without dead ends: 201 [2023-11-06 22:51:56,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:51:56,138 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 76 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:51:56,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 728 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:51:56,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2023-11-06 22:51:56,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 182. [2023-11-06 22:51:56,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 165 states have (on average 1.1757575757575758) internal successors, (194), 165 states have internal predecessors, (194), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-06 22:51:56,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 224 transitions. [2023-11-06 22:51:56,177 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 224 transitions. Word has length 131 [2023-11-06 22:51:56,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:51:56,179 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 224 transitions. [2023-11-06 22:51:56,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:51:56,179 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 224 transitions. [2023-11-06 22:51:56,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-11-06 22:51:56,182 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:51:56,183 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:51:56,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-06 22:51:56,183 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:51:56,183 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:51:56,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1667785729, now seen corresponding path program 1 times [2023-11-06 22:51:56,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:51:56,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83968741] [2023-11-06 22:51:56,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:56,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:51:56,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:57,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:51:57,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:57,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:51:57,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:57,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:51:57,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:57,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:51:57,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:57,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:51:57,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:57,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:51:57,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:57,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:51:57,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:57,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:51:57,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:57,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:51:57,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:57,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:51:57,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:57,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:51:57,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:57,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:51:57,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:57,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:51:57,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:57,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:51:57,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:57,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:51:57,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:57,622 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 15 proven. 27 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-11-06 22:51:57,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:51:57,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83968741] [2023-11-06 22:51:57,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83968741] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:51:57,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1079497976] [2023-11-06 22:51:57,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:57,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:51:57,623 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ab41c9d-9030-46ad-858c-27aa5846a49e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:51:57,627 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ab41c9d-9030-46ad-858c-27aa5846a49e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:51:57,645 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ab41c9d-9030-46ad-858c-27aa5846a49e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:51:57,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:57,987 INFO L262 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 60 conjunts are in the unsatisfiable core [2023-11-06 22:51:58,013 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:51:59,286 INFO L351 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-06 22:52:00,074 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-06 22:52:00,509 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-06 22:52:01,058 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-06 22:52:01,609 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-06 22:52:02,162 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-06 22:52:02,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:02,713 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2023-11-06 22:52:02,954 INFO L322 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2023-11-06 22:52:02,955 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 92 treesize of output 83 [2023-11-06 22:52:03,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:03,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:03,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:03,020 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 92 [2023-11-06 22:52:03,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:03,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:03,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:03,138 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 35 [2023-11-06 22:52:03,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:03,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:03,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:03,414 INFO L322 Elim1Store]: treesize reduction 110, result has 19.7 percent of original size [2023-11-06 22:52:03,415 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 66 treesize of output 110 [2023-11-06 22:52:03,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:03,660 INFO L322 Elim1Store]: treesize reduction 56, result has 41.1 percent of original size [2023-11-06 22:52:03,661 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 49 treesize of output 74 [2023-11-06 22:52:12,091 INFO L322 Elim1Store]: treesize reduction 116, result has 37.3 percent of original size [2023-11-06 22:52:12,092 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 1265 treesize of output 1068 [2023-11-06 22:52:34,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:34,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:34,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:34,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:34,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:34,069 INFO L322 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-11-06 22:52:34,069 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 45 [2023-11-06 22:52:34,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:34,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:34,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:34,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:34,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:34,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:34,209 INFO L322 Elim1Store]: treesize reduction 52, result has 34.2 percent of original size [2023-11-06 22:52:34,209 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 49 treesize of output 63 [2023-11-06 22:52:34,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:34,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:34,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:34,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:34,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:34,403 INFO L322 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-11-06 22:52:34,404 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 47 [2023-11-06 22:52:35,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:35,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:35,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:35,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:35,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:35,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:35,076 INFO L322 Elim1Store]: treesize reduction 52, result has 34.2 percent of original size [2023-11-06 22:52:35,077 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 73 treesize of output 83 [2023-11-06 22:52:35,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:35,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:35,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:35,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:35,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:35,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:35,437 INFO L322 Elim1Store]: treesize reduction 88, result has 36.2 percent of original size [2023-11-06 22:52:35,438 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 65 treesize of output 98 [2023-11-06 22:52:38,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:38,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:38,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:38,718 INFO L322 Elim1Store]: treesize reduction 64, result has 32.6 percent of original size [2023-11-06 22:52:38,718 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 64 treesize of output 82 [2023-11-06 22:52:38,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:38,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:38,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:38,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:38,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:38,939 INFO L322 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2023-11-06 22:52:38,939 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 47 treesize of output 55 [2023-11-06 22:52:39,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:39,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:39,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:39,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:39,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:39,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:39,502 INFO L322 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2023-11-06 22:52:39,502 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 49 treesize of output 55 [2023-11-06 22:52:39,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:39,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:39,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:39,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:39,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:39,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:39,588 INFO L322 Elim1Store]: treesize reduction 52, result has 26.8 percent of original size [2023-11-06 22:52:39,589 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 55 treesize of output 61 [2023-11-06 22:52:39,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:39,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:39,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:39,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:39,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:39,713 INFO L322 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2023-11-06 22:52:39,714 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 49 treesize of output 57 [2023-11-06 22:52:39,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:39,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:39,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:39,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:39,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:39,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:39,861 INFO L322 Elim1Store]: treesize reduction 108, result has 21.7 percent of original size [2023-11-06 22:52:39,862 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 85 treesize of output 94 [2023-11-06 22:52:39,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:39,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:39,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:39,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:39,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:39,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:39,957 INFO L322 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2023-11-06 22:52:39,958 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 73 treesize of output 75 [2023-11-06 22:52:40,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:40,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:40,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:40,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:40,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:40,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:40,040 INFO L322 Elim1Store]: treesize reduction 52, result has 26.8 percent of original size [2023-11-06 22:52:40,041 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 59 [2023-11-06 22:52:40,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:40,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:40,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:40,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:40,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:40,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:40,150 INFO L322 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2023-11-06 22:52:40,150 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 56 [2023-11-06 22:52:40,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:40,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:40,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:40,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:40,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:40,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:40,227 INFO L322 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2023-11-06 22:52:40,228 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 73 treesize of output 75 [2023-11-06 22:52:41,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:41,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:41,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:41,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:41,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:41,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:41,369 INFO L322 Elim1Store]: treesize reduction 100, result has 23.1 percent of original size [2023-11-06 22:52:41,370 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 67 treesize of output 80 [2023-11-06 22:52:43,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:43,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:43,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:43,903 INFO L351 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 36 treesize of output 23 [2023-11-06 22:52:44,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:52:44,292 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2023-11-06 22:52:44,335 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 162 proven. 125 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2023-11-06 22:52:44,335 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:52:55,954 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse5 (store |c_#memory_int| c_~WrapperStruct00_var_1_1_Pointer~0.base (store (select |c_#memory_int| c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset (select (select |c_#memory_int| c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))))) (let ((.cse6 (select .cse5 c_~WrapperStruct00_var_1_8_Pointer~0.base))) (and (forall ((v_ArrVal_950 Int) (~WrapperStruct00_var_1_11_Pointer~0.offset Int) (~WrapperStruct00_var_1_11_Pointer~0.base Int) (v_ArrVal_952 Int)) (let ((.cse0 (mod (+ (select (select .cse5 ~WrapperStruct00_var_1_11_Pointer~0.base) ~WrapperStruct00_var_1_11_Pointer~0.offset) 240) 256))) (let ((.cse2 (let ((.cse3 (let ((.cse4 (store .cse5 c_~WrapperStruct00_var_1_8_Pointer~0.base (store .cse6 c_~WrapperStruct00_var_1_8_Pointer~0.offset .cse0)))) (store .cse4 c_~WrapperStruct00_var_1_6_Pointer~0.base (store (select .cse4 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset v_ArrVal_950))))) (store .cse3 c_~WrapperStruct00_var_1_12_Pointer~0.base (store (select .cse3 c_~WrapperStruct00_var_1_12_Pointer~0.base) c_~WrapperStruct00_var_1_12_Pointer~0.offset v_ArrVal_952))))) (let ((.cse1 (select (select .cse2 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset))) (or (< 127 .cse0) (< .cse1 (+ (* 256 (div .cse1 256)) 1)) (not (= (mod (select (select .cse2 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset) 256) (mod .cse1 256)))))))) (forall ((v_ArrVal_950 Int) (~WrapperStruct00_var_1_11_Pointer~0.offset Int) (~WrapperStruct00_var_1_11_Pointer~0.base Int) (v_ArrVal_952 Int)) (let ((.cse7 (mod (+ (select (select .cse5 ~WrapperStruct00_var_1_11_Pointer~0.base) ~WrapperStruct00_var_1_11_Pointer~0.offset) 240) 256))) (let ((.cse9 (let ((.cse10 (let ((.cse11 (store .cse5 c_~WrapperStruct00_var_1_8_Pointer~0.base (store .cse6 c_~WrapperStruct00_var_1_8_Pointer~0.offset (+ (- 256) .cse7))))) (store .cse11 c_~WrapperStruct00_var_1_6_Pointer~0.base (store (select .cse11 c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset v_ArrVal_950))))) (store .cse10 c_~WrapperStruct00_var_1_12_Pointer~0.base (store (select .cse10 c_~WrapperStruct00_var_1_12_Pointer~0.base) c_~WrapperStruct00_var_1_12_Pointer~0.offset v_ArrVal_952))))) (let ((.cse8 (select (select .cse9 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset))) (or (< .cse7 128) (< .cse8 (+ (* 256 (div .cse8 256)) 1)) (not (= (mod (select (select .cse9 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset) 256) (mod .cse8 256))))))))))) is different from false [2023-11-06 22:52:56,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1079497976] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:52:56,151 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:52:56,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 26 [2023-11-06 22:52:56,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029379442] [2023-11-06 22:52:56,151 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:52:56,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-06 22:52:56,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:52:56,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-06 22:52:56,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=836, Unknown=4, NotChecked=60, Total=1056 [2023-11-06 22:52:56,155 INFO L87 Difference]: Start difference. First operand 182 states and 224 transitions. Second operand has 26 states, 24 states have (on average 5.0) internal successors, (120), 26 states have internal predecessors, (120), 9 states have call successors, (30), 4 states have call predecessors, (30), 6 states have return successors, (30), 7 states have call predecessors, (30), 9 states have call successors, (30) [2023-11-06 22:52:59,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:53:02,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:53:29,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:53:31,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:53:34,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:53:36,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:53:40,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:53:40,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:53:40,371 INFO L93 Difference]: Finished difference Result 406 states and 497 transitions. [2023-11-06 22:53:40,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-11-06 22:53:40,377 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 5.0) internal successors, (120), 26 states have internal predecessors, (120), 9 states have call successors, (30), 4 states have call predecessors, (30), 6 states have return successors, (30), 7 states have call predecessors, (30), 9 states have call successors, (30) Word has length 132 [2023-11-06 22:53:40,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:53:40,379 INFO L225 Difference]: With dead ends: 406 [2023-11-06 22:53:40,379 INFO L226 Difference]: Without dead ends: 227 [2023-11-06 22:53:40,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 182 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 834 ImplicationChecksByTransitivity, 39.6s TimeCoverageRelationStatistics Valid=823, Invalid=2827, Unknown=14, NotChecked=118, Total=3782 [2023-11-06 22:53:40,382 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 432 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 1492 mSolverCounterSat, 90 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 1589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 1492 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.8s IncrementalHoareTripleChecker+Time [2023-11-06 22:53:40,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 657 Invalid, 1589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 1492 Invalid, 7 Unknown, 0 Unchecked, 17.8s Time] [2023-11-06 22:53:40,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2023-11-06 22:53:40,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 202. [2023-11-06 22:53:40,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 166 states have (on average 1.1204819277108433) internal successors, (186), 167 states have internal predecessors, (186), 30 states have call successors, (30), 5 states have call predecessors, (30), 5 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2023-11-06 22:53:40,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 246 transitions. [2023-11-06 22:53:40,457 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 246 transitions. Word has length 132 [2023-11-06 22:53:40,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:53:40,457 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 246 transitions. [2023-11-06 22:53:40,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 5.0) internal successors, (120), 26 states have internal predecessors, (120), 9 states have call successors, (30), 4 states have call predecessors, (30), 6 states have return successors, (30), 7 states have call predecessors, (30), 9 states have call successors, (30) [2023-11-06 22:53:40,458 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 246 transitions. [2023-11-06 22:53:40,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-11-06 22:53:40,459 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:53:40,460 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:53:40,468 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ab41c9d-9030-46ad-858c-27aa5846a49e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:53:40,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ab41c9d-9030-46ad-858c-27aa5846a49e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:53:40,667 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:53:40,668 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:53:40,668 INFO L85 PathProgramCache]: Analyzing trace with hash -953934379, now seen corresponding path program 1 times [2023-11-06 22:53:40,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:53:40,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351320802] [2023-11-06 22:53:40,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:53:40,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:53:40,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:41,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:53:41,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:41,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:53:41,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:41,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:53:41,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:41,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:53:41,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:41,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:53:41,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:41,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:53:41,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:41,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:53:41,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:41,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:53:41,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:41,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:53:41,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:41,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:53:41,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:41,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:53:41,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:41,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:53:41,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:41,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:53:41,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:41,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:53:41,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:41,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:53:41,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:41,055 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-06 22:53:41,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:53:41,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351320802] [2023-11-06 22:53:41,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351320802] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:53:41,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:53:41,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:53:41,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639376437] [2023-11-06 22:53:41,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:53:41,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:53:41,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:53:41,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:53:41,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:53:41,061 INFO L87 Difference]: Start difference. First operand 202 states and 246 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:53:41,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:53:41,286 INFO L93 Difference]: Finished difference Result 350 states and 419 transitions. [2023-11-06 22:53:41,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:53:41,287 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 133 [2023-11-06 22:53:41,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:53:41,291 INFO L225 Difference]: With dead ends: 350 [2023-11-06 22:53:41,291 INFO L226 Difference]: Without dead ends: 197 [2023-11-06 22:53:41,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:53:41,293 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 27 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:53:41,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 249 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:53:41,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2023-11-06 22:53:41,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2023-11-06 22:53:41,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 161 states have (on average 1.093167701863354) internal successors, (176), 162 states have internal predecessors, (176), 30 states have call successors, (30), 5 states have call predecessors, (30), 5 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2023-11-06 22:53:41,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 236 transitions. [2023-11-06 22:53:41,375 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 236 transitions. Word has length 133 [2023-11-06 22:53:41,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:53:41,376 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 236 transitions. [2023-11-06 22:53:41,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:53:41,377 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 236 transitions. [2023-11-06 22:53:41,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-11-06 22:53:41,379 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:53:41,380 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:53:41,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-06 22:53:41,380 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:53:41,380 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:53:41,381 INFO L85 PathProgramCache]: Analyzing trace with hash -2144349097, now seen corresponding path program 1 times [2023-11-06 22:53:41,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:53:41,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802911031] [2023-11-06 22:53:41,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:53:41,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:53:41,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:41,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:53:41,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:41,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:53:41,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:41,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:53:41,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:41,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:53:41,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:41,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:53:41,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:41,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:53:41,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:41,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:53:41,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:41,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:53:41,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:41,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:53:41,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:41,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:53:41,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:41,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:53:41,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:41,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:53:41,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:41,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:53:41,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:41,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:53:41,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:41,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:53:41,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:41,634 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-06 22:53:41,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:53:41,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802911031] [2023-11-06 22:53:41,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802911031] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:53:41,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:53:41,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:53:41,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315057304] [2023-11-06 22:53:41,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:53:41,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:53:41,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:53:41,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:53:41,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:53:41,639 INFO L87 Difference]: Start difference. First operand 197 states and 236 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:53:41,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:53:41,839 INFO L93 Difference]: Finished difference Result 300 states and 358 transitions. [2023-11-06 22:53:41,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:53:41,840 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2023-11-06 22:53:41,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:53:41,841 INFO L225 Difference]: With dead ends: 300 [2023-11-06 22:53:41,841 INFO L226 Difference]: Without dead ends: 0 [2023-11-06 22:53:41,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 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-06 22:53:41,844 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 1 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:53:41,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 312 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:53:41,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-06 22:53:41,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-06 22:53:41,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:53:41,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-06 22:53:41,846 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 134 [2023-11-06 22:53:41,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:53:41,846 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-06 22:53:41,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:53:41,851 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-06 22:53:41,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-06 22:53:41,855 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 22:53:41,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-06 22:53:41,858 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-06 22:53:51,803 WARN L293 SmtUtils]: Spent 9.72s on a formula simplification. DAG size of input: 418 DAG size of output: 372 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-11-06 22:54:30,565 WARN L293 SmtUtils]: Spent 28.69s on a formula simplification. DAG size of input: 369 DAG size of output: 79 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-11-06 22:54:30,569 INFO L899 garLoopResultBuilder]: For program point L85(lines 85 89) no Hoare annotation was computed. [2023-11-06 22:54:30,569 INFO L899 garLoopResultBuilder]: For program point L85-1(lines 85 89) no Hoare annotation was computed. [2023-11-06 22:54:30,569 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-06 22:54:30,569 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-11-06 22:54:30,570 INFO L895 garLoopResultBuilder]: At program point L19-3(line 19) the Hoare annotation is: (and (let ((.cse0 (let ((.cse1 (select |#memory_int| 4))) (store .cse1 ~WrapperStruct00_var_1_8_Pointer~0.offset (let ((.cse2 (select .cse1 ~WrapperStruct00_var_1_11_Pointer~0.offset))) (+ .cse2 (- 16) (* (- 256) (div (+ .cse2 240) 256)))))))) (= (select .cse0 ~WrapperStruct00_var_1_1_Pointer~0.offset) (select .cse0 6))) (= 4 ~WrapperStruct00_var_1_12_Pointer~0.base) (not (= ~WrapperStruct00_var_1_4_Pointer~0.offset ~WrapperStruct00_var_1_12_Pointer~0.offset)) (= ~WrapperStruct00_var_1_10_Pointer~0.base 4) (not (= ~WrapperStruct00_var_1_4_Pointer~0.offset ~WrapperStruct00_var_1_8_Pointer~0.offset)) (<= 23 ~WrapperStruct00_var_1_8_Pointer~0.offset) (not (= ~WrapperStruct00_var_1_12_Pointer~0.offset ~WrapperStruct00_var_1_10_Pointer~0.offset)) (= ~WrapperStruct00_var_1_1_Pointer~0.base 4) (= |~#WrapperStruct00~0.base| 4) (= 6 ~WrapperStruct00_var_1_5_Pointer~0.offset) (<= 27 ~WrapperStruct00_var_1_12_Pointer~0.offset) (= 4 ~WrapperStruct00_var_1_8_Pointer~0.base) (<= 7 ~WrapperStruct00_var_1_6_Pointer~0.offset) (not (= ~WrapperStruct00_var_1_8_Pointer~0.offset ~WrapperStruct00_var_1_10_Pointer~0.offset)) (not (= ~WrapperStruct00_var_1_12_Pointer~0.offset ~WrapperStruct00_var_1_8_Pointer~0.offset)) (= ~WrapperStruct00_var_1_4_Pointer~0.base 4) (not (= ~WrapperStruct00_var_1_12_Pointer~0.offset ~WrapperStruct00_var_1_11_Pointer~0.offset)) (= ~WrapperStruct00_var_1_11_Pointer~0.base 4) (not (= ~WrapperStruct00_var_1_12_Pointer~0.offset ~WrapperStruct00_var_1_13_Pointer~0.offset)) (= ~WrapperStruct00_var_1_6_Pointer~0.base 4) (= |~#WrapperStruct00~0.offset| 0) (<= ~WrapperStruct00_var_1_1_Pointer~0.offset 0) (= ~WrapperStruct00_var_1_13_Pointer~0.base 4) (not (= ~WrapperStruct00_var_1_8_Pointer~0.offset ~WrapperStruct00_var_1_11_Pointer~0.offset)) (= ~WrapperStruct00_var_1_5_Pointer~0.base 4) (let ((.cse3 (select (select |#memory_int| ~WrapperStruct00_var_1_1_Pointer~0.base) ~WrapperStruct00_var_1_1_Pointer~0.offset))) (<= .cse3 (* 256 (div .cse3 256))))) [2023-11-06 22:54:30,570 INFO L895 garLoopResultBuilder]: At program point L102(line 102) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 4))) (and (<= (mod (select .cse0 6) 256) 0) (= 4 ~WrapperStruct00_var_1_12_Pointer~0.base) (not (= ~WrapperStruct00_var_1_4_Pointer~0.offset ~WrapperStruct00_var_1_12_Pointer~0.offset)) (= ~WrapperStruct00_var_1_10_Pointer~0.base 4) (not (= ~WrapperStruct00_var_1_4_Pointer~0.offset ~WrapperStruct00_var_1_8_Pointer~0.offset)) (<= 23 ~WrapperStruct00_var_1_8_Pointer~0.offset) (not (= ~WrapperStruct00_var_1_12_Pointer~0.offset ~WrapperStruct00_var_1_10_Pointer~0.offset)) (= ~last_1_WrapperStruct00_var_1_8~0 (select .cse0 23)) (= ~WrapperStruct00_var_1_1_Pointer~0.base 4) (= |~#WrapperStruct00~0.base| 4) (= 6 ~WrapperStruct00_var_1_5_Pointer~0.offset) (<= 27 ~WrapperStruct00_var_1_12_Pointer~0.offset) (= 4 ~WrapperStruct00_var_1_8_Pointer~0.base) (<= 7 ~WrapperStruct00_var_1_6_Pointer~0.offset) (not (= ~WrapperStruct00_var_1_8_Pointer~0.offset ~WrapperStruct00_var_1_10_Pointer~0.offset)) (not (= ~WrapperStruct00_var_1_12_Pointer~0.offset ~WrapperStruct00_var_1_8_Pointer~0.offset)) (= ~WrapperStruct00_var_1_4_Pointer~0.base 4) (not (= ~WrapperStruct00_var_1_12_Pointer~0.offset ~WrapperStruct00_var_1_11_Pointer~0.offset)) (= ~WrapperStruct00_var_1_11_Pointer~0.base 4) (not (= ~WrapperStruct00_var_1_12_Pointer~0.offset ~WrapperStruct00_var_1_13_Pointer~0.offset)) (= ~WrapperStruct00_var_1_6_Pointer~0.base 4) (= |~#WrapperStruct00~0.offset| 0) (<= ~WrapperStruct00_var_1_1_Pointer~0.offset 0) (= ~WrapperStruct00_var_1_13_Pointer~0.base 4) (not (= ~WrapperStruct00_var_1_8_Pointer~0.offset ~WrapperStruct00_var_1_11_Pointer~0.offset)) (= ~WrapperStruct00_var_1_5_Pointer~0.base 4))) [2023-11-06 22:54:30,570 INFO L899 garLoopResultBuilder]: For program point L102-1(line 102) no Hoare annotation was computed. [2023-11-06 22:54:30,571 INFO L895 garLoopResultBuilder]: At program point L135-2(lines 135 141) the Hoare annotation is: (and (<= (mod (select (select |#memory_int| 4) 6) 256) 0) (= 4 ~WrapperStruct00_var_1_12_Pointer~0.base) (not (= ~WrapperStruct00_var_1_4_Pointer~0.offset ~WrapperStruct00_var_1_12_Pointer~0.offset)) (= ~WrapperStruct00_var_1_10_Pointer~0.base 4) (not (= ~WrapperStruct00_var_1_4_Pointer~0.offset ~WrapperStruct00_var_1_8_Pointer~0.offset)) (<= 23 ~WrapperStruct00_var_1_8_Pointer~0.offset) (not (= ~WrapperStruct00_var_1_12_Pointer~0.offset ~WrapperStruct00_var_1_10_Pointer~0.offset)) (= ~WrapperStruct00_var_1_1_Pointer~0.base 4) (= |~#WrapperStruct00~0.base| 4) (= 6 ~WrapperStruct00_var_1_5_Pointer~0.offset) (<= 27 ~WrapperStruct00_var_1_12_Pointer~0.offset) (= 4 ~WrapperStruct00_var_1_8_Pointer~0.base) (<= 7 ~WrapperStruct00_var_1_6_Pointer~0.offset) (not (= ~WrapperStruct00_var_1_8_Pointer~0.offset ~WrapperStruct00_var_1_10_Pointer~0.offset)) (not (= ~WrapperStruct00_var_1_12_Pointer~0.offset ~WrapperStruct00_var_1_8_Pointer~0.offset)) (= ~WrapperStruct00_var_1_4_Pointer~0.base 4) (not (= ~WrapperStruct00_var_1_12_Pointer~0.offset ~WrapperStruct00_var_1_11_Pointer~0.offset)) (= ~WrapperStruct00_var_1_11_Pointer~0.base 4) (not (= ~WrapperStruct00_var_1_12_Pointer~0.offset ~WrapperStruct00_var_1_13_Pointer~0.offset)) (= ~WrapperStruct00_var_1_6_Pointer~0.base 4) (= |~#WrapperStruct00~0.offset| 0) (<= ~WrapperStruct00_var_1_1_Pointer~0.offset 0) (= ~WrapperStruct00_var_1_13_Pointer~0.base 4) (not (= ~WrapperStruct00_var_1_8_Pointer~0.offset ~WrapperStruct00_var_1_11_Pointer~0.offset)) (= ~WrapperStruct00_var_1_5_Pointer~0.base 4)) [2023-11-06 22:54:30,571 INFO L899 garLoopResultBuilder]: For program point L135-3(lines 135 141) no Hoare annotation was computed. [2023-11-06 22:54:30,571 INFO L895 garLoopResultBuilder]: At program point L119(line 119) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 4))) (and (<= (mod (select .cse0 6) 256) 0) (= 4 ~WrapperStruct00_var_1_12_Pointer~0.base) (not (= ~WrapperStruct00_var_1_4_Pointer~0.offset ~WrapperStruct00_var_1_12_Pointer~0.offset)) (= ~WrapperStruct00_var_1_10_Pointer~0.base 4) (not (= ~WrapperStruct00_var_1_4_Pointer~0.offset ~WrapperStruct00_var_1_8_Pointer~0.offset)) (<= 23 ~WrapperStruct00_var_1_8_Pointer~0.offset) (not (= ~WrapperStruct00_var_1_12_Pointer~0.offset ~WrapperStruct00_var_1_10_Pointer~0.offset)) (= ~last_1_WrapperStruct00_var_1_8~0 (select .cse0 23)) (= ~WrapperStruct00_var_1_1_Pointer~0.base 4) (= |~#WrapperStruct00~0.base| 4) (= 6 ~WrapperStruct00_var_1_5_Pointer~0.offset) (<= 27 ~WrapperStruct00_var_1_12_Pointer~0.offset) (= 4 ~WrapperStruct00_var_1_8_Pointer~0.base) (<= 7 ~WrapperStruct00_var_1_6_Pointer~0.offset) (not (= ~WrapperStruct00_var_1_8_Pointer~0.offset ~WrapperStruct00_var_1_10_Pointer~0.offset)) (not (= ~WrapperStruct00_var_1_12_Pointer~0.offset ~WrapperStruct00_var_1_8_Pointer~0.offset)) (= ~WrapperStruct00_var_1_4_Pointer~0.base 4) (not (= ~WrapperStruct00_var_1_12_Pointer~0.offset ~WrapperStruct00_var_1_11_Pointer~0.offset)) (= ~WrapperStruct00_var_1_11_Pointer~0.base 4) (not (= ~WrapperStruct00_var_1_12_Pointer~0.offset ~WrapperStruct00_var_1_13_Pointer~0.offset)) (= ~WrapperStruct00_var_1_6_Pointer~0.base 4) (= |~#WrapperStruct00~0.offset| 0) (<= ~WrapperStruct00_var_1_1_Pointer~0.offset 0) (= ~WrapperStruct00_var_1_13_Pointer~0.base 4) (not (= ~WrapperStruct00_var_1_8_Pointer~0.offset ~WrapperStruct00_var_1_11_Pointer~0.offset)) (= ~WrapperStruct00_var_1_5_Pointer~0.base 4))) [2023-11-06 22:54:30,571 INFO L899 garLoopResultBuilder]: For program point L119-1(line 119) no Hoare annotation was computed. [2023-11-06 22:54:30,571 INFO L899 garLoopResultBuilder]: For program point L86(lines 86 88) no Hoare annotation was computed. [2023-11-06 22:54:30,571 INFO L895 garLoopResultBuilder]: At program point L103(line 103) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 4))) (and (<= (mod (select .cse0 6) 256) 0) (= 4 ~WrapperStruct00_var_1_12_Pointer~0.base) (not (= ~WrapperStruct00_var_1_4_Pointer~0.offset ~WrapperStruct00_var_1_12_Pointer~0.offset)) (= ~WrapperStruct00_var_1_10_Pointer~0.base 4) (not (= ~WrapperStruct00_var_1_4_Pointer~0.offset ~WrapperStruct00_var_1_8_Pointer~0.offset)) (<= 23 ~WrapperStruct00_var_1_8_Pointer~0.offset) (not (= ~WrapperStruct00_var_1_12_Pointer~0.offset ~WrapperStruct00_var_1_10_Pointer~0.offset)) (= ~last_1_WrapperStruct00_var_1_8~0 (select .cse0 23)) (= ~WrapperStruct00_var_1_1_Pointer~0.base 4) (= |~#WrapperStruct00~0.base| 4) (= 6 ~WrapperStruct00_var_1_5_Pointer~0.offset) (<= 27 ~WrapperStruct00_var_1_12_Pointer~0.offset) (= 4 ~WrapperStruct00_var_1_8_Pointer~0.base) (<= 7 ~WrapperStruct00_var_1_6_Pointer~0.offset) (not (= ~WrapperStruct00_var_1_8_Pointer~0.offset ~WrapperStruct00_var_1_10_Pointer~0.offset)) (not (= ~WrapperStruct00_var_1_12_Pointer~0.offset ~WrapperStruct00_var_1_8_Pointer~0.offset)) (= ~WrapperStruct00_var_1_4_Pointer~0.base 4) (not (= ~WrapperStruct00_var_1_12_Pointer~0.offset ~WrapperStruct00_var_1_11_Pointer~0.offset)) (= ~WrapperStruct00_var_1_11_Pointer~0.base 4) (not (= ~WrapperStruct00_var_1_12_Pointer~0.offset ~WrapperStruct00_var_1_13_Pointer~0.offset)) (= ~WrapperStruct00_var_1_6_Pointer~0.base 4) (= |~#WrapperStruct00~0.offset| 0) (<= ~WrapperStruct00_var_1_1_Pointer~0.offset 0) (= ~WrapperStruct00_var_1_13_Pointer~0.base 4) (not (= ~WrapperStruct00_var_1_8_Pointer~0.offset ~WrapperStruct00_var_1_11_Pointer~0.offset)) (= ~WrapperStruct00_var_1_5_Pointer~0.base 4))) [2023-11-06 22:54:30,572 INFO L899 garLoopResultBuilder]: For program point L103-1(line 103) no Hoare annotation was computed. [2023-11-06 22:54:30,572 INFO L895 garLoopResultBuilder]: At program point L120(line 120) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 4))) (and (<= (mod (select .cse0 6) 256) 0) (= 4 ~WrapperStruct00_var_1_12_Pointer~0.base) (not (= ~WrapperStruct00_var_1_4_Pointer~0.offset ~WrapperStruct00_var_1_12_Pointer~0.offset)) (= ~WrapperStruct00_var_1_10_Pointer~0.base 4) (not (= ~WrapperStruct00_var_1_4_Pointer~0.offset ~WrapperStruct00_var_1_8_Pointer~0.offset)) (<= 23 ~WrapperStruct00_var_1_8_Pointer~0.offset) (not (= ~WrapperStruct00_var_1_12_Pointer~0.offset ~WrapperStruct00_var_1_10_Pointer~0.offset)) (= ~last_1_WrapperStruct00_var_1_8~0 (select .cse0 23)) (= ~WrapperStruct00_var_1_1_Pointer~0.base 4) (= |~#WrapperStruct00~0.base| 4) (= 6 ~WrapperStruct00_var_1_5_Pointer~0.offset) (<= 27 ~WrapperStruct00_var_1_12_Pointer~0.offset) (= 4 ~WrapperStruct00_var_1_8_Pointer~0.base) (<= 7 ~WrapperStruct00_var_1_6_Pointer~0.offset) (not (= ~WrapperStruct00_var_1_8_Pointer~0.offset ~WrapperStruct00_var_1_10_Pointer~0.offset)) (not (= ~WrapperStruct00_var_1_12_Pointer~0.offset ~WrapperStruct00_var_1_8_Pointer~0.offset)) (= ~WrapperStruct00_var_1_4_Pointer~0.base 4) (not (= ~WrapperStruct00_var_1_12_Pointer~0.offset ~WrapperStruct00_var_1_11_Pointer~0.offset)) (= ~WrapperStruct00_var_1_11_Pointer~0.base 4) (not (= ~WrapperStruct00_var_1_12_Pointer~0.offset ~WrapperStruct00_var_1_13_Pointer~0.offset)) (= ~WrapperStruct00_var_1_6_Pointer~0.base 4) (= |~#WrapperStruct00~0.offset| 0) (<= ~WrapperStruct00_var_1_1_Pointer~0.offset 0) (= ~WrapperStruct00_var_1_13_Pointer~0.base 4) (not (= ~WrapperStruct00_var_1_8_Pointer~0.offset ~WrapperStruct00_var_1_11_Pointer~0.offset)) (= ~WrapperStruct00_var_1_5_Pointer~0.base 4))) [2023-11-06 22:54:30,572 INFO L899 garLoopResultBuilder]: For program point L120-1(line 120) no Hoare annotation was computed. [2023-11-06 22:54:30,572 INFO L899 garLoopResultBuilder]: For program point L87(line 87) no Hoare annotation was computed. [2023-11-06 22:54:30,572 INFO L899 garLoopResultBuilder]: For program point L87-2(line 87) no Hoare annotation was computed. [2023-11-06 22:54:30,572 INFO L895 garLoopResultBuilder]: At program point L105(line 105) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 4))) (and (<= (mod (select .cse0 6) 256) 0) (= 4 ~WrapperStruct00_var_1_12_Pointer~0.base) (not (= ~WrapperStruct00_var_1_4_Pointer~0.offset ~WrapperStruct00_var_1_12_Pointer~0.offset)) (= ~WrapperStruct00_var_1_10_Pointer~0.base 4) (not (= ~WrapperStruct00_var_1_4_Pointer~0.offset ~WrapperStruct00_var_1_8_Pointer~0.offset)) (<= 23 ~WrapperStruct00_var_1_8_Pointer~0.offset) (not (= ~WrapperStruct00_var_1_12_Pointer~0.offset ~WrapperStruct00_var_1_10_Pointer~0.offset)) (= ~last_1_WrapperStruct00_var_1_8~0 (select .cse0 23)) (= ~WrapperStruct00_var_1_1_Pointer~0.base 4) (= |~#WrapperStruct00~0.base| 4) (= 6 ~WrapperStruct00_var_1_5_Pointer~0.offset) (<= 27 ~WrapperStruct00_var_1_12_Pointer~0.offset) (= 4 ~WrapperStruct00_var_1_8_Pointer~0.base) (<= 7 ~WrapperStruct00_var_1_6_Pointer~0.offset) (not (= ~WrapperStruct00_var_1_8_Pointer~0.offset ~WrapperStruct00_var_1_10_Pointer~0.offset)) (not (= ~WrapperStruct00_var_1_12_Pointer~0.offset ~WrapperStruct00_var_1_8_Pointer~0.offset)) (= ~WrapperStruct00_var_1_4_Pointer~0.base 4) (not (= ~WrapperStruct00_var_1_12_Pointer~0.offset ~WrapperStruct00_var_1_11_Pointer~0.offset)) (= ~WrapperStruct00_var_1_11_Pointer~0.base 4) (not (= ~WrapperStruct00_var_1_12_Pointer~0.offset ~WrapperStruct00_var_1_13_Pointer~0.offset)) (= ~WrapperStruct00_var_1_6_Pointer~0.base 4) (= |~#WrapperStruct00~0.offset| 0) (<= ~WrapperStruct00_var_1_1_Pointer~0.offset 0) (= ~WrapperStruct00_var_1_13_Pointer~0.base 4) (not (= ~WrapperStruct00_var_1_8_Pointer~0.offset ~WrapperStruct00_var_1_11_Pointer~0.offset)) (= ~WrapperStruct00_var_1_5_Pointer~0.base 4))) [2023-11-06 22:54:30,573 INFO L899 garLoopResultBuilder]: For program point L105-1(line 105) no Hoare annotation was computed. [2023-11-06 22:54:30,573 INFO L895 garLoopResultBuilder]: At program point L122(line 122) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 4))) (and (<= (mod (select .cse0 6) 256) 0) (= 4 ~WrapperStruct00_var_1_12_Pointer~0.base) (not (= ~WrapperStruct00_var_1_4_Pointer~0.offset ~WrapperStruct00_var_1_12_Pointer~0.offset)) (= ~WrapperStruct00_var_1_10_Pointer~0.base 4) (not (= ~WrapperStruct00_var_1_4_Pointer~0.offset ~WrapperStruct00_var_1_8_Pointer~0.offset)) (<= 23 ~WrapperStruct00_var_1_8_Pointer~0.offset) (not (= ~WrapperStruct00_var_1_12_Pointer~0.offset ~WrapperStruct00_var_1_10_Pointer~0.offset)) (= ~last_1_WrapperStruct00_var_1_8~0 (select .cse0 23)) (= ~WrapperStruct00_var_1_1_Pointer~0.base 4) (= |~#WrapperStruct00~0.base| 4) (= 6 ~WrapperStruct00_var_1_5_Pointer~0.offset) (<= 27 ~WrapperStruct00_var_1_12_Pointer~0.offset) (= 4 ~WrapperStruct00_var_1_8_Pointer~0.base) (<= 7 ~WrapperStruct00_var_1_6_Pointer~0.offset) (not (= ~WrapperStruct00_var_1_8_Pointer~0.offset ~WrapperStruct00_var_1_10_Pointer~0.offset)) (not (= ~WrapperStruct00_var_1_12_Pointer~0.offset ~WrapperStruct00_var_1_8_Pointer~0.offset)) (= ~WrapperStruct00_var_1_4_Pointer~0.base 4) (not (= ~WrapperStruct00_var_1_12_Pointer~0.offset ~WrapperStruct00_var_1_11_Pointer~0.offset)) (= ~WrapperStruct00_var_1_11_Pointer~0.base 4) (not (= ~WrapperStruct00_var_1_12_Pointer~0.offset ~WrapperStruct00_var_1_13_Pointer~0.offset)) (= ~WrapperStruct00_var_1_6_Pointer~0.base 4) (= |~#WrapperStruct00~0.offset| 0) (<= ~WrapperStruct00_var_1_1_Pointer~0.offset 0) (= ~WrapperStruct00_var_1_13_Pointer~0.base 4) (not (= ~WrapperStruct00_var_1_8_Pointer~0.offset ~WrapperStruct00_var_1_11_Pointer~0.offset)) (= ~WrapperStruct00_var_1_5_Pointer~0.base 4))) [2023-11-06 22:54:30,573 INFO L899 garLoopResultBuilder]: For program point L122-1(line 122) no Hoare annotation was computed. [2023-11-06 22:54:30,573 INFO L895 garLoopResultBuilder]: At program point L106(line 106) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 4))) (and (<= (mod (select .cse0 6) 256) 0) (= 4 ~WrapperStruct00_var_1_12_Pointer~0.base) (not (= ~WrapperStruct00_var_1_4_Pointer~0.offset ~WrapperStruct00_var_1_12_Pointer~0.offset)) (= ~WrapperStruct00_var_1_10_Pointer~0.base 4) (not (= ~WrapperStruct00_var_1_4_Pointer~0.offset ~WrapperStruct00_var_1_8_Pointer~0.offset)) (<= 23 ~WrapperStruct00_var_1_8_Pointer~0.offset) (not (= ~WrapperStruct00_var_1_12_Pointer~0.offset ~WrapperStruct00_var_1_10_Pointer~0.offset)) (= ~last_1_WrapperStruct00_var_1_8~0 (select .cse0 23)) (= ~WrapperStruct00_var_1_1_Pointer~0.base 4) (= |~#WrapperStruct00~0.base| 4) (= 6 ~WrapperStruct00_var_1_5_Pointer~0.offset) (<= 27 ~WrapperStruct00_var_1_12_Pointer~0.offset) (= 4 ~WrapperStruct00_var_1_8_Pointer~0.base) (<= 7 ~WrapperStruct00_var_1_6_Pointer~0.offset) (not (= ~WrapperStruct00_var_1_8_Pointer~0.offset ~WrapperStruct00_var_1_10_Pointer~0.offset)) (not (= ~WrapperStruct00_var_1_12_Pointer~0.offset ~WrapperStruct00_var_1_8_Pointer~0.offset)) (= ~WrapperStruct00_var_1_4_Pointer~0.base 4) (not (= ~WrapperStruct00_var_1_12_Pointer~0.offset ~WrapperStruct00_var_1_11_Pointer~0.offset)) (= ~WrapperStruct00_var_1_11_Pointer~0.base 4) (not (= ~WrapperStruct00_var_1_12_Pointer~0.offset ~WrapperStruct00_var_1_13_Pointer~0.offset)) (= ~WrapperStruct00_var_1_6_Pointer~0.base 4) (= |~#WrapperStruct00~0.offset| 0) (<= ~WrapperStruct00_var_1_1_Pointer~0.offset 0) (= ~WrapperStruct00_var_1_13_Pointer~0.base 4) (not (= ~WrapperStruct00_var_1_8_Pointer~0.offset ~WrapperStruct00_var_1_11_Pointer~0.offset)) (= ~WrapperStruct00_var_1_5_Pointer~0.base 4))) [2023-11-06 22:54:30,573 INFO L899 garLoopResultBuilder]: For program point L106-1(line 106) no Hoare annotation was computed. [2023-11-06 22:54:30,574 INFO L899 garLoopResultBuilder]: For program point L73(lines 73 83) no Hoare annotation was computed. [2023-11-06 22:54:30,574 INFO L895 garLoopResultBuilder]: At program point L123(line 123) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 4))) (and (<= (mod (select .cse0 6) 256) 0) (= 4 ~WrapperStruct00_var_1_12_Pointer~0.base) (not (= ~WrapperStruct00_var_1_4_Pointer~0.offset ~WrapperStruct00_var_1_12_Pointer~0.offset)) (= ~WrapperStruct00_var_1_10_Pointer~0.base 4) (not (= ~WrapperStruct00_var_1_4_Pointer~0.offset ~WrapperStruct00_var_1_8_Pointer~0.offset)) (<= 23 ~WrapperStruct00_var_1_8_Pointer~0.offset) (not (= ~WrapperStruct00_var_1_12_Pointer~0.offset ~WrapperStruct00_var_1_10_Pointer~0.offset)) (= ~last_1_WrapperStruct00_var_1_8~0 (select .cse0 23)) (= ~WrapperStruct00_var_1_1_Pointer~0.base 4) (= |~#WrapperStruct00~0.base| 4) (= 6 ~WrapperStruct00_var_1_5_Pointer~0.offset) (<= 27 ~WrapperStruct00_var_1_12_Pointer~0.offset) (= 4 ~WrapperStruct00_var_1_8_Pointer~0.base) (<= 7 ~WrapperStruct00_var_1_6_Pointer~0.offset) (not (= ~WrapperStruct00_var_1_8_Pointer~0.offset ~WrapperStruct00_var_1_10_Pointer~0.offset)) (not (= ~WrapperStruct00_var_1_12_Pointer~0.offset ~WrapperStruct00_var_1_8_Pointer~0.offset)) (= ~WrapperStruct00_var_1_4_Pointer~0.base 4) (not (= ~WrapperStruct00_var_1_12_Pointer~0.offset ~WrapperStruct00_var_1_11_Pointer~0.offset)) (= ~WrapperStruct00_var_1_11_Pointer~0.base 4) (not (= ~WrapperStruct00_var_1_12_Pointer~0.offset ~WrapperStruct00_var_1_13_Pointer~0.offset)) (= ~WrapperStruct00_var_1_6_Pointer~0.base 4) (= |~#WrapperStruct00~0.offset| 0) (<= ~WrapperStruct00_var_1_1_Pointer~0.offset 0) (= ~WrapperStruct00_var_1_13_Pointer~0.base 4) (not (= ~WrapperStruct00_var_1_8_Pointer~0.offset ~WrapperStruct00_var_1_11_Pointer~0.offset)) (= ~WrapperStruct00_var_1_5_Pointer~0.base 4))) [2023-11-06 22:54:30,574 INFO L899 garLoopResultBuilder]: For program point L123-1(line 123) no Hoare annotation was computed. [2023-11-06 22:54:30,574 INFO L899 garLoopResultBuilder]: For program point L90(lines 90 98) no Hoare annotation was computed. [2023-11-06 22:54:30,575 INFO L895 garLoopResultBuilder]: At program point property_returnLabel#1(lines 128 131) the Hoare annotation is: (let ((.cse1 (select |#memory_int| 4))) (and (let ((.cse0 (store .cse1 ~WrapperStruct00_var_1_8_Pointer~0.offset (let ((.cse2 (select .cse1 ~WrapperStruct00_var_1_11_Pointer~0.offset))) (+ .cse2 (- 16) (* (- 256) (div (+ .cse2 240) 256))))))) (= (select .cse0 ~WrapperStruct00_var_1_1_Pointer~0.offset) (select .cse0 6))) (= 4 ~WrapperStruct00_var_1_12_Pointer~0.base) (not (= ~WrapperStruct00_var_1_4_Pointer~0.offset ~WrapperStruct00_var_1_12_Pointer~0.offset)) (<= 1 |ULTIMATE.start_property_#res#1|) (= ~WrapperStruct00_var_1_10_Pointer~0.base 4) (not (= ~WrapperStruct00_var_1_4_Pointer~0.offset ~WrapperStruct00_var_1_8_Pointer~0.offset)) (<= 23 ~WrapperStruct00_var_1_8_Pointer~0.offset) (not (= ~WrapperStruct00_var_1_12_Pointer~0.offset ~WrapperStruct00_var_1_10_Pointer~0.offset)) (= ~WrapperStruct00_var_1_1_Pointer~0.base 4) (= |~#WrapperStruct00~0.base| 4) (= 6 ~WrapperStruct00_var_1_5_Pointer~0.offset) (<= 27 ~WrapperStruct00_var_1_12_Pointer~0.offset) (= 4 ~WrapperStruct00_var_1_8_Pointer~0.base) (<= 7 ~WrapperStruct00_var_1_6_Pointer~0.offset) (not (= ~WrapperStruct00_var_1_8_Pointer~0.offset ~WrapperStruct00_var_1_10_Pointer~0.offset)) (not (= ~WrapperStruct00_var_1_12_Pointer~0.offset ~WrapperStruct00_var_1_8_Pointer~0.offset)) (= ~WrapperStruct00_var_1_4_Pointer~0.base 4) (let ((.cse3 (select .cse1 ~WrapperStruct00_var_1_1_Pointer~0.offset))) (<= .cse3 (* 256 (div .cse3 256)))) (not (= ~WrapperStruct00_var_1_12_Pointer~0.offset ~WrapperStruct00_var_1_11_Pointer~0.offset)) (= ~WrapperStruct00_var_1_11_Pointer~0.base 4) (not (= ~WrapperStruct00_var_1_12_Pointer~0.offset ~WrapperStruct00_var_1_13_Pointer~0.offset)) (= ~WrapperStruct00_var_1_6_Pointer~0.base 4) (= |~#WrapperStruct00~0.offset| 0) (<= ~WrapperStruct00_var_1_1_Pointer~0.offset 0) (= ~WrapperStruct00_var_1_13_Pointer~0.base 4) (= (select .cse1 ~WrapperStruct00_var_1_12_Pointer~0.offset) (select .cse1 ~WrapperStruct00_var_1_13_Pointer~0.offset)) (not (= ~WrapperStruct00_var_1_8_Pointer~0.offset ~WrapperStruct00_var_1_11_Pointer~0.offset)) (= ~WrapperStruct00_var_1_5_Pointer~0.base 4))) [2023-11-06 22:54:30,575 INFO L899 garLoopResultBuilder]: For program point L74(line 74) no Hoare annotation was computed. [2023-11-06 22:54:30,575 INFO L899 garLoopResultBuilder]: For program point L74-2(line 74) no Hoare annotation was computed. [2023-11-06 22:54:30,575 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-06 22:54:30,575 INFO L899 garLoopResultBuilder]: For program point L91(line 91) no Hoare annotation was computed. [2023-11-06 22:54:30,575 INFO L899 garLoopResultBuilder]: For program point L91-2(lines 91 95) no Hoare annotation was computed. [2023-11-06 22:54:30,576 INFO L895 garLoopResultBuilder]: At program point L108(line 108) the Hoare annotation is: (and (= 4 ~WrapperStruct00_var_1_12_Pointer~0.base) (not (= ~WrapperStruct00_var_1_4_Pointer~0.offset ~WrapperStruct00_var_1_12_Pointer~0.offset)) (= ~WrapperStruct00_var_1_10_Pointer~0.base 4) (not (= ~WrapperStruct00_var_1_4_Pointer~0.offset ~WrapperStruct00_var_1_8_Pointer~0.offset)) (<= 23 ~WrapperStruct00_var_1_8_Pointer~0.offset) (not (= ~WrapperStruct00_var_1_12_Pointer~0.offset ~WrapperStruct00_var_1_10_Pointer~0.offset)) (= ~last_1_WrapperStruct00_var_1_8~0 (select (select |#memory_int| 4) 23)) (= ~WrapperStruct00_var_1_1_Pointer~0.base 4) (= |~#WrapperStruct00~0.base| 4) (= 6 ~WrapperStruct00_var_1_5_Pointer~0.offset) (<= 27 ~WrapperStruct00_var_1_12_Pointer~0.offset) (= 4 ~WrapperStruct00_var_1_8_Pointer~0.base) (<= 7 ~WrapperStruct00_var_1_6_Pointer~0.offset) (not (= ~WrapperStruct00_var_1_8_Pointer~0.offset ~WrapperStruct00_var_1_10_Pointer~0.offset)) (not (= ~WrapperStruct00_var_1_12_Pointer~0.offset ~WrapperStruct00_var_1_8_Pointer~0.offset)) (= ~WrapperStruct00_var_1_4_Pointer~0.base 4) (not (= ~WrapperStruct00_var_1_12_Pointer~0.offset ~WrapperStruct00_var_1_11_Pointer~0.offset)) (= ~WrapperStruct00_var_1_11_Pointer~0.base 4) (not (= ~WrapperStruct00_var_1_12_Pointer~0.offset ~WrapperStruct00_var_1_13_Pointer~0.offset)) (= ~WrapperStruct00_var_1_6_Pointer~0.base 4) (= |~#WrapperStruct00~0.offset| 0) (<= ~WrapperStruct00_var_1_1_Pointer~0.offset 0) (= ~WrapperStruct00_var_1_13_Pointer~0.base 4) (not (= ~WrapperStruct00_var_1_8_Pointer~0.offset ~WrapperStruct00_var_1_11_Pointer~0.offset)) (= ~WrapperStruct00_var_1_5_Pointer~0.base 4)) [2023-11-06 22:54:30,576 INFO L899 garLoopResultBuilder]: For program point L108-1(line 108) no Hoare annotation was computed. [2023-11-06 22:54:30,576 INFO L899 garLoopResultBuilder]: For program point L125(lines 125 127) no Hoare annotation was computed. [2023-11-06 22:54:30,576 INFO L899 garLoopResultBuilder]: For program point L92(line 92) no Hoare annotation was computed. [2023-11-06 22:54:30,576 INFO L899 garLoopResultBuilder]: For program point L92-2(line 92) no Hoare annotation was computed. [2023-11-06 22:54:30,576 INFO L895 garLoopResultBuilder]: At program point L109(line 109) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 4))) (and (= 4 ~WrapperStruct00_var_1_12_Pointer~0.base) (not (= ~WrapperStruct00_var_1_4_Pointer~0.offset ~WrapperStruct00_var_1_12_Pointer~0.offset)) (= ~WrapperStruct00_var_1_10_Pointer~0.base 4) (not (= ~WrapperStruct00_var_1_4_Pointer~0.offset ~WrapperStruct00_var_1_8_Pointer~0.offset)) (<= 23 ~WrapperStruct00_var_1_8_Pointer~0.offset) (not (= ~WrapperStruct00_var_1_12_Pointer~0.offset ~WrapperStruct00_var_1_10_Pointer~0.offset)) (= ~last_1_WrapperStruct00_var_1_8~0 (select .cse0 23)) (= ~WrapperStruct00_var_1_1_Pointer~0.base 4) (= |~#WrapperStruct00~0.base| 4) (= 6 ~WrapperStruct00_var_1_5_Pointer~0.offset) (<= 27 ~WrapperStruct00_var_1_12_Pointer~0.offset) (= 4 ~WrapperStruct00_var_1_8_Pointer~0.base) (<= 7 ~WrapperStruct00_var_1_6_Pointer~0.offset) (not (= ~WrapperStruct00_var_1_8_Pointer~0.offset ~WrapperStruct00_var_1_10_Pointer~0.offset)) (not (= ~WrapperStruct00_var_1_12_Pointer~0.offset ~WrapperStruct00_var_1_8_Pointer~0.offset)) (= ~WrapperStruct00_var_1_4_Pointer~0.base 4) (not (= ~WrapperStruct00_var_1_12_Pointer~0.offset ~WrapperStruct00_var_1_11_Pointer~0.offset)) (= ~WrapperStruct00_var_1_11_Pointer~0.base 4) (not (= ~WrapperStruct00_var_1_12_Pointer~0.offset ~WrapperStruct00_var_1_13_Pointer~0.offset)) (= |ULTIMATE.start_updateVariables_#t~mem40#1| (select .cse0 6)) (= ~WrapperStruct00_var_1_6_Pointer~0.base 4) (= |~#WrapperStruct00~0.offset| 0) (<= ~WrapperStruct00_var_1_1_Pointer~0.offset 0) (= ~WrapperStruct00_var_1_13_Pointer~0.base 4) (not (= ~WrapperStruct00_var_1_8_Pointer~0.offset ~WrapperStruct00_var_1_11_Pointer~0.offset)) (= ~WrapperStruct00_var_1_5_Pointer~0.base 4))) [2023-11-06 22:54:30,576 INFO L899 garLoopResultBuilder]: For program point L109-1(line 109) no Hoare annotation was computed. [2023-11-06 22:54:30,577 INFO L899 garLoopResultBuilder]: For program point L76(lines 76 82) no Hoare annotation was computed. [2023-11-06 22:54:30,577 INFO L895 garLoopResultBuilder]: At program point main_returnLabel#1(lines 132 143) the Hoare annotation is: false [2023-11-06 22:54:30,577 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-06 22:54:30,577 INFO L899 garLoopResultBuilder]: For program point L111(line 111) no Hoare annotation was computed. [2023-11-06 22:54:30,577 INFO L899 garLoopResultBuilder]: For program point L111-2(line 111) no Hoare annotation was computed. [2023-11-06 22:54:30,577 INFO L899 garLoopResultBuilder]: For program point L111-3(line 111) no Hoare annotation was computed. [2023-11-06 22:54:30,577 INFO L899 garLoopResultBuilder]: For program point L111-5(line 111) no Hoare annotation was computed. [2023-11-06 22:54:30,578 INFO L899 garLoopResultBuilder]: For program point L111-7(line 111) no Hoare annotation was computed. [2023-11-06 22:54:30,578 INFO L895 garLoopResultBuilder]: At program point L111-8(line 111) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 4))) (and (<= (mod (select .cse0 6) 256) 0) (= 4 ~WrapperStruct00_var_1_12_Pointer~0.base) (not (= ~WrapperStruct00_var_1_4_Pointer~0.offset ~WrapperStruct00_var_1_12_Pointer~0.offset)) (= ~WrapperStruct00_var_1_10_Pointer~0.base 4) (not (= ~WrapperStruct00_var_1_4_Pointer~0.offset ~WrapperStruct00_var_1_8_Pointer~0.offset)) (<= 23 ~WrapperStruct00_var_1_8_Pointer~0.offset) (not (= ~WrapperStruct00_var_1_12_Pointer~0.offset ~WrapperStruct00_var_1_10_Pointer~0.offset)) (= ~last_1_WrapperStruct00_var_1_8~0 (select .cse0 23)) (= ~WrapperStruct00_var_1_1_Pointer~0.base 4) (= |~#WrapperStruct00~0.base| 4) (= 6 ~WrapperStruct00_var_1_5_Pointer~0.offset) (<= 27 ~WrapperStruct00_var_1_12_Pointer~0.offset) (= 4 ~WrapperStruct00_var_1_8_Pointer~0.base) (<= 7 ~WrapperStruct00_var_1_6_Pointer~0.offset) (not (= ~WrapperStruct00_var_1_8_Pointer~0.offset ~WrapperStruct00_var_1_10_Pointer~0.offset)) (not (= ~WrapperStruct00_var_1_12_Pointer~0.offset ~WrapperStruct00_var_1_8_Pointer~0.offset)) (= ~WrapperStruct00_var_1_4_Pointer~0.base 4) (not (= ~WrapperStruct00_var_1_12_Pointer~0.offset ~WrapperStruct00_var_1_11_Pointer~0.offset)) (= ~WrapperStruct00_var_1_11_Pointer~0.base 4) (not (= ~WrapperStruct00_var_1_12_Pointer~0.offset ~WrapperStruct00_var_1_13_Pointer~0.offset)) (= ~WrapperStruct00_var_1_6_Pointer~0.base 4) (= |~#WrapperStruct00~0.offset| 0) (<= ~WrapperStruct00_var_1_1_Pointer~0.offset 0) (= ~WrapperStruct00_var_1_13_Pointer~0.base 4) (not (= ~WrapperStruct00_var_1_8_Pointer~0.offset ~WrapperStruct00_var_1_11_Pointer~0.offset)) (= ~WrapperStruct00_var_1_5_Pointer~0.base 4))) [2023-11-06 22:54:30,578 INFO L899 garLoopResultBuilder]: For program point L111-9(line 111) no Hoare annotation was computed. [2023-11-06 22:54:30,578 INFO L899 garLoopResultBuilder]: For program point L79(lines 79 81) no Hoare annotation was computed. [2023-11-06 22:54:30,578 INFO L899 garLoopResultBuilder]: For program point L79-2(lines 73 83) no Hoare annotation was computed. [2023-11-06 22:54:30,579 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-06 22:54:30,579 INFO L899 garLoopResultBuilder]: For program point L129(line 129) no Hoare annotation was computed. [2023-11-06 22:54:30,579 INFO L899 garLoopResultBuilder]: For program point L129-2(line 129) no Hoare annotation was computed. [2023-11-06 22:54:30,579 INFO L899 garLoopResultBuilder]: For program point L129-3(line 129) no Hoare annotation was computed. [2023-11-06 22:54:30,579 INFO L899 garLoopResultBuilder]: For program point L129-4(line 129) no Hoare annotation was computed. [2023-11-06 22:54:30,579 INFO L899 garLoopResultBuilder]: For program point L129-5(line 129) no Hoare annotation was computed. [2023-11-06 22:54:30,579 INFO L899 garLoopResultBuilder]: For program point L129-6(line 129) no Hoare annotation was computed. [2023-11-06 22:54:30,579 INFO L899 garLoopResultBuilder]: For program point L129-8(line 129) no Hoare annotation was computed. [2023-11-06 22:54:30,580 INFO L899 garLoopResultBuilder]: For program point L129-10(line 129) no Hoare annotation was computed. [2023-11-06 22:54:30,580 INFO L899 garLoopResultBuilder]: For program point L129-12(line 129) no Hoare annotation was computed. [2023-11-06 22:54:30,580 INFO L899 garLoopResultBuilder]: For program point L129-14(line 129) no Hoare annotation was computed. [2023-11-06 22:54:30,580 INFO L899 garLoopResultBuilder]: For program point L129-15(line 129) no Hoare annotation was computed. [2023-11-06 22:54:30,580 INFO L895 garLoopResultBuilder]: At program point L113(line 113) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 4))) (and (<= (mod (select .cse0 6) 256) 0) (= 4 ~WrapperStruct00_var_1_12_Pointer~0.base) (not (= ~WrapperStruct00_var_1_4_Pointer~0.offset ~WrapperStruct00_var_1_12_Pointer~0.offset)) (= ~WrapperStruct00_var_1_10_Pointer~0.base 4) (not (= ~WrapperStruct00_var_1_4_Pointer~0.offset ~WrapperStruct00_var_1_8_Pointer~0.offset)) (<= 23 ~WrapperStruct00_var_1_8_Pointer~0.offset) (not (= ~WrapperStruct00_var_1_12_Pointer~0.offset ~WrapperStruct00_var_1_10_Pointer~0.offset)) (= ~last_1_WrapperStruct00_var_1_8~0 (select .cse0 23)) (= ~WrapperStruct00_var_1_1_Pointer~0.base 4) (= |~#WrapperStruct00~0.base| 4) (= 6 ~WrapperStruct00_var_1_5_Pointer~0.offset) (<= 27 ~WrapperStruct00_var_1_12_Pointer~0.offset) (= 4 ~WrapperStruct00_var_1_8_Pointer~0.base) (<= 7 ~WrapperStruct00_var_1_6_Pointer~0.offset) (not (= ~WrapperStruct00_var_1_8_Pointer~0.offset ~WrapperStruct00_var_1_10_Pointer~0.offset)) (not (= ~WrapperStruct00_var_1_12_Pointer~0.offset ~WrapperStruct00_var_1_8_Pointer~0.offset)) (= ~WrapperStruct00_var_1_4_Pointer~0.base 4) (not (= ~WrapperStruct00_var_1_12_Pointer~0.offset ~WrapperStruct00_var_1_11_Pointer~0.offset)) (= ~WrapperStruct00_var_1_11_Pointer~0.base 4) (not (= ~WrapperStruct00_var_1_12_Pointer~0.offset ~WrapperStruct00_var_1_13_Pointer~0.offset)) (= ~WrapperStruct00_var_1_6_Pointer~0.base 4) (= |~#WrapperStruct00~0.offset| 0) (<= ~WrapperStruct00_var_1_1_Pointer~0.offset 0) (= ~WrapperStruct00_var_1_13_Pointer~0.base 4) (not (= ~WrapperStruct00_var_1_8_Pointer~0.offset ~WrapperStruct00_var_1_11_Pointer~0.offset)) (= ~WrapperStruct00_var_1_5_Pointer~0.base 4))) [2023-11-06 22:54:30,580 INFO L899 garLoopResultBuilder]: For program point L129-16(line 129) no Hoare annotation was computed. [2023-11-06 22:54:30,580 INFO L899 garLoopResultBuilder]: For program point L113-1(line 113) no Hoare annotation was computed. [2023-11-06 22:54:30,581 INFO L899 garLoopResultBuilder]: For program point L129-17(line 129) no Hoare annotation was computed. [2023-11-06 22:54:30,581 INFO L899 garLoopResultBuilder]: For program point L129-19(line 129) no Hoare annotation was computed. [2023-11-06 22:54:30,581 INFO L899 garLoopResultBuilder]: For program point L129-21(line 129) no Hoare annotation was computed. [2023-11-06 22:54:30,581 INFO L899 garLoopResultBuilder]: For program point L129-23(line 129) no Hoare annotation was computed. [2023-11-06 22:54:30,581 INFO L899 garLoopResultBuilder]: For program point L129-25(line 129) no Hoare annotation was computed. [2023-11-06 22:54:30,581 INFO L899 garLoopResultBuilder]: For program point L129-26(line 129) no Hoare annotation was computed. [2023-11-06 22:54:30,581 INFO L899 garLoopResultBuilder]: For program point L129-27(line 129) no Hoare annotation was computed. [2023-11-06 22:54:30,582 INFO L899 garLoopResultBuilder]: For program point L129-29(line 129) no Hoare annotation was computed. [2023-11-06 22:54:30,582 INFO L899 garLoopResultBuilder]: For program point L129-30(line 129) no Hoare annotation was computed. [2023-11-06 22:54:30,582 INFO L899 garLoopResultBuilder]: For program point L129-31(line 129) no Hoare annotation was computed. [2023-11-06 22:54:30,582 INFO L899 garLoopResultBuilder]: For program point L129-32(line 129) no Hoare annotation was computed. [2023-11-06 22:54:30,582 INFO L899 garLoopResultBuilder]: For program point L64(lines 64 65) no Hoare annotation was computed. [2023-11-06 22:54:30,582 INFO L899 garLoopResultBuilder]: For program point L129-34(line 129) no Hoare annotation was computed. [2023-11-06 22:54:30,582 INFO L899 garLoopResultBuilder]: For program point L129-35(line 129) no Hoare annotation was computed. [2023-11-06 22:54:30,583 INFO L899 garLoopResultBuilder]: For program point L129-37(line 129) no Hoare annotation was computed. [2023-11-06 22:54:30,583 INFO L899 garLoopResultBuilder]: For program point L129-39(line 129) no Hoare annotation was computed. [2023-11-06 22:54:30,583 INFO L899 garLoopResultBuilder]: For program point L129-41(line 129) no Hoare annotation was computed. [2023-11-06 22:54:30,583 INFO L899 garLoopResultBuilder]: For program point L129-43(line 129) no Hoare annotation was computed. [2023-11-06 22:54:30,583 INFO L895 garLoopResultBuilder]: At program point L114(line 114) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 4))) (and (<= (mod (select .cse0 6) 256) 0) (= 4 ~WrapperStruct00_var_1_12_Pointer~0.base) (not (= ~WrapperStruct00_var_1_4_Pointer~0.offset ~WrapperStruct00_var_1_12_Pointer~0.offset)) (= ~WrapperStruct00_var_1_10_Pointer~0.base 4) (not (= ~WrapperStruct00_var_1_4_Pointer~0.offset ~WrapperStruct00_var_1_8_Pointer~0.offset)) (<= 23 ~WrapperStruct00_var_1_8_Pointer~0.offset) (not (= ~WrapperStruct00_var_1_12_Pointer~0.offset ~WrapperStruct00_var_1_10_Pointer~0.offset)) (= ~last_1_WrapperStruct00_var_1_8~0 (select .cse0 23)) (= ~WrapperStruct00_var_1_1_Pointer~0.base 4) (= |~#WrapperStruct00~0.base| 4) (= 6 ~WrapperStruct00_var_1_5_Pointer~0.offset) (<= 27 ~WrapperStruct00_var_1_12_Pointer~0.offset) (= 4 ~WrapperStruct00_var_1_8_Pointer~0.base) (<= 7 ~WrapperStruct00_var_1_6_Pointer~0.offset) (not (= ~WrapperStruct00_var_1_8_Pointer~0.offset ~WrapperStruct00_var_1_10_Pointer~0.offset)) (not (= ~WrapperStruct00_var_1_12_Pointer~0.offset ~WrapperStruct00_var_1_8_Pointer~0.offset)) (= ~WrapperStruct00_var_1_4_Pointer~0.base 4) (not (= ~WrapperStruct00_var_1_12_Pointer~0.offset ~WrapperStruct00_var_1_11_Pointer~0.offset)) (= ~WrapperStruct00_var_1_11_Pointer~0.base 4) (not (= ~WrapperStruct00_var_1_12_Pointer~0.offset ~WrapperStruct00_var_1_13_Pointer~0.offset)) (= ~WrapperStruct00_var_1_6_Pointer~0.base 4) (= |~#WrapperStruct00~0.offset| 0) (<= ~WrapperStruct00_var_1_1_Pointer~0.offset 0) (= ~WrapperStruct00_var_1_13_Pointer~0.base 4) (not (= ~WrapperStruct00_var_1_8_Pointer~0.offset ~WrapperStruct00_var_1_11_Pointer~0.offset)) (= ~WrapperStruct00_var_1_5_Pointer~0.base 4))) [2023-11-06 22:54:30,583 INFO L899 garLoopResultBuilder]: For program point L114-1(line 114) no Hoare annotation was computed. [2023-11-06 22:54:30,584 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-06 22:54:30,584 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-06 22:54:30,584 INFO L899 garLoopResultBuilder]: For program point L66(lines 66 99) no Hoare annotation was computed. [2023-11-06 22:54:30,584 INFO L895 garLoopResultBuilder]: At program point L116(line 116) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 4))) (and (<= (mod (select .cse0 6) 256) 0) (= 4 ~WrapperStruct00_var_1_12_Pointer~0.base) (not (= ~WrapperStruct00_var_1_4_Pointer~0.offset ~WrapperStruct00_var_1_12_Pointer~0.offset)) (= ~WrapperStruct00_var_1_10_Pointer~0.base 4) (not (= ~WrapperStruct00_var_1_4_Pointer~0.offset ~WrapperStruct00_var_1_8_Pointer~0.offset)) (<= 23 ~WrapperStruct00_var_1_8_Pointer~0.offset) (not (= ~WrapperStruct00_var_1_12_Pointer~0.offset ~WrapperStruct00_var_1_10_Pointer~0.offset)) (= ~last_1_WrapperStruct00_var_1_8~0 (select .cse0 23)) (= ~WrapperStruct00_var_1_1_Pointer~0.base 4) (= |~#WrapperStruct00~0.base| 4) (= 6 ~WrapperStruct00_var_1_5_Pointer~0.offset) (<= 27 ~WrapperStruct00_var_1_12_Pointer~0.offset) (= 4 ~WrapperStruct00_var_1_8_Pointer~0.base) (<= 7 ~WrapperStruct00_var_1_6_Pointer~0.offset) (not (= ~WrapperStruct00_var_1_8_Pointer~0.offset ~WrapperStruct00_var_1_10_Pointer~0.offset)) (not (= ~WrapperStruct00_var_1_12_Pointer~0.offset ~WrapperStruct00_var_1_8_Pointer~0.offset)) (= ~WrapperStruct00_var_1_4_Pointer~0.base 4) (not (= ~WrapperStruct00_var_1_12_Pointer~0.offset ~WrapperStruct00_var_1_11_Pointer~0.offset)) (= ~WrapperStruct00_var_1_11_Pointer~0.base 4) (not (= ~WrapperStruct00_var_1_12_Pointer~0.offset ~WrapperStruct00_var_1_13_Pointer~0.offset)) (= ~WrapperStruct00_var_1_6_Pointer~0.base 4) (= |~#WrapperStruct00~0.offset| 0) (<= ~WrapperStruct00_var_1_1_Pointer~0.offset 0) (= ~WrapperStruct00_var_1_13_Pointer~0.base 4) (not (= ~WrapperStruct00_var_1_8_Pointer~0.offset ~WrapperStruct00_var_1_11_Pointer~0.offset)) (= ~WrapperStruct00_var_1_5_Pointer~0.base 4))) [2023-11-06 22:54:30,584 INFO L899 garLoopResultBuilder]: For program point L116-1(line 116) no Hoare annotation was computed. [2023-11-06 22:54:30,585 INFO L899 garLoopResultBuilder]: For program point L100(lines 100 124) no Hoare annotation was computed. [2023-11-06 22:54:30,585 INFO L895 garLoopResultBuilder]: At program point L117(line 117) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 4))) (and (<= (mod (select .cse0 6) 256) 0) (= 4 ~WrapperStruct00_var_1_12_Pointer~0.base) (not (= ~WrapperStruct00_var_1_4_Pointer~0.offset ~WrapperStruct00_var_1_12_Pointer~0.offset)) (= ~WrapperStruct00_var_1_10_Pointer~0.base 4) (not (= ~WrapperStruct00_var_1_4_Pointer~0.offset ~WrapperStruct00_var_1_8_Pointer~0.offset)) (<= 23 ~WrapperStruct00_var_1_8_Pointer~0.offset) (not (= ~WrapperStruct00_var_1_12_Pointer~0.offset ~WrapperStruct00_var_1_10_Pointer~0.offset)) (= ~last_1_WrapperStruct00_var_1_8~0 (select .cse0 23)) (= ~WrapperStruct00_var_1_1_Pointer~0.base 4) (= |~#WrapperStruct00~0.base| 4) (= 6 ~WrapperStruct00_var_1_5_Pointer~0.offset) (<= 27 ~WrapperStruct00_var_1_12_Pointer~0.offset) (= 4 ~WrapperStruct00_var_1_8_Pointer~0.base) (<= 7 ~WrapperStruct00_var_1_6_Pointer~0.offset) (not (= ~WrapperStruct00_var_1_8_Pointer~0.offset ~WrapperStruct00_var_1_10_Pointer~0.offset)) (not (= ~WrapperStruct00_var_1_12_Pointer~0.offset ~WrapperStruct00_var_1_8_Pointer~0.offset)) (= ~WrapperStruct00_var_1_4_Pointer~0.base 4) (not (= ~WrapperStruct00_var_1_12_Pointer~0.offset ~WrapperStruct00_var_1_11_Pointer~0.offset)) (= ~WrapperStruct00_var_1_11_Pointer~0.base 4) (not (= ~WrapperStruct00_var_1_12_Pointer~0.offset ~WrapperStruct00_var_1_13_Pointer~0.offset)) (= ~WrapperStruct00_var_1_6_Pointer~0.base 4) (= |~#WrapperStruct00~0.offset| 0) (<= ~WrapperStruct00_var_1_1_Pointer~0.offset 0) (= ~WrapperStruct00_var_1_13_Pointer~0.base 4) (not (= ~WrapperStruct00_var_1_8_Pointer~0.offset ~WrapperStruct00_var_1_11_Pointer~0.offset)) (= ~WrapperStruct00_var_1_5_Pointer~0.base 4))) [2023-11-06 22:54:30,585 INFO L899 garLoopResultBuilder]: For program point L117-1(line 117) no Hoare annotation was computed. [2023-11-06 22:54:30,585 INFO L899 garLoopResultBuilder]: For program point L68(lines 68 72) no Hoare annotation was computed. [2023-11-06 22:54:30,585 INFO L899 garLoopResultBuilder]: For program point L68-2(lines 68 72) no Hoare annotation was computed. [2023-11-06 22:54:30,586 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-11-06 22:54:30,586 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-06 22:54:30,586 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-11-06 22:54:30,586 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-11-06 22:54:30,590 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:54:30,592 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:54:30,611 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayStoreExpression #memory_int[4][~WrapperStruct00_var_1_8_Pointer~0!offset := #memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + -16 + -256 * ((#memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + 240) / 256)] could not be translated [2023-11-06 22:54:30,614 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[4][~WrapperStruct00_var_1_8_Pointer~0!offset := #memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + -16 + -256 * ((#memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + 240) / 256)][~WrapperStruct00_var_1_1_Pointer~0!offset] could not be translated [2023-11-06 22:54:30,614 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayStoreExpression #memory_int[4][~WrapperStruct00_var_1_8_Pointer~0!offset := #memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + -16 + -256 * ((#memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + 240) / 256)] could not be translated [2023-11-06 22:54:30,615 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[4][~WrapperStruct00_var_1_8_Pointer~0!offset := #memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + -16 + -256 * ((#memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + 240) / 256)][6] could not be translated [2023-11-06 22:54:30,616 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[4] could not be translated [2023-11-06 22:54:30,616 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[4][~WrapperStruct00_var_1_1_Pointer~0!offset] could not be translated [2023-11-06 22:54:30,617 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[4] could not be translated [2023-11-06 22:54:30,617 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[4][~WrapperStruct00_var_1_1_Pointer~0!offset] could not be translated [2023-11-06 22:54:30,618 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[4] could not be translated [2023-11-06 22:54:30,618 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[4][~WrapperStruct00_var_1_12_Pointer~0!offset] could not be translated [2023-11-06 22:54:30,618 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[4] could not be translated [2023-11-06 22:54:30,618 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[4][~WrapperStruct00_var_1_13_Pointer~0!offset] could not be translated [2023-11-06 22:54:30,628 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayStoreExpression #memory_int[4][~WrapperStruct00_var_1_8_Pointer~0!offset := #memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + -16 + -256 * ((#memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + 240) / 256)] could not be translated [2023-11-06 22:54:30,628 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[4][~WrapperStruct00_var_1_8_Pointer~0!offset := #memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + -16 + -256 * ((#memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + 240) / 256)][~WrapperStruct00_var_1_1_Pointer~0!offset] could not be translated [2023-11-06 22:54:30,629 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayStoreExpression #memory_int[4][~WrapperStruct00_var_1_8_Pointer~0!offset := #memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + -16 + -256 * ((#memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + 240) / 256)] could not be translated [2023-11-06 22:54:30,629 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[4][~WrapperStruct00_var_1_8_Pointer~0!offset := #memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + -16 + -256 * ((#memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + 240) / 256)][6] could not be translated [2023-11-06 22:54:30,630 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[4] could not be translated [2023-11-06 22:54:30,630 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[4][~WrapperStruct00_var_1_1_Pointer~0!offset] could not be translated [2023-11-06 22:54:30,631 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[4] could not be translated [2023-11-06 22:54:30,631 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[4][~WrapperStruct00_var_1_1_Pointer~0!offset] could not be translated [2023-11-06 22:54:30,632 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[4] could not be translated [2023-11-06 22:54:30,641 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[4][~WrapperStruct00_var_1_12_Pointer~0!offset] could not be translated [2023-11-06 22:54:30,642 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[4] could not be translated [2023-11-06 22:54:30,642 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[4][~WrapperStruct00_var_1_13_Pointer~0!offset] could not be translated [2023-11-06 22:54:30,643 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[4] could not be translated [2023-11-06 22:54:30,644 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[4][6] could not be translated [2023-11-06 22:54:30,645 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[4] could not be translated [2023-11-06 22:54:30,650 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[4][6] could not be translated [2023-11-06 22:54:30,653 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayStoreExpression #memory_int[4][~WrapperStruct00_var_1_8_Pointer~0!offset := #memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + -16 + -256 * ((#memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + 240) / 256)] could not be translated [2023-11-06 22:54:30,653 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[4][~WrapperStruct00_var_1_8_Pointer~0!offset := #memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + -16 + -256 * ((#memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + 240) / 256)][~WrapperStruct00_var_1_1_Pointer~0!offset] could not be translated [2023-11-06 22:54:30,653 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayStoreExpression #memory_int[4][~WrapperStruct00_var_1_8_Pointer~0!offset := #memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + -16 + -256 * ((#memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + 240) / 256)] could not be translated [2023-11-06 22:54:30,654 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[4][~WrapperStruct00_var_1_8_Pointer~0!offset := #memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + -16 + -256 * ((#memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + 240) / 256)][6] could not be translated [2023-11-06 22:54:30,656 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayStoreExpression #memory_int[4][~WrapperStruct00_var_1_8_Pointer~0!offset := #memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + -16 + -256 * ((#memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + 240) / 256)] could not be translated [2023-11-06 22:54:30,664 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[4][~WrapperStruct00_var_1_8_Pointer~0!offset := #memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + -16 + -256 * ((#memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + 240) / 256)][~WrapperStruct00_var_1_1_Pointer~0!offset] could not be translated [2023-11-06 22:54:30,664 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayStoreExpression #memory_int[4][~WrapperStruct00_var_1_8_Pointer~0!offset := #memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + -16 + -256 * ((#memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + 240) / 256)] could not be translated [2023-11-06 22:54:30,664 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[4][~WrapperStruct00_var_1_8_Pointer~0!offset := #memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + -16 + -256 * ((#memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + 240) / 256)][6] could not be translated [2023-11-06 22:54:30,666 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:54:30 BoogieIcfgContainer [2023-11-06 22:54:30,666 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:54:30,666 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:54:30,666 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:54:30,667 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:54:30,667 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:51:33" (3/4) ... [2023-11-06 22:54:30,669 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-06 22:54:30,674 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-06 22:54:30,688 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2023-11-06 22:54:30,693 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-06 22:54:30,694 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-06 22:54:30,695 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-06 22:54:30,750 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((4 == WrapperStruct00_var_1_12_Pointer) && (1 <= \result)) && (WrapperStruct00_var_1_10_Pointer == 4)) && (WrapperStruct00_var_1_1_Pointer == 4)) && (WrapperStruct00 == 4)) && (4 == WrapperStruct00_var_1_8_Pointer)) && (WrapperStruct00_var_1_4_Pointer == 4)) && (WrapperStruct00_var_1_11_Pointer == 4)) && (WrapperStruct00_var_1_6_Pointer == 4)) && (WrapperStruct00_var_1_13_Pointer == 4)) && (WrapperStruct00_var_1_5_Pointer == 4)) [2023-11-06 22:54:30,866 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((4 == WrapperStruct00_var_1_12_Pointer) && (1 <= \result)) && (WrapperStruct00_var_1_10_Pointer == 4)) && (WrapperStruct00_var_1_1_Pointer == 4)) && (WrapperStruct00 == 4)) && (4 == WrapperStruct00_var_1_8_Pointer)) && (WrapperStruct00_var_1_4_Pointer == 4)) && (WrapperStruct00_var_1_11_Pointer == 4)) && (WrapperStruct00_var_1_6_Pointer == 4)) && (WrapperStruct00_var_1_13_Pointer == 4)) && (WrapperStruct00_var_1_5_Pointer == 4)) [2023-11-06 22:54:30,882 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ab41c9d-9030-46ad-858c-27aa5846a49e/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 22:54:30,882 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ab41c9d-9030-46ad-858c-27aa5846a49e/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.yaml [2023-11-06 22:54:30,882 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:54:30,883 INFO L158 Benchmark]: Toolchain (without parser) took 178760.15ms. Allocated memory was 136.3MB in the beginning and 836.8MB in the end (delta: 700.4MB). Free memory was 104.7MB in the beginning and 413.8MB in the end (delta: -309.1MB). Peak memory consumption was 392.8MB. Max. memory is 16.1GB. [2023-11-06 22:54:30,883 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 109.1MB. Free memory is still 63.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:54:30,885 INFO L158 Benchmark]: CACSL2BoogieTranslator took 402.33ms. Allocated memory is still 136.3MB. Free memory was 104.1MB in the beginning and 89.7MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-06 22:54:30,885 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.99ms. Allocated memory is still 136.3MB. Free memory was 89.7MB in the beginning and 86.7MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:54:30,886 INFO L158 Benchmark]: Boogie Preprocessor took 51.46ms. Allocated memory is still 136.3MB. Free memory was 86.7MB in the beginning and 84.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:54:30,886 INFO L158 Benchmark]: RCFGBuilder took 839.07ms. Allocated memory is still 136.3MB. Free memory was 84.0MB in the beginning and 57.9MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-06 22:54:30,886 INFO L158 Benchmark]: TraceAbstraction took 177174.37ms. Allocated memory was 136.3MB in the beginning and 836.8MB in the end (delta: 700.4MB). Free memory was 57.3MB in the beginning and 423.3MB in the end (delta: -366.0MB). Peak memory consumption was 462.0MB. Max. memory is 16.1GB. [2023-11-06 22:54:30,887 INFO L158 Benchmark]: Witness Printer took 216.11ms. Allocated memory is still 836.8MB. Free memory was 423.3MB in the beginning and 413.8MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-06 22:54:30,897 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 109.1MB. Free memory is still 63.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 402.33ms. Allocated memory is still 136.3MB. Free memory was 104.1MB in the beginning and 89.7MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.99ms. Allocated memory is still 136.3MB. Free memory was 89.7MB in the beginning and 86.7MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.46ms. Allocated memory is still 136.3MB. Free memory was 86.7MB in the beginning and 84.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 839.07ms. Allocated memory is still 136.3MB. Free memory was 84.0MB in the beginning and 57.9MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 177174.37ms. Allocated memory was 136.3MB in the beginning and 836.8MB in the end (delta: 700.4MB). Free memory was 57.3MB in the beginning and 423.3MB in the end (delta: -366.0MB). Peak memory consumption was 462.0MB. Max. memory is 16.1GB. * Witness Printer took 216.11ms. Allocated memory is still 836.8MB. Free memory was 423.3MB in the beginning and 413.8MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayStoreExpression #memory_int[4][~WrapperStruct00_var_1_8_Pointer~0!offset := #memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + -16 + -256 * ((#memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + 240) / 256)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[4][~WrapperStruct00_var_1_8_Pointer~0!offset := #memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + -16 + -256 * ((#memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + 240) / 256)][~WrapperStruct00_var_1_1_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayStoreExpression #memory_int[4][~WrapperStruct00_var_1_8_Pointer~0!offset := #memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + -16 + -256 * ((#memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + 240) / 256)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[4][~WrapperStruct00_var_1_8_Pointer~0!offset := #memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + -16 + -256 * ((#memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + 240) / 256)][6] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[4][~WrapperStruct00_var_1_1_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[4][~WrapperStruct00_var_1_1_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[4][~WrapperStruct00_var_1_12_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[4][~WrapperStruct00_var_1_13_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayStoreExpression #memory_int[4][~WrapperStruct00_var_1_8_Pointer~0!offset := #memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + -16 + -256 * ((#memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + 240) / 256)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[4][~WrapperStruct00_var_1_8_Pointer~0!offset := #memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + -16 + -256 * ((#memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + 240) / 256)][~WrapperStruct00_var_1_1_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayStoreExpression #memory_int[4][~WrapperStruct00_var_1_8_Pointer~0!offset := #memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + -16 + -256 * ((#memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + 240) / 256)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[4][~WrapperStruct00_var_1_8_Pointer~0!offset := #memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + -16 + -256 * ((#memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + 240) / 256)][6] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[4][~WrapperStruct00_var_1_1_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[4][~WrapperStruct00_var_1_1_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[4][~WrapperStruct00_var_1_12_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[4][~WrapperStruct00_var_1_13_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[4][6] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[4][6] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayStoreExpression #memory_int[4][~WrapperStruct00_var_1_8_Pointer~0!offset := #memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + -16 + -256 * ((#memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + 240) / 256)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[4][~WrapperStruct00_var_1_8_Pointer~0!offset := #memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + -16 + -256 * ((#memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + 240) / 256)][~WrapperStruct00_var_1_1_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayStoreExpression #memory_int[4][~WrapperStruct00_var_1_8_Pointer~0!offset := #memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + -16 + -256 * ((#memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + 240) / 256)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[4][~WrapperStruct00_var_1_8_Pointer~0!offset := #memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + -16 + -256 * ((#memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + 240) / 256)][6] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayStoreExpression #memory_int[4][~WrapperStruct00_var_1_8_Pointer~0!offset := #memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + -16 + -256 * ((#memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + 240) / 256)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[4][~WrapperStruct00_var_1_8_Pointer~0!offset := #memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + -16 + -256 * ((#memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + 240) / 256)][~WrapperStruct00_var_1_1_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayStoreExpression #memory_int[4][~WrapperStruct00_var_1_8_Pointer~0!offset := #memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + -16 + -256 * ((#memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + 240) / 256)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[4][~WrapperStruct00_var_1_8_Pointer~0!offset := #memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + -16 + -256 * ((#memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + 240) / 256)][6] could not be translated * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 102 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 177.0s, OverallIterations: 22, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 51.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 48.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 7 mSolverCounterUnknown, 3080 SdHoareTripleChecker+Valid, 22.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3072 mSDsluCounter, 8930 SdHoareTripleChecker+Invalid, 21.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6291 mSDsCounter, 191 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5160 IncrementalHoareTripleChecker+Invalid, 5358 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 191 mSolverCounterUnsat, 2639 mSDtfsCounter, 5160 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1082 GetRequests, 873 SyntacticMatches, 4 SemanticMatches, 205 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1011 ImplicationChecksByTransitivity, 42.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=202occurred in iteration=20, InterpolantAutomatonStates: 166, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 22 MinimizatonAttempts, 458 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 364 PreInvPairs, 398 NumberOfFragments, 1844 HoareAnnotationTreeSize, 364 FomulaSimplifications, 524458 FormulaSimplificationTreeSizeReduction, 14.6s HoareSimplificationTime, 20 FomulaSimplificationsInter, 52175 FormulaSimplificationTreeSizeReductionInter, 34.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 73.5s InterpolantComputationTime, 2904 NumberOfCodeBlocks, 2904 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 2881 ConstructedInterpolants, 5 QuantifiedInterpolants, 29556 SizeOfPredicates, 23 NumberOfNonLiveVariables, 466 ConjunctsInSsa, 60 ConjunctsInUnsatCore, 23 InterpolantComputations, 21 PerfectInterpolantSequences, 9508/9660 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 128]: Loop Invariant [2023-11-06 22:54:30,916 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayStoreExpression #memory_int[4][~WrapperStruct00_var_1_8_Pointer~0!offset := #memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + -16 + -256 * ((#memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + 240) / 256)] could not be translated [2023-11-06 22:54:30,921 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[4][~WrapperStruct00_var_1_8_Pointer~0!offset := #memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + -16 + -256 * ((#memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + 240) / 256)][~WrapperStruct00_var_1_1_Pointer~0!offset] could not be translated [2023-11-06 22:54:30,921 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayStoreExpression #memory_int[4][~WrapperStruct00_var_1_8_Pointer~0!offset := #memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + -16 + -256 * ((#memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + 240) / 256)] could not be translated [2023-11-06 22:54:30,921 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[4][~WrapperStruct00_var_1_8_Pointer~0!offset := #memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + -16 + -256 * ((#memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + 240) / 256)][6] could not be translated [2023-11-06 22:54:30,928 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[4] could not be translated [2023-11-06 22:54:30,929 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[4][~WrapperStruct00_var_1_1_Pointer~0!offset] could not be translated [2023-11-06 22:54:30,929 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[4] could not be translated [2023-11-06 22:54:30,929 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[4][~WrapperStruct00_var_1_1_Pointer~0!offset] could not be translated [2023-11-06 22:54:30,929 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[4] could not be translated [2023-11-06 22:54:30,929 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[4][~WrapperStruct00_var_1_12_Pointer~0!offset] could not be translated [2023-11-06 22:54:30,929 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[4] could not be translated [2023-11-06 22:54:30,929 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[4][~WrapperStruct00_var_1_13_Pointer~0!offset] could not be translated [2023-11-06 22:54:30,930 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayStoreExpression #memory_int[4][~WrapperStruct00_var_1_8_Pointer~0!offset := #memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + -16 + -256 * ((#memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + 240) / 256)] could not be translated [2023-11-06 22:54:30,931 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[4][~WrapperStruct00_var_1_8_Pointer~0!offset := #memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + -16 + -256 * ((#memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + 240) / 256)][~WrapperStruct00_var_1_1_Pointer~0!offset] could not be translated [2023-11-06 22:54:30,931 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayStoreExpression #memory_int[4][~WrapperStruct00_var_1_8_Pointer~0!offset := #memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + -16 + -256 * ((#memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + 240) / 256)] could not be translated [2023-11-06 22:54:30,931 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[4][~WrapperStruct00_var_1_8_Pointer~0!offset := #memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + -16 + -256 * ((#memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + 240) / 256)][6] could not be translated [2023-11-06 22:54:30,931 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[4] could not be translated [2023-11-06 22:54:30,931 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[4][~WrapperStruct00_var_1_1_Pointer~0!offset] could not be translated [2023-11-06 22:54:30,931 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[4] could not be translated [2023-11-06 22:54:30,932 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[4][~WrapperStruct00_var_1_1_Pointer~0!offset] could not be translated [2023-11-06 22:54:30,932 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[4] could not be translated [2023-11-06 22:54:30,932 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[4][~WrapperStruct00_var_1_12_Pointer~0!offset] could not be translated [2023-11-06 22:54:30,932 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[4] could not be translated [2023-11-06 22:54:30,932 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[4][~WrapperStruct00_var_1_13_Pointer~0!offset] could not be translated Derived loop invariant: (((((((((((4 == WrapperStruct00_var_1_12_Pointer) && (1 <= \result)) && (WrapperStruct00_var_1_10_Pointer == 4)) && (WrapperStruct00_var_1_1_Pointer == 4)) && (WrapperStruct00 == 4)) && (4 == WrapperStruct00_var_1_8_Pointer)) && (WrapperStruct00_var_1_4_Pointer == 4)) && (WrapperStruct00_var_1_11_Pointer == 4)) && (WrapperStruct00_var_1_6_Pointer == 4)) && (WrapperStruct00_var_1_13_Pointer == 4)) && (WrapperStruct00_var_1_5_Pointer == 4)) - InvariantResult [Line: 135]: Loop Invariant [2023-11-06 22:54:30,933 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[4] could not be translated [2023-11-06 22:54:30,933 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[4][6] could not be translated [2023-11-06 22:54:30,935 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[4] could not be translated [2023-11-06 22:54:30,935 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[4][6] could not be translated Derived loop invariant: ((((((((((4 == WrapperStruct00_var_1_12_Pointer) && (WrapperStruct00_var_1_10_Pointer == 4)) && (WrapperStruct00_var_1_1_Pointer == 4)) && (WrapperStruct00 == 4)) && (4 == WrapperStruct00_var_1_8_Pointer)) && (WrapperStruct00_var_1_4_Pointer == 4)) && (WrapperStruct00_var_1_11_Pointer == 4)) && (WrapperStruct00_var_1_6_Pointer == 4)) && (WrapperStruct00_var_1_13_Pointer == 4)) && (WrapperStruct00_var_1_5_Pointer == 4)) - InvariantResult [Line: 19]: Loop Invariant [2023-11-06 22:54:30,936 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayStoreExpression #memory_int[4][~WrapperStruct00_var_1_8_Pointer~0!offset := #memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + -16 + -256 * ((#memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + 240) / 256)] could not be translated [2023-11-06 22:54:30,937 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[4][~WrapperStruct00_var_1_8_Pointer~0!offset := #memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + -16 + -256 * ((#memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + 240) / 256)][~WrapperStruct00_var_1_1_Pointer~0!offset] could not be translated [2023-11-06 22:54:30,937 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayStoreExpression #memory_int[4][~WrapperStruct00_var_1_8_Pointer~0!offset := #memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + -16 + -256 * ((#memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + 240) / 256)] could not be translated [2023-11-06 22:54:30,937 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[4][~WrapperStruct00_var_1_8_Pointer~0!offset := #memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + -16 + -256 * ((#memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + 240) / 256)][6] could not be translated [2023-11-06 22:54:30,939 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayStoreExpression #memory_int[4][~WrapperStruct00_var_1_8_Pointer~0!offset := #memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + -16 + -256 * ((#memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + 240) / 256)] could not be translated [2023-11-06 22:54:30,939 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[4][~WrapperStruct00_var_1_8_Pointer~0!offset := #memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + -16 + -256 * ((#memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + 240) / 256)][~WrapperStruct00_var_1_1_Pointer~0!offset] could not be translated [2023-11-06 22:54:30,939 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayStoreExpression #memory_int[4][~WrapperStruct00_var_1_8_Pointer~0!offset := #memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + -16 + -256 * ((#memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + 240) / 256)] could not be translated [2023-11-06 22:54:30,939 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[4][~WrapperStruct00_var_1_8_Pointer~0!offset := #memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + -16 + -256 * ((#memory_int[4][~WrapperStruct00_var_1_11_Pointer~0!offset] + 240) / 256)][6] could not be translated Derived loop invariant: (((((((((((4 == WrapperStruct00_var_1_12_Pointer) && (WrapperStruct00_var_1_10_Pointer == 4)) && (WrapperStruct00_var_1_1_Pointer == 4)) && (WrapperStruct00 == 4)) && (4 == WrapperStruct00_var_1_8_Pointer)) && (WrapperStruct00_var_1_4_Pointer == 4)) && (WrapperStruct00_var_1_11_Pointer == 4)) && (WrapperStruct00_var_1_6_Pointer == 4)) && (WrapperStruct00_var_1_13_Pointer == 4)) && (WrapperStruct00_var_1_5_Pointer == 4)) && (*WrapperStruct00_var_1_1_Pointer <= (256 * (*WrapperStruct00_var_1_1_Pointer / 256)))) RESULT: Ultimate proved your program to be correct! [2023-11-06 22:54:31,048 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ab41c9d-9030-46ad-858c-27aa5846a49e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE