./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-76.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cf1a7837 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_30d9e630-4905-4777-a6ae-e81945b26296/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30d9e630-4905-4777-a6ae-e81945b26296/bin/uautomizer-verify-uTZkv6EMXl/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30d9e630-4905-4777-a6ae-e81945b26296/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30d9e630-4905-4777-a6ae-e81945b26296/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-76.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30d9e630-4905-4777-a6ae-e81945b26296/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30d9e630-4905-4777-a6ae-e81945b26296/bin/uautomizer-verify-uTZkv6EMXl --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dd98e02a958c2e630fe387017d194cc2d0adeeb7f7dbaa6eeae7739b76f0d917 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:25:09,853 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:25:09,981 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30d9e630-4905-4777-a6ae-e81945b26296/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-12 02:25:09,990 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:25:09,991 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:25:10,032 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:25:10,034 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:25:10,035 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:25:10,036 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:25:10,042 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:25:10,043 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:25:10,044 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:25:10,045 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:25:10,047 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:25:10,047 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 02:25:10,048 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 02:25:10,049 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:25:10,049 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 02:25:10,050 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:25:10,050 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 02:25:10,051 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:25:10,051 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 02:25:10,052 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 02:25:10,054 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 02:25:10,055 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:25:10,056 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:25:10,056 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:25:10,057 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:25:10,058 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:25:10,058 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:25:10,060 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:25:10,060 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 02:25:10,060 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-12 02:25:10,061 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 02:25:10,061 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:25:10,061 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 02:25:10,062 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:25:10,062 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:25:10,062 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:25:10,063 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_30d9e630-4905-4777-a6ae-e81945b26296/bin/uautomizer-verify-uTZkv6EMXl/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_30d9e630-4905-4777-a6ae-e81945b26296/bin/uautomizer-verify-uTZkv6EMXl Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dd98e02a958c2e630fe387017d194cc2d0adeeb7f7dbaa6eeae7739b76f0d917 [2023-11-12 02:25:10,400 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:25:10,434 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:25:10,437 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:25:10,439 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:25:10,440 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:25:10,441 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30d9e630-4905-4777-a6ae-e81945b26296/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-76.i [2023-11-12 02:25:13,647 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:25:13,906 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:25:13,907 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30d9e630-4905-4777-a6ae-e81945b26296/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-76.i [2023-11-12 02:25:13,919 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30d9e630-4905-4777-a6ae-e81945b26296/bin/uautomizer-verify-uTZkv6EMXl/data/9302f466a/fb6dbee296ed42978fb54709ab6b4dbb/FLAG7abd665eb [2023-11-12 02:25:13,933 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30d9e630-4905-4777-a6ae-e81945b26296/bin/uautomizer-verify-uTZkv6EMXl/data/9302f466a/fb6dbee296ed42978fb54709ab6b4dbb [2023-11-12 02:25:13,936 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:25:13,938 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:25:13,940 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:25:13,940 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:25:13,947 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:25:13,948 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:25:13" (1/1) ... [2023-11-12 02:25:13,949 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e906c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:13, skipping insertion in model container [2023-11-12 02:25:13,949 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:25:13" (1/1) ... [2023-11-12 02:25:13,982 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:25:14,165 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_30d9e630-4905-4777-a6ae-e81945b26296/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-76.i[916,929] [2023-11-12 02:25:14,297 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:25:14,322 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:25:14,337 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_30d9e630-4905-4777-a6ae-e81945b26296/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-76.i[916,929] [2023-11-12 02:25:14,405 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:25:14,426 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:25:14,427 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:14 WrapperNode [2023-11-12 02:25:14,427 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:25:14,428 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:25:14,428 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:25:14,429 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:25:14,437 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:14" (1/1) ... [2023-11-12 02:25:14,453 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:14" (1/1) ... [2023-11-12 02:25:14,507 INFO L138 Inliner]: procedures = 29, calls = 138, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 370 [2023-11-12 02:25:14,508 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:25:14,509 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:25:14,509 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:25:14,509 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:25:14,521 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:14" (1/1) ... [2023-11-12 02:25:14,521 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:14" (1/1) ... [2023-11-12 02:25:14,529 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:14" (1/1) ... [2023-11-12 02:25:14,530 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:14" (1/1) ... [2023-11-12 02:25:14,552 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:14" (1/1) ... [2023-11-12 02:25:14,557 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:14" (1/1) ... [2023-11-12 02:25:14,561 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:14" (1/1) ... [2023-11-12 02:25:14,564 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:14" (1/1) ... [2023-11-12 02:25:14,579 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:25:14,580 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:25:14,581 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:25:14,581 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:25:14,582 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:14" (1/1) ... [2023-11-12 02:25:14,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:25:14,625 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30d9e630-4905-4777-a6ae-e81945b26296/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:25:14,644 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30d9e630-4905-4777-a6ae-e81945b26296/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 02:25:14,652 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30d9e630-4905-4777-a6ae-e81945b26296/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 02:25:14,686 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:25:14,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2023-11-12 02:25:14,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 02:25:14,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2023-11-12 02:25:14,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-12 02:25:14,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2023-11-12 02:25:14,688 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-12 02:25:14,688 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-12 02:25:14,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 02:25:14,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:25:14,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:25:14,808 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:25:14,810 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:25:15,427 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:25:15,446 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:25:15,447 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-12 02:25:15,450 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:25:15 BoogieIcfgContainer [2023-11-12 02:25:15,450 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:25:15,454 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:25:15,454 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:25:15,459 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:25:15,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:25:13" (1/3) ... [2023-11-12 02:25:15,461 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fc3f90a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:25:15, skipping insertion in model container [2023-11-12 02:25:15,462 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:14" (2/3) ... [2023-11-12 02:25:15,464 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fc3f90a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:25:15, skipping insertion in model container [2023-11-12 02:25:15,465 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:25:15" (3/3) ... [2023-11-12 02:25:15,466 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-76.i [2023-11-12 02:25:15,487 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:25:15,487 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-12 02:25:15,549 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:25:15,556 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@28f01f7e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:25:15,557 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-12 02:25:15,560 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-12 02:25:15,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-12 02:25:15,574 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:25:15,575 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-12 02:25:15,575 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:25:15,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:25:15,580 INFO L85 PathProgramCache]: Analyzing trace with hash 587591641, now seen corresponding path program 1 times [2023-11-12 02:25:15,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:25:15,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061070550] [2023-11-12 02:25:15,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:25:15,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:25:15,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:16,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:25:16,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:16,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:25:16,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:16,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:25:16,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:16,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:25:16,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:16,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:25:16,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:16,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:25:16,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:16,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-12 02:25:16,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:16,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-12 02:25:16,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:16,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:25:16,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:16,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-12 02:25:16,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:16,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-12 02:25:16,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:16,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:25:16,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:16,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-12 02:25:16,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:16,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-12 02:25:16,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:16,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-12 02:25:16,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:16,178 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-12 02:25:16,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:25:16,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061070550] [2023-11-12 02:25:16,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061070550] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:25:16,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:25:16,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:25:16,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455650247] [2023-11-12 02:25:16,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:25:16,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-12 02:25:16,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:25:16,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-12 02:25:16,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 02:25:16,259 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-12 02:25:16,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:25:16,321 INFO L93 Difference]: Finished difference Result 193 states and 301 transitions. [2023-11-12 02:25:16,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-12 02:25:16,324 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-12 02:25:16,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:25:16,337 INFO L225 Difference]: With dead ends: 193 [2023-11-12 02:25:16,337 INFO L226 Difference]: Without dead ends: 94 [2023-11-12 02:25:16,342 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-12 02:25:16,347 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-12 02:25:16,348 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-12 02:25:16,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-11-12 02:25:16,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2023-11-12 02:25:16,415 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-12 02:25:16,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 133 transitions. [2023-11-12 02:25:16,428 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 133 transitions. Word has length 119 [2023-11-12 02:25:16,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:25:16,429 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 133 transitions. [2023-11-12 02:25:16,430 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-12 02:25:16,430 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 133 transitions. [2023-11-12 02:25:16,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-12 02:25:16,439 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:25:16,440 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-12 02:25:16,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 02:25:16,440 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:25:16,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:25:16,442 INFO L85 PathProgramCache]: Analyzing trace with hash 46939881, now seen corresponding path program 1 times [2023-11-12 02:25:16,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:25:16,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848683011] [2023-11-12 02:25:16,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:25:16,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:25:16,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:16,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:25:16,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:16,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:25:16,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:16,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:25:16,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:16,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:25:16,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:16,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:25:16,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:16,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:25:16,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:16,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-12 02:25:16,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:16,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-12 02:25:16,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:16,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:25:16,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:17,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-12 02:25:17,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:17,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-12 02:25:17,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:17,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:25:17,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:17,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-12 02:25:17,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:17,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-12 02:25:17,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:17,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-12 02:25:17,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:17,045 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-12 02:25:17,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:25:17,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848683011] [2023-11-12 02:25:17,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848683011] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:25:17,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:25:17,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:25:17,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481765775] [2023-11-12 02:25:17,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:25:17,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:25:17,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:25:17,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:25:17,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:25:17,050 INFO L87 Difference]: Start difference. First operand 94 states and 133 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-12 02:25:17,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:25:17,092 INFO L93 Difference]: Finished difference Result 185 states and 263 transitions. [2023-11-12 02:25:17,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:25:17,096 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-12 02:25:17,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:25:17,098 INFO L225 Difference]: With dead ends: 185 [2023-11-12 02:25:17,099 INFO L226 Difference]: Without dead ends: 94 [2023-11-12 02:25:17,100 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-12 02:25:17,101 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-12 02:25:17,102 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-12 02:25:17,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-11-12 02:25:17,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2023-11-12 02:25:17,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 77 states have (on average 1.3246753246753247) internal successors, (102), 77 states have internal predecessors, (102), 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-12 02:25:17,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 132 transitions. [2023-11-12 02:25:17,114 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 132 transitions. Word has length 119 [2023-11-12 02:25:17,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:25:17,116 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 132 transitions. [2023-11-12 02:25:17,116 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-12 02:25:17,117 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 132 transitions. [2023-11-12 02:25:17,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-12 02:25:17,119 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:25:17,119 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-12 02:25:17,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 02:25:17,119 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:25:17,120 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:25:17,120 INFO L85 PathProgramCache]: Analyzing trace with hash 122299919, now seen corresponding path program 1 times [2023-11-12 02:25:17,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:25:17,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248095187] [2023-11-12 02:25:17,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:25:17,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:25:17,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:17,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:25:17,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:17,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:25:17,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:17,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:25:17,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:17,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:25:17,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:17,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:25:17,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:17,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:25:17,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:17,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-12 02:25:17,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:17,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-12 02:25:17,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:17,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:25:17,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:17,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-12 02:25:17,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:17,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-12 02:25:17,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:17,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:25:17,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:17,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-12 02:25:17,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:17,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-12 02:25:17,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:17,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-12 02:25:17,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:17,549 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-12 02:25:17,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:25:17,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248095187] [2023-11-12 02:25:17,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248095187] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:25:17,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:25:17,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:25:17,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682764737] [2023-11-12 02:25:17,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:25:17,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:25:17,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:25:17,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:25:17,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:25:17,557 INFO L87 Difference]: Start difference. First operand 94 states and 132 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-12 02:25:17,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:25:17,751 INFO L93 Difference]: Finished difference Result 186 states and 262 transitions. [2023-11-12 02:25:17,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:25:17,752 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-12 02:25:17,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:25:17,754 INFO L225 Difference]: With dead ends: 186 [2023-11-12 02:25:17,754 INFO L226 Difference]: Without dead ends: 95 [2023-11-12 02:25:17,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:25:17,757 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 26 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 02:25:17,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 311 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 02:25:17,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-11-12 02:25:17,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2023-11-12 02:25:17,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 77 states have (on average 1.3116883116883118) internal successors, (101), 77 states have internal predecessors, (101), 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-12 02:25:17,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 131 transitions. [2023-11-12 02:25:17,772 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 131 transitions. Word has length 120 [2023-11-12 02:25:17,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:25:17,773 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 131 transitions. [2023-11-12 02:25:17,773 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-12 02:25:17,774 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 131 transitions. [2023-11-12 02:25:17,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-12 02:25:17,776 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:25:17,776 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-12 02:25:17,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 02:25:17,777 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:25:17,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:25:17,777 INFO L85 PathProgramCache]: Analyzing trace with hash 545001745, now seen corresponding path program 1 times [2023-11-12 02:25:17,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:25:17,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888596295] [2023-11-12 02:25:17,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:25:17,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:25:17,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:18,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:25:18,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:18,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:25:18,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:18,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:25:18,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:18,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:25:18,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:18,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:25:18,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:18,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:25:18,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:18,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-12 02:25:18,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:18,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-12 02:25:18,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:18,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:25:18,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:18,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-12 02:25:18,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:18,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-12 02:25:18,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:18,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:25:18,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:18,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-12 02:25:18,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:18,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-12 02:25:18,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:18,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-12 02:25:18,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:18,804 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-12 02:25:18,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:25:18,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888596295] [2023-11-12 02:25:18,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888596295] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:25:18,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:25:18,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-12 02:25:18,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407658083] [2023-11-12 02:25:18,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:25:18,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-12 02:25:18,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:25:18,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-12 02:25:18,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-12 02:25:18,809 INFO L87 Difference]: Start difference. First operand 94 states and 131 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (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-12 02:25:19,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:25:19,315 INFO L93 Difference]: Finished difference Result 234 states and 325 transitions. [2023-11-12 02:25:19,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 02:25:19,316 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (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-12 02:25:19,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:25:19,319 INFO L225 Difference]: With dead ends: 234 [2023-11-12 02:25:19,319 INFO L226 Difference]: Without dead ends: 143 [2023-11-12 02:25:19,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-11-12 02:25:19,322 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 323 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-12 02:25:19,323 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 353 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-12 02:25:19,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2023-11-12 02:25:19,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 140. [2023-11-12 02:25:19,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 120 states have (on average 1.3333333333333333) internal successors, (160), 121 states have internal predecessors, (160), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-12 02:25:19,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 194 transitions. [2023-11-12 02:25:19,362 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 194 transitions. Word has length 120 [2023-11-12 02:25:19,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:25:19,362 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 194 transitions. [2023-11-12 02:25:19,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (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-12 02:25:19,363 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 194 transitions. [2023-11-12 02:25:19,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-12 02:25:19,365 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:25:19,365 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-12 02:25:19,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 02:25:19,366 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:25:19,366 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:25:19,366 INFO L85 PathProgramCache]: Analyzing trace with hash -185142692, now seen corresponding path program 1 times [2023-11-12 02:25:19,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:25:19,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992911838] [2023-11-12 02:25:19,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:25:19,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:25:19,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:19,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:25:19,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:19,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:25:19,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:19,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:25:19,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:19,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:25:19,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:19,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:25:19,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:19,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:25:19,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:19,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-12 02:25:19,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:19,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-12 02:25:19,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:19,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:25:19,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:19,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-12 02:25:19,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:19,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-12 02:25:19,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:19,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:25:19,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:19,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-12 02:25:19,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:19,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-12 02:25:19,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:19,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-12 02:25:19,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:19,586 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-12 02:25:19,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:25:19,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992911838] [2023-11-12 02:25:19,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992911838] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:25:19,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:25:19,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:25:19,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590773100] [2023-11-12 02:25:19,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:25:19,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:25:19,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:25:19,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:25:19,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:25:19,593 INFO L87 Difference]: Start difference. First operand 140 states and 194 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-12 02:25:19,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:25:19,619 INFO L93 Difference]: Finished difference Result 295 states and 411 transitions. [2023-11-12 02:25:19,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:25:19,620 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-12 02:25:19,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:25:19,624 INFO L225 Difference]: With dead ends: 295 [2023-11-12 02:25:19,624 INFO L226 Difference]: Without dead ends: 158 [2023-11-12 02:25:19,625 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-12 02:25:19,634 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-12 02:25:19,635 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-12 02:25:19,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2023-11-12 02:25:19,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 140. [2023-11-12 02:25:19,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 120 states have (on average 1.3166666666666667) internal successors, (158), 121 states have internal predecessors, (158), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-12 02:25:19,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 192 transitions. [2023-11-12 02:25:19,662 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 192 transitions. Word has length 122 [2023-11-12 02:25:19,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:25:19,668 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 192 transitions. [2023-11-12 02:25:19,668 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-12 02:25:19,668 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 192 transitions. [2023-11-12 02:25:19,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-12 02:25:19,670 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:25:19,671 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-12 02:25:19,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 02:25:19,671 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:25:19,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:25:19,673 INFO L85 PathProgramCache]: Analyzing trace with hash 569522220, now seen corresponding path program 1 times [2023-11-12 02:25:19,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:25:19,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670092115] [2023-11-12 02:25:19,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:25:19,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:25:19,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:20,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:25:20,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:20,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:25:20,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:20,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:25:20,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:20,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:25:20,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:20,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:25:20,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:20,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:25:20,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:20,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-12 02:25:20,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:20,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-12 02:25:20,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:20,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:25:20,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:20,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-12 02:25:20,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:20,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-12 02:25:20,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:20,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:25:20,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:20,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-12 02:25:20,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:20,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-12 02:25:20,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:20,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-12 02:25:20,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:20,286 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-12 02:25:20,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:25:20,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670092115] [2023-11-12 02:25:20,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670092115] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:25:20,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:25:20,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-12 02:25:20,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633745316] [2023-11-12 02:25:20,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:25:20,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 02:25:20,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:25:20,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 02:25:20,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:25:20,291 INFO L87 Difference]: Start difference. First operand 140 states and 192 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-12 02:25:20,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:25:20,920 INFO L93 Difference]: Finished difference Result 295 states and 403 transitions. [2023-11-12 02:25:20,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:25:20,921 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-12 02:25:20,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:25:20,924 INFO L225 Difference]: With dead ends: 295 [2023-11-12 02:25:20,924 INFO L226 Difference]: Without dead ends: 158 [2023-11-12 02:25:20,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 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-12 02:25:20,926 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 158 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-12 02:25:20,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 385 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-12 02:25:20,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2023-11-12 02:25:20,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 155. [2023-11-12 02:25:20,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 131 states have (on average 1.3053435114503817) internal successors, (171), 132 states have internal predecessors, (171), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-12 02:25:20,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 211 transitions. [2023-11-12 02:25:20,956 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 211 transitions. Word has length 122 [2023-11-12 02:25:20,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:25:20,959 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 211 transitions. [2023-11-12 02:25:20,959 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-12 02:25:20,959 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 211 transitions. [2023-11-12 02:25:20,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-12 02:25:20,963 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:25:20,964 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-12 02:25:20,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-12 02:25:20,964 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:25:20,965 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:25:20,965 INFO L85 PathProgramCache]: Analyzing trace with hash 364991370, now seen corresponding path program 1 times [2023-11-12 02:25:20,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:25:20,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286145771] [2023-11-12 02:25:20,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:25:20,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:25:21,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:21,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:25:21,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:21,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:25:21,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:21,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:25:21,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:21,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:25:21,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:21,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:25:21,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:21,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:25:21,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:21,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-12 02:25:21,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:21,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-12 02:25:21,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:21,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:25:21,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:21,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-12 02:25:21,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:21,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-12 02:25:21,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:21,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:25:21,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:21,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-12 02:25:21,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:21,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-12 02:25:21,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:21,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-12 02:25:21,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:21,359 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-12 02:25:21,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:25:21,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286145771] [2023-11-12 02:25:21,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286145771] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:25:21,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:25:21,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 02:25:21,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657216224] [2023-11-12 02:25:21,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:25:21,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:25:21,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:25:21,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:25:21,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:25:21,366 INFO L87 Difference]: Start difference. First operand 155 states and 211 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-12 02:25:21,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:25:21,462 INFO L93 Difference]: Finished difference Result 347 states and 475 transitions. [2023-11-12 02:25:21,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:25:21,463 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-12 02:25:21,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:25:21,469 INFO L225 Difference]: With dead ends: 347 [2023-11-12 02:25:21,469 INFO L226 Difference]: Without dead ends: 195 [2023-11-12 02:25:21,471 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-12 02:25:21,475 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-12 02:25:21,475 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-12 02:25:21,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2023-11-12 02:25:21,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 163. [2023-11-12 02:25:21,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 139 states have (on average 1.2877697841726619) internal successors, (179), 140 states have internal predecessors, (179), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-12 02:25:21,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 219 transitions. [2023-11-12 02:25:21,502 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 219 transitions. Word has length 124 [2023-11-12 02:25:21,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:25:21,503 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 219 transitions. [2023-11-12 02:25:21,504 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-12 02:25:21,504 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 219 transitions. [2023-11-12 02:25:21,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-12 02:25:21,506 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:25:21,506 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-12 02:25:21,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-12 02:25:21,507 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:25:21,507 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:25:21,507 INFO L85 PathProgramCache]: Analyzing trace with hash 670312422, now seen corresponding path program 1 times [2023-11-12 02:25:21,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:25:21,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127470995] [2023-11-12 02:25:21,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:25:21,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:25:21,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:21,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:25:21,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:21,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:25:21,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:21,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:25:21,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:21,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:25:21,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:21,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:25:21,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:21,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:25:21,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:21,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-12 02:25:21,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:21,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-12 02:25:21,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:21,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:25:21,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:21,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-12 02:25:21,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:21,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-12 02:25:21,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:21,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:25:21,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:21,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-12 02:25:21,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:21,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-12 02:25:21,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:21,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-12 02:25:21,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:21,684 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-12 02:25:21,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:25:21,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127470995] [2023-11-12 02:25:21,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127470995] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:25:21,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:25:21,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:25:21,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937187257] [2023-11-12 02:25:21,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:25:21,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:25:21,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:25:21,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:25:21,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:25:21,687 INFO L87 Difference]: Start difference. First operand 163 states and 219 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-12 02:25:21,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:25:21,717 INFO L93 Difference]: Finished difference Result 325 states and 439 transitions. [2023-11-12 02:25:21,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:25:21,718 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-12 02:25:21,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:25:21,721 INFO L225 Difference]: With dead ends: 325 [2023-11-12 02:25:21,722 INFO L226 Difference]: Without dead ends: 165 [2023-11-12 02:25:21,722 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-12 02:25:21,724 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-12 02:25:21,728 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-12 02:25:21,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2023-11-12 02:25:21,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2023-11-12 02:25:21,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 141 states have (on average 1.2836879432624113) internal successors, (181), 142 states have internal predecessors, (181), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-12 02:25:21,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 221 transitions. [2023-11-12 02:25:21,758 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 221 transitions. Word has length 124 [2023-11-12 02:25:21,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:25:21,759 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 221 transitions. [2023-11-12 02:25:21,759 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-12 02:25:21,759 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 221 transitions. [2023-11-12 02:25:21,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-12 02:25:21,762 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:25:21,763 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-12 02:25:21,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-12 02:25:21,763 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:25:21,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:25:21,764 INFO L85 PathProgramCache]: Analyzing trace with hash -340804828, now seen corresponding path program 1 times [2023-11-12 02:25:21,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:25:21,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305515965] [2023-11-12 02:25:21,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:25:21,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:25:21,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:23,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:25:23,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:23,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:25:23,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:23,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:25:23,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:23,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:25:23,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:23,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:25:23,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:23,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:25:23,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:23,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-12 02:25:23,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:23,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-12 02:25:23,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:23,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:25:23,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:23,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-12 02:25:23,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:23,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-12 02:25:23,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:23,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:25:23,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:23,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-12 02:25:23,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:23,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-12 02:25:23,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:23,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-12 02:25:23,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:23,480 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-12 02:25:23,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:25:23,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305515965] [2023-11-12 02:25:23,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305515965] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:25:23,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:25:23,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-12 02:25:23,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492915185] [2023-11-12 02:25:23,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:25:23,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-12 02:25:23,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:25:23,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-12 02:25:23,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-11-12 02:25:23,484 INFO L87 Difference]: Start difference. First operand 165 states and 221 transitions. Second operand has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 10 states have internal predecessors, (52), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2023-11-12 02:25:24,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:25:24,449 INFO L93 Difference]: Finished difference Result 384 states and 508 transitions. [2023-11-12 02:25:24,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 02:25:24,450 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 10 states have internal predecessors, (52), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 124 [2023-11-12 02:25:24,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:25:24,453 INFO L225 Difference]: With dead ends: 384 [2023-11-12 02:25:24,453 INFO L226 Difference]: Without dead ends: 222 [2023-11-12 02:25:24,454 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2023-11-12 02:25:24,457 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 398 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-12 02:25:24,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 397 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-12 02:25:24,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2023-11-12 02:25:24,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 172. [2023-11-12 02:25:24,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 145 states have (on average 1.2620689655172415) internal successors, (183), 147 states have internal predecessors, (183), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-12 02:25:24,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 227 transitions. [2023-11-12 02:25:24,492 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 227 transitions. Word has length 124 [2023-11-12 02:25:24,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:25:24,493 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 227 transitions. [2023-11-12 02:25:24,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 10 states have internal predecessors, (52), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2023-11-12 02:25:24,493 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 227 transitions. [2023-11-12 02:25:24,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-11-12 02:25:24,496 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:25:24,496 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-12 02:25:24,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-12 02:25:24,497 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:25:24,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:25:24,497 INFO L85 PathProgramCache]: Analyzing trace with hash -559895515, now seen corresponding path program 1 times [2023-11-12 02:25:24,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:25:24,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949384137] [2023-11-12 02:25:24,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:25:24,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:25:24,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:24,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:25:24,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:24,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:25:24,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:24,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:25:24,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:25,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:25:25,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:25,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:25:25,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:25,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:25:25,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:25,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-12 02:25:25,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:25,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-12 02:25:25,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:25,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:25:25,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:25,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-12 02:25:25,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:25,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-12 02:25:25,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:25,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:25:25,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:25,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-12 02:25:25,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:25,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-12 02:25:25,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:25,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-12 02:25:25,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:25,049 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-12 02:25:25,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:25:25,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949384137] [2023-11-12 02:25:25,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949384137] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:25:25,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:25:25,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:25:25,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927897776] [2023-11-12 02:25:25,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:25:25,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:25:25,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:25:25,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:25:25,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:25:25,052 INFO L87 Difference]: Start difference. First operand 172 states and 227 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-12 02:25:25,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:25:25,400 INFO L93 Difference]: Finished difference Result 352 states and 463 transitions. [2023-11-12 02:25:25,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:25:25,401 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 126 [2023-11-12 02:25:25,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:25:25,404 INFO L225 Difference]: With dead ends: 352 [2023-11-12 02:25:25,404 INFO L226 Difference]: Without dead ends: 188 [2023-11-12 02:25:25,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:25:25,406 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 107 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 02:25:25,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 455 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 02:25:25,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2023-11-12 02:25:25,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 170. [2023-11-12 02:25:25,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 142 states have (on average 1.2464788732394365) internal successors, (177), 144 states have internal predecessors, (177), 22 states have call successors, (22), 5 states have call predecessors, (22), 5 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-12 02:25:25,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 221 transitions. [2023-11-12 02:25:25,432 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 221 transitions. Word has length 126 [2023-11-12 02:25:25,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:25:25,433 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 221 transitions. [2023-11-12 02:25:25,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-12 02:25:25,434 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 221 transitions. [2023-11-12 02:25:25,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-11-12 02:25:25,435 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:25:25,436 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-12 02:25:25,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-12 02:25:25,436 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:25:25,436 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:25:25,437 INFO L85 PathProgramCache]: Analyzing trace with hash -12053055, now seen corresponding path program 1 times [2023-11-12 02:25:25,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:25:25,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874232117] [2023-11-12 02:25:25,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:25:25,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:25:25,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:26,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:25:26,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:26,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:25:26,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:26,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:25:26,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:26,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:25:26,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:26,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:25:26,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:26,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:25:26,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:26,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-12 02:25:26,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:26,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-12 02:25:26,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:26,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:25:26,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:26,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-12 02:25:26,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:26,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-12 02:25:26,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:26,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:25:26,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:26,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-12 02:25:26,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:26,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-12 02:25:26,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:26,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-12 02:25:26,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:26,631 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-12 02:25:26,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:25:26,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874232117] [2023-11-12 02:25:26,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874232117] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:25:26,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:25:26,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-12 02:25:26,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277247120] [2023-11-12 02:25:26,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:25:26,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-12 02:25:26,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:25:26,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-12 02:25:26,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-11-12 02:25:26,635 INFO L87 Difference]: Start difference. First operand 170 states and 221 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 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-12 02:25:27,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:25:27,116 INFO L93 Difference]: Finished difference Result 333 states and 433 transitions. [2023-11-12 02:25:27,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 02:25:27,117 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 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-12 02:25:27,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:25:27,120 INFO L225 Difference]: With dead ends: 333 [2023-11-12 02:25:27,120 INFO L226 Difference]: Without dead ends: 171 [2023-11-12 02:25:27,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2023-11-12 02:25:27,122 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 133 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-12 02:25:27,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 305 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-12 02:25:27,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2023-11-12 02:25:27,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 170. [2023-11-12 02:25:27,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 142 states have (on average 1.2394366197183098) internal successors, (176), 144 states have internal predecessors, (176), 22 states have call successors, (22), 5 states have call predecessors, (22), 5 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-12 02:25:27,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 220 transitions. [2023-11-12 02:25:27,147 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 220 transitions. Word has length 126 [2023-11-12 02:25:27,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:25:27,148 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 220 transitions. [2023-11-12 02:25:27,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 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-12 02:25:27,149 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 220 transitions. [2023-11-12 02:25:27,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-11-12 02:25:27,151 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:25:27,151 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-12 02:25:27,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-12 02:25:27,151 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:25:27,152 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:25:27,152 INFO L85 PathProgramCache]: Analyzing trace with hash 991290289, now seen corresponding path program 1 times [2023-11-12 02:25:27,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:25:27,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467855568] [2023-11-12 02:25:27,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:25:27,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:25:27,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:28,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:25:28,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:28,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:25:28,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:28,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:25:28,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:28,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:25:28,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:28,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:25:28,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:28,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:25:28,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:28,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-12 02:25:28,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:28,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-12 02:25:28,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:28,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:25:28,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:28,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-12 02:25:28,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:28,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-12 02:25:28,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:28,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:25:28,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:28,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-12 02:25:28,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:28,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-12 02:25:28,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:28,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-12 02:25:28,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:28,500 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-12 02:25:28,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:25:28,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467855568] [2023-11-12 02:25:28,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467855568] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:25:28,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:25:28,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-12 02:25:28,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894153602] [2023-11-12 02:25:28,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:25:28,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-12 02:25:28,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:25:28,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-12 02:25:28,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-12 02:25:28,504 INFO L87 Difference]: Start difference. First operand 170 states and 220 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-12 02:25:29,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:25:29,132 INFO L93 Difference]: Finished difference Result 404 states and 521 transitions. [2023-11-12 02:25:29,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-12 02:25:29,133 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-12 02:25:29,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:25:29,139 INFO L225 Difference]: With dead ends: 404 [2023-11-12 02:25:29,139 INFO L226 Difference]: Without dead ends: 242 [2023-11-12 02:25:29,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2023-11-12 02:25:29,141 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 240 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-12 02:25:29,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 615 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-12 02:25:29,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2023-11-12 02:25:29,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 195. [2023-11-12 02:25:29,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 167 states have (on average 1.2335329341317365) internal successors, (206), 169 states have internal predecessors, (206), 22 states have call successors, (22), 5 states have call predecessors, (22), 5 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-12 02:25:29,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 250 transitions. [2023-11-12 02:25:29,166 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 250 transitions. Word has length 128 [2023-11-12 02:25:29,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:25:29,167 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 250 transitions. [2023-11-12 02:25:29,168 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-12 02:25:29,168 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 250 transitions. [2023-11-12 02:25:29,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-11-12 02:25:29,169 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:25:29,170 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-12 02:25:29,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-12 02:25:29,170 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:25:29,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:25:29,171 INFO L85 PathProgramCache]: Analyzing trace with hash 5207653, now seen corresponding path program 1 times [2023-11-12 02:25:29,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:25:29,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378044959] [2023-11-12 02:25:29,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:25:29,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:25:29,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:29,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:25:29,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:29,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:25:29,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:29,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:25:29,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:29,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:25:29,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:29,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:25:29,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:29,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:25:29,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:29,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-12 02:25:29,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:29,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-12 02:25:29,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:29,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:25:29,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:29,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-12 02:25:29,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:29,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-12 02:25:29,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:29,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:25:29,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:29,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-12 02:25:29,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:29,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-12 02:25:29,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:29,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-12 02:25:29,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:29,559 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-12 02:25:29,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:25:29,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378044959] [2023-11-12 02:25:29,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378044959] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:25:29,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:25:29,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-12 02:25:29,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112134119] [2023-11-12 02:25:29,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:25:29,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 02:25:29,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:25:29,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 02:25:29,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:25:29,563 INFO L87 Difference]: Start difference. First operand 195 states and 250 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-12 02:25:30,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:25:30,065 INFO L93 Difference]: Finished difference Result 475 states and 608 transitions. [2023-11-12 02:25:30,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:25:30,066 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-12 02:25:30,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:25:30,068 INFO L225 Difference]: With dead ends: 475 [2023-11-12 02:25:30,069 INFO L226 Difference]: Without dead ends: 288 [2023-11-12 02:25:30,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-11-12 02:25:30,070 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 168 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-12 02:25:30,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 440 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-12 02:25:30,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2023-11-12 02:25:30,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 224. [2023-11-12 02:25:30,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 193 states have (on average 1.2227979274611398) internal successors, (236), 195 states have internal predecessors, (236), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-12 02:25:30,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 284 transitions. [2023-11-12 02:25:30,103 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 284 transitions. Word has length 129 [2023-11-12 02:25:30,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:25:30,104 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 284 transitions. [2023-11-12 02:25:30,104 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-12 02:25:30,104 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 284 transitions. [2023-11-12 02:25:30,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-11-12 02:25:30,106 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:25:30,106 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-12 02:25:30,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-12 02:25:30,107 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:25:30,107 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:25:30,107 INFO L85 PathProgramCache]: Analyzing trace with hash -56831961, now seen corresponding path program 1 times [2023-11-12 02:25:30,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:25:30,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736352032] [2023-11-12 02:25:30,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:25:30,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:25:30,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:30,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:25:30,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:30,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:25:30,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:30,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:25:30,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:30,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:25:30,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:30,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:25:30,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:30,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:25:30,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:30,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-12 02:25:30,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:30,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-12 02:25:30,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:30,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:25:30,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:30,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-12 02:25:30,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:30,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-12 02:25:30,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:30,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:25:30,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:30,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-12 02:25:30,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:30,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-12 02:25:30,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:30,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-12 02:25:30,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:30,595 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-12 02:25:30,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:25:30,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736352032] [2023-11-12 02:25:30,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736352032] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:25:30,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:25:30,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-12 02:25:30,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804505765] [2023-11-12 02:25:30,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:25:30,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 02:25:30,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:25:30,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 02:25:30,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:25:30,599 INFO L87 Difference]: Start difference. First operand 224 states and 284 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-12 02:25:31,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:25:31,024 INFO L93 Difference]: Finished difference Result 492 states and 627 transitions. [2023-11-12 02:25:31,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:25:31,025 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-12 02:25:31,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:25:31,028 INFO L225 Difference]: With dead ends: 492 [2023-11-12 02:25:31,029 INFO L226 Difference]: Without dead ends: 284 [2023-11-12 02:25:31,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-11-12 02:25:31,030 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 215 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 02:25:31,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 377 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 02:25:31,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2023-11-12 02:25:31,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 203. [2023-11-12 02:25:31,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 172 states have (on average 1.2209302325581395) internal successors, (210), 174 states have internal predecessors, (210), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-12 02:25:31,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 258 transitions. [2023-11-12 02:25:31,068 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 258 transitions. Word has length 129 [2023-11-12 02:25:31,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:25:31,069 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 258 transitions. [2023-11-12 02:25:31,070 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-12 02:25:31,070 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 258 transitions. [2023-11-12 02:25:31,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-11-12 02:25:31,072 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:25:31,072 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-12 02:25:31,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-12 02:25:31,072 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:25:31,073 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:25:31,073 INFO L85 PathProgramCache]: Analyzing trace with hash -998036650, now seen corresponding path program 1 times [2023-11-12 02:25:31,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:25:31,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447437640] [2023-11-12 02:25:31,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:25:31,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:25:31,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:31,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:25:31,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:31,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:25:31,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:31,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:25:31,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:31,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:25:31,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:31,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:25:31,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:31,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:25:31,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:31,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-12 02:25:31,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:31,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-12 02:25:31,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:31,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:25:31,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:31,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-12 02:25:31,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:31,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-12 02:25:31,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:31,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:25:31,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:31,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-12 02:25:31,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:31,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-12 02:25:31,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:31,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-12 02:25:31,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:31,697 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-12 02:25:31,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:25:31,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447437640] [2023-11-12 02:25:31,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447437640] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:25:31,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:25:31,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-12 02:25:31,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150669906] [2023-11-12 02:25:31,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:25:31,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 02:25:31,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:25:31,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 02:25:31,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:25:31,702 INFO L87 Difference]: Start difference. First operand 203 states and 258 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 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-12 02:25:32,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:25:32,039 INFO L93 Difference]: Finished difference Result 333 states and 426 transitions. [2023-11-12 02:25:32,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-12 02:25:32,040 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 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-12 02:25:32,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:25:32,043 INFO L225 Difference]: With dead ends: 333 [2023-11-12 02:25:32,044 INFO L226 Difference]: Without dead ends: 331 [2023-11-12 02:25:32,046 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-11-12 02:25:32,047 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 104 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 982 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 02:25:32,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 982 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 02:25:32,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2023-11-12 02:25:32,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 242. [2023-11-12 02:25:32,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 211 states have (on average 1.1990521327014219) internal successors, (253), 213 states have internal predecessors, (253), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-12 02:25:32,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 301 transitions. [2023-11-12 02:25:32,087 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 301 transitions. Word has length 130 [2023-11-12 02:25:32,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:25:32,088 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 301 transitions. [2023-11-12 02:25:32,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 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-12 02:25:32,088 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 301 transitions. [2023-11-12 02:25:32,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-11-12 02:25:32,091 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:25:32,091 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-12 02:25:32,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-12 02:25:32,092 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:25:32,092 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:25:32,092 INFO L85 PathProgramCache]: Analyzing trace with hash -767295561, now seen corresponding path program 1 times [2023-11-12 02:25:32,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:25:32,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685876266] [2023-11-12 02:25:32,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:25:32,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:25:32,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:32,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:25:32,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:32,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:25:32,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:32,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:25:32,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:32,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:25:32,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:32,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:25:32,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:32,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:25:32,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:32,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-12 02:25:32,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:32,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-12 02:25:32,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:32,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:25:32,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:32,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-12 02:25:32,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:32,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-12 02:25:32,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:32,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:25:32,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:32,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-12 02:25:32,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:32,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-12 02:25:32,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:32,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-12 02:25:32,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:32,618 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-12 02:25:32,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:25:32,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685876266] [2023-11-12 02:25:32,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685876266] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:25:32,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:25:32,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-12 02:25:32,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770921087] [2023-11-12 02:25:32,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:25:32,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 02:25:32,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:25:32,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 02:25:32,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:25:32,630 INFO L87 Difference]: Start difference. First operand 242 states and 301 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 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-12 02:25:33,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:25:33,099 INFO L93 Difference]: Finished difference Result 518 states and 646 transitions. [2023-11-12 02:25:33,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:25:33,100 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 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-12 02:25:33,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:25:33,106 INFO L225 Difference]: With dead ends: 518 [2023-11-12 02:25:33,106 INFO L226 Difference]: Without dead ends: 292 [2023-11-12 02:25:33,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 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-12 02:25:33,108 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 216 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-12 02:25:33,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 380 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-12 02:25:33,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2023-11-12 02:25:33,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 242. [2023-11-12 02:25:33,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 211 states have (on average 1.1895734597156398) internal successors, (251), 213 states have internal predecessors, (251), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-12 02:25:33,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 299 transitions. [2023-11-12 02:25:33,150 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 299 transitions. Word has length 130 [2023-11-12 02:25:33,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:25:33,151 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 299 transitions. [2023-11-12 02:25:33,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 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-12 02:25:33,152 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 299 transitions. [2023-11-12 02:25:33,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-11-12 02:25:33,154 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:25:33,154 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-12 02:25:33,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-12 02:25:33,155 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:25:33,155 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:25:33,156 INFO L85 PathProgramCache]: Analyzing trace with hash 795063659, now seen corresponding path program 1 times [2023-11-12 02:25:33,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:25:33,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927989875] [2023-11-12 02:25:33,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:25:33,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:25:33,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:33,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:25:33,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:33,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:25:33,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:33,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:25:33,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:33,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:25:33,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:33,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:25:33,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:33,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:25:33,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:33,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-12 02:25:33,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:33,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-12 02:25:33,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:33,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:25:33,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:33,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-12 02:25:33,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:33,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-12 02:25:33,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:33,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:25:33,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:33,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-12 02:25:33,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:33,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-12 02:25:33,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:33,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-12 02:25:33,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:33,437 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-12 02:25:33,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:25:33,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927989875] [2023-11-12 02:25:33,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927989875] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:25:33,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:25:33,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:25:33,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185928008] [2023-11-12 02:25:33,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:25:33,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:25:33,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:25:33,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:25:33,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:25:33,441 INFO L87 Difference]: Start difference. First operand 242 states and 299 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-12 02:25:33,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:25:33,754 INFO L93 Difference]: Finished difference Result 543 states and 678 transitions. [2023-11-12 02:25:33,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:25:33,755 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-12 02:25:33,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:25:33,758 INFO L225 Difference]: With dead ends: 543 [2023-11-12 02:25:33,758 INFO L226 Difference]: Without dead ends: 317 [2023-11-12 02:25:33,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-12 02:25:33,759 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 133 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 02:25:33,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 411 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 02:25:33,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2023-11-12 02:25:33,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 278. [2023-11-12 02:25:33,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 241 states have (on average 1.1867219917012448) internal successors, (286), 244 states have internal predecessors, (286), 28 states have call successors, (28), 8 states have call predecessors, (28), 8 states have return successors, (28), 25 states have call predecessors, (28), 28 states have call successors, (28) [2023-11-12 02:25:33,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 342 transitions. [2023-11-12 02:25:33,796 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 342 transitions. Word has length 131 [2023-11-12 02:25:33,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:25:33,796 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 342 transitions. [2023-11-12 02:25:33,797 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-12 02:25:33,797 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 342 transitions. [2023-11-12 02:25:33,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-11-12 02:25:33,800 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:25:33,800 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-12 02:25:33,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-12 02:25:33,800 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:25:33,801 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:25:33,801 INFO L85 PathProgramCache]: Analyzing trace with hash 402036649, now seen corresponding path program 1 times [2023-11-12 02:25:33,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:25:33,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534048835] [2023-11-12 02:25:33,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:25:33,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:25:33,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:34,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:25:34,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:34,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:25:34,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:34,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:25:34,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:34,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:25:34,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:34,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:25:34,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:34,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:25:34,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:34,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-12 02:25:34,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:34,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-12 02:25:34,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:34,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:25:34,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:34,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-12 02:25:34,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:34,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-12 02:25:34,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:34,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:25:34,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:34,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-12 02:25:34,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:34,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-12 02:25:34,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:34,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-12 02:25:34,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:34,051 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-12 02:25:34,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:25:34,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534048835] [2023-11-12 02:25:34,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534048835] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:25:34,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:25:34,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-12 02:25:34,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600703142] [2023-11-12 02:25:34,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:25:34,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 02:25:34,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:25:34,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 02:25:34,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:25:34,055 INFO L87 Difference]: Start difference. First operand 278 states and 342 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-12 02:25:34,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:25:34,168 INFO L93 Difference]: Finished difference Result 576 states and 716 transitions. [2023-11-12 02:25:34,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 02:25:34,169 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-12 02:25:34,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:25:34,172 INFO L225 Difference]: With dead ends: 576 [2023-11-12 02:25:34,172 INFO L226 Difference]: Without dead ends: 314 [2023-11-12 02:25:34,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-11-12 02:25:34,175 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-12 02:25:34,175 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-12 02:25:34,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2023-11-12 02:25:34,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 279. [2023-11-12 02:25:34,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 242 states have (on average 1.177685950413223) internal successors, (285), 245 states have internal predecessors, (285), 28 states have call successors, (28), 8 states have call predecessors, (28), 8 states have return successors, (28), 25 states have call predecessors, (28), 28 states have call successors, (28) [2023-11-12 02:25:34,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 341 transitions. [2023-11-12 02:25:34,212 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 341 transitions. Word has length 131 [2023-11-12 02:25:34,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:25:34,214 INFO L495 AbstractCegarLoop]: Abstraction has 279 states and 341 transitions. [2023-11-12 02:25:34,214 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-12 02:25:34,215 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 341 transitions. [2023-11-12 02:25:34,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-11-12 02:25:34,217 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:25:34,217 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-12 02:25:34,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-12 02:25:34,218 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:25:34,218 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:25:34,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1805806805, now seen corresponding path program 1 times [2023-11-12 02:25:34,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:25:34,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252748319] [2023-11-12 02:25:34,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:25:34,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:25:34,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:35,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:25:35,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:35,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:25:35,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:35,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:25:35,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:35,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:25:35,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:35,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:25:35,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:35,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:25:35,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:35,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-12 02:25:35,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:35,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-12 02:25:35,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:35,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:25:35,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:35,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-12 02:25:35,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:35,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-12 02:25:35,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:35,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:25:35,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:35,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-12 02:25:35,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:35,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-12 02:25:35,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:35,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-12 02:25:35,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:35,527 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-11-12 02:25:35,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:25:35,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252748319] [2023-11-12 02:25:35,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252748319] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:25:35,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244969737] [2023-11-12 02:25:35,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:25:35,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:25:35,529 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30d9e630-4905-4777-a6ae-e81945b26296/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:25:35,535 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30d9e630-4905-4777-a6ae-e81945b26296/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:25:35,559 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30d9e630-4905-4777-a6ae-e81945b26296/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-12 02:25:35,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:35,793 INFO L262 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 33 conjunts are in the unsatisfiable core [2023-11-12 02:25:35,814 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:25:36,089 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 19 treesize of output 1 [2023-11-12 02:25:36,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:25:36,436 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 20 treesize of output 15 [2023-11-12 02:25:36,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:25:36,592 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 20 treesize of output 15 [2023-11-12 02:25:36,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:25:36,834 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 20 treesize of output 15 [2023-11-12 02:25:37,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:25:37,040 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 20 treesize of output 15 [2023-11-12 02:25:37,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:25:37,251 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 20 treesize of output 15 [2023-11-12 02:25:37,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:25:37,461 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 20 treesize of output 15 [2023-11-12 02:25:37,646 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2023-11-12 02:25:37,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:25:37,729 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 35 treesize of output 26 [2023-11-12 02:25:37,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:25:37,824 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 35 treesize of output 26 [2023-11-12 02:25:37,948 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:25:37,949 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 1 case distinctions, treesize of input 42 treesize of output 27 [2023-11-12 02:25:38,026 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:25:38,026 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 12 [2023-11-12 02:25:38,046 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 100 proven. 213 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2023-11-12 02:25:38,046 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:25:38,135 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_903 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_903) |c_~#BOOL_unsigned_char_Array_0~0.base|) (+ 3 |c_~#BOOL_unsigned_char_Array_0~0.offset|)))) (< .cse0 (+ (* 256 (div .cse0 256)) 1)))) is different from false [2023-11-12 02:25:38,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [244969737] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:25:38,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-12 02:25:38,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2023-11-12 02:25:38,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909541586] [2023-11-12 02:25:38,358 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-12 02:25:38,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-12 02:25:38,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:25:38,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-12 02:25:38,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=455, Unknown=10, NotChecked=44, Total=600 [2023-11-12 02:25:38,361 INFO L87 Difference]: Start difference. First operand 279 states and 341 transitions. Second operand has 21 states, 19 states have (on average 6.421052631578948) internal successors, (122), 21 states have internal predecessors, (122), 9 states have call successors, (30), 5 states have call predecessors, (30), 7 states have return successors, (30), 7 states have call predecessors, (30), 9 states have call successors, (30) [2023-11-12 02:25:40,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:25:40,339 INFO L93 Difference]: Finished difference Result 551 states and 670 transitions. [2023-11-12 02:25:40,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-12 02:25:40,340 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 6.421052631578948) internal successors, (122), 21 states have internal predecessors, (122), 9 states have call successors, (30), 5 states have call predecessors, (30), 7 states have return successors, (30), 7 states have call predecessors, (30), 9 states have call successors, (30) Word has length 132 [2023-11-12 02:25:40,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:25:40,342 INFO L225 Difference]: With dead ends: 551 [2023-11-12 02:25:40,342 INFO L226 Difference]: Without dead ends: 288 [2023-11-12 02:25:40,343 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 192 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=413, Invalid=1387, Unknown=10, NotChecked=82, Total=1892 [2023-11-12 02:25:40,344 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 184 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 1220 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 1280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-12 02:25:40,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 408 Invalid, 1280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1220 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-12 02:25:40,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2023-11-12 02:25:40,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 275. [2023-11-12 02:25:40,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 229 states have (on average 1.1528384279475983) internal successors, (264), 231 states have internal predecessors, (264), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2023-11-12 02:25:40,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 334 transitions. [2023-11-12 02:25:40,386 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 334 transitions. Word has length 132 [2023-11-12 02:25:40,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:25:40,386 INFO L495 AbstractCegarLoop]: Abstraction has 275 states and 334 transitions. [2023-11-12 02:25:40,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 6.421052631578948) internal successors, (122), 21 states have internal predecessors, (122), 9 states have call successors, (30), 5 states have call predecessors, (30), 7 states have return successors, (30), 7 states have call predecessors, (30), 9 states have call successors, (30) [2023-11-12 02:25:40,387 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 334 transitions. [2023-11-12 02:25:40,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-11-12 02:25:40,389 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:25:40,390 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-12 02:25:40,402 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30d9e630-4905-4777-a6ae-e81945b26296/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-12 02:25:40,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30d9e630-4905-4777-a6ae-e81945b26296/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:25:40,596 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:25:40,597 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:25:40,597 INFO L85 PathProgramCache]: Analyzing trace with hash -970248319, now seen corresponding path program 1 times [2023-11-12 02:25:40,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:25:40,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300233072] [2023-11-12 02:25:40,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:25:40,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:25:40,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:40,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:25:40,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:40,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:25:40,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:40,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:25:40,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:40,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:25:40,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:40,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:25:40,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:40,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:25:40,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:40,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-12 02:25:40,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:40,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-12 02:25:40,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:40,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:25:40,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:40,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-12 02:25:40,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:40,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-12 02:25:40,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:40,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:25:40,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:40,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-12 02:25:40,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:40,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-12 02:25:40,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:40,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-12 02:25:40,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:40,907 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-12 02:25:40,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:25:40,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300233072] [2023-11-12 02:25:40,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300233072] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:25:40,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:25:40,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:25:40,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954074664] [2023-11-12 02:25:40,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:25:40,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:25:40,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:25:40,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:25:40,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:25:40,910 INFO L87 Difference]: Start difference. First operand 275 states and 334 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-12 02:25:41,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:25:41,103 INFO L93 Difference]: Finished difference Result 486 states and 584 transitions. [2023-11-12 02:25:41,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:25:41,104 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-12 02:25:41,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:25:41,106 INFO L225 Difference]: With dead ends: 486 [2023-11-12 02:25:41,106 INFO L226 Difference]: Without dead ends: 266 [2023-11-12 02:25:41,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:25:41,108 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 47 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 02:25:41,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 346 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 02:25:41,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2023-11-12 02:25:41,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 265. [2023-11-12 02:25:41,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 219 states have (on average 1.1187214611872147) internal successors, (245), 221 states have internal predecessors, (245), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2023-11-12 02:25:41,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 315 transitions. [2023-11-12 02:25:41,152 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 315 transitions. Word has length 133 [2023-11-12 02:25:41,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:25:41,153 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 315 transitions. [2023-11-12 02:25:41,154 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-12 02:25:41,154 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 315 transitions. [2023-11-12 02:25:41,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-11-12 02:25:41,156 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:25:41,156 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-12 02:25:41,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-12 02:25:41,156 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:25:41,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:25:41,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1644886059, now seen corresponding path program 1 times [2023-11-12 02:25:41,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:25:41,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966787521] [2023-11-12 02:25:41,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:25:41,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:25:41,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:41,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:25:41,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:41,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:25:41,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:41,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:25:41,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:41,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:25:41,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:41,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:25:41,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:41,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:25:41,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:41,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-12 02:25:41,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:41,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-12 02:25:41,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:41,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:25:41,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:41,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-12 02:25:41,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:41,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-12 02:25:41,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:41,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:25:41,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:41,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-12 02:25:41,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:41,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-12 02:25:41,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:41,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-12 02:25:41,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:41,403 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-12 02:25:41,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:25:41,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966787521] [2023-11-12 02:25:41,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966787521] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:25:41,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:25:41,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:25:41,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654962822] [2023-11-12 02:25:41,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:25:41,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:25:41,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:25:41,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:25:41,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:25:41,408 INFO L87 Difference]: Start difference. First operand 265 states and 315 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-12 02:25:41,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:25:41,625 INFO L93 Difference]: Finished difference Result 432 states and 513 transitions. [2023-11-12 02:25:41,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:25:41,626 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-12 02:25:41,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:25:41,628 INFO L225 Difference]: With dead ends: 432 [2023-11-12 02:25:41,628 INFO L226 Difference]: Without dead ends: 222 [2023-11-12 02:25:41,629 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-12 02:25:41,630 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 40 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 02:25:41,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 360 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 02:25:41,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2023-11-12 02:25:41,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2023-11-12 02:25:41,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 176 states have (on average 1.1079545454545454) internal successors, (195), 178 states have internal predecessors, (195), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2023-11-12 02:25:41,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 265 transitions. [2023-11-12 02:25:41,691 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 265 transitions. Word has length 134 [2023-11-12 02:25:41,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:25:41,692 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 265 transitions. [2023-11-12 02:25:41,692 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-12 02:25:41,693 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 265 transitions. [2023-11-12 02:25:41,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-11-12 02:25:41,694 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:25:41,695 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-12 02:25:41,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-12 02:25:41,696 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:25:41,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:25:41,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1901447071, now seen corresponding path program 1 times [2023-11-12 02:25:41,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:25:41,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785344237] [2023-11-12 02:25:41,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:25:41,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:25:41,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:42,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:25:42,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:42,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:25:42,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:42,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:25:42,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:42,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:25:42,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:42,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:25:42,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:42,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:25:42,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:42,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-12 02:25:42,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:42,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-12 02:25:42,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:42,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:25:42,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:42,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-12 02:25:42,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:42,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-12 02:25:42,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:42,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:25:42,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:42,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-12 02:25:42,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:42,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-12 02:25:42,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:42,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-12 02:25:42,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:42,094 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-12 02:25:42,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:25:42,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785344237] [2023-11-12 02:25:42,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785344237] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:25:42,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:25:42,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:25:42,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382346452] [2023-11-12 02:25:42,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:25:42,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:25:42,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:25:42,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:25:42,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:25:42,097 INFO L87 Difference]: Start difference. First operand 222 states and 265 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-12 02:25:42,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:25:42,294 INFO L93 Difference]: Finished difference Result 337 states and 402 transitions. [2023-11-12 02:25:42,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:25:42,295 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-12 02:25:42,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:25:42,295 INFO L225 Difference]: With dead ends: 337 [2023-11-12 02:25:42,296 INFO L226 Difference]: Without dead ends: 0 [2023-11-12 02:25:42,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 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-12 02:25:42,298 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 19 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 02:25:42,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 317 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 02:25:42,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-12 02:25:42,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-12 02:25:42,299 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-12 02:25:42,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-12 02:25:42,300 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 134 [2023-11-12 02:25:42,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:25:42,300 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-12 02:25:42,301 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-12 02:25:42,301 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-12 02:25:42,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-12 02:25:42,303 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-12 02:25:42,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-12 02:25:42,306 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-12 02:25:44,536 INFO L895 garLoopResultBuilder]: At program point L85(line 85) the Hoare annotation is: (and (<= 6 |~#signed_char_Array_0~0.base|) (<= 7 |~#signed_long_int_Array_0~0.base|) (<= 5 |~#double_Array_0~0.base|) (<= |~#BOOL_unsigned_char_Array_0~0.base| 4) (<= (mod (select (select |#memory_int| |~#BOOL_unsigned_char_Array_0~0.base|) (+ |~#BOOL_unsigned_char_Array_0~0.offset| 1)) 256) 0) (not (= |~#signed_long_int_Array_0~0.base| |~#signed_char_Array_0~0.base|)) (<= 8 |~#unsigned_char_Array_0~0.base|)) [2023-11-12 02:25:44,536 INFO L899 garLoopResultBuilder]: For program point L85-1(line 85) no Hoare annotation was computed. [2023-11-12 02:25:44,536 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-12 02:25:44,536 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-11-12 02:25:44,537 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-11-12 02:25:44,537 INFO L899 garLoopResultBuilder]: For program point L53(lines 53 55) no Hoare annotation was computed. [2023-11-12 02:25:44,537 INFO L899 garLoopResultBuilder]: For program point L53-2(lines 47 57) no Hoare annotation was computed. [2023-11-12 02:25:44,537 INFO L899 garLoopResultBuilder]: For program point L103(line 103) no Hoare annotation was computed. [2023-11-12 02:25:44,537 INFO L899 garLoopResultBuilder]: For program point L103-2(line 103) no Hoare annotation was computed. [2023-11-12 02:25:44,537 INFO L899 garLoopResultBuilder]: For program point L103-3(line 103) no Hoare annotation was computed. [2023-11-12 02:25:44,537 INFO L899 garLoopResultBuilder]: For program point L103-4(line 103) no Hoare annotation was computed. [2023-11-12 02:25:44,538 INFO L899 garLoopResultBuilder]: For program point L103-5(line 103) no Hoare annotation was computed. [2023-11-12 02:25:44,538 INFO L899 garLoopResultBuilder]: For program point L103-6(line 103) no Hoare annotation was computed. [2023-11-12 02:25:44,538 INFO L899 garLoopResultBuilder]: For program point L103-8(line 103) no Hoare annotation was computed. [2023-11-12 02:25:44,538 INFO L899 garLoopResultBuilder]: For program point L103-10(line 103) no Hoare annotation was computed. [2023-11-12 02:25:44,538 INFO L899 garLoopResultBuilder]: For program point L103-12(line 103) no Hoare annotation was computed. [2023-11-12 02:25:44,538 INFO L899 garLoopResultBuilder]: For program point L103-14(line 103) no Hoare annotation was computed. [2023-11-12 02:25:44,538 INFO L899 garLoopResultBuilder]: For program point L103-15(line 103) no Hoare annotation was computed. [2023-11-12 02:25:44,539 INFO L895 garLoopResultBuilder]: At program point L87(line 87) the Hoare annotation is: (and (<= 6 |~#signed_char_Array_0~0.base|) (<= 7 |~#signed_long_int_Array_0~0.base|) (<= 5 |~#double_Array_0~0.base|) (<= |~#BOOL_unsigned_char_Array_0~0.base| 4) (<= (mod (select (select |#memory_int| |~#BOOL_unsigned_char_Array_0~0.base|) (+ |~#BOOL_unsigned_char_Array_0~0.offset| 1)) 256) 0) (not (= |~#signed_long_int_Array_0~0.base| |~#signed_char_Array_0~0.base|)) (<= 8 |~#unsigned_char_Array_0~0.base|)) [2023-11-12 02:25:44,539 INFO L899 garLoopResultBuilder]: For program point L103-16(line 103) no Hoare annotation was computed. [2023-11-12 02:25:44,539 INFO L899 garLoopResultBuilder]: For program point L87-1(line 87) no Hoare annotation was computed. [2023-11-12 02:25:44,539 INFO L899 garLoopResultBuilder]: For program point L103-17(line 103) no Hoare annotation was computed. [2023-11-12 02:25:44,539 INFO L899 garLoopResultBuilder]: For program point L103-19(line 103) no Hoare annotation was computed. [2023-11-12 02:25:44,540 INFO L899 garLoopResultBuilder]: For program point L103-21(line 103) no Hoare annotation was computed. [2023-11-12 02:25:44,540 INFO L899 garLoopResultBuilder]: For program point L103-23(line 103) no Hoare annotation was computed. [2023-11-12 02:25:44,540 INFO L899 garLoopResultBuilder]: For program point L103-25(line 103) no Hoare annotation was computed. [2023-11-12 02:25:44,540 INFO L899 garLoopResultBuilder]: For program point L103-26(line 103) no Hoare annotation was computed. [2023-11-12 02:25:44,540 INFO L899 garLoopResultBuilder]: For program point L103-27(line 103) no Hoare annotation was computed. [2023-11-12 02:25:44,540 INFO L899 garLoopResultBuilder]: For program point L103-29(line 103) no Hoare annotation was computed. [2023-11-12 02:25:44,541 INFO L899 garLoopResultBuilder]: For program point L103-30(line 103) no Hoare annotation was computed. [2023-11-12 02:25:44,541 INFO L899 garLoopResultBuilder]: For program point L103-31(line 103) no Hoare annotation was computed. [2023-11-12 02:25:44,541 INFO L899 garLoopResultBuilder]: For program point L103-32(line 103) no Hoare annotation was computed. [2023-11-12 02:25:44,541 INFO L899 garLoopResultBuilder]: For program point L38(lines 38 39) no Hoare annotation was computed. [2023-11-12 02:25:44,541 INFO L899 garLoopResultBuilder]: For program point L103-34(line 103) no Hoare annotation was computed. [2023-11-12 02:25:44,541 INFO L899 garLoopResultBuilder]: For program point L103-35(line 103) no Hoare annotation was computed. [2023-11-12 02:25:44,541 INFO L899 garLoopResultBuilder]: For program point L103-37(line 103) no Hoare annotation was computed. [2023-11-12 02:25:44,542 INFO L899 garLoopResultBuilder]: For program point L103-39(line 103) no Hoare annotation was computed. [2023-11-12 02:25:44,542 INFO L899 garLoopResultBuilder]: For program point L103-41(line 103) no Hoare annotation was computed. [2023-11-12 02:25:44,542 INFO L899 garLoopResultBuilder]: For program point L103-43(line 103) no Hoare annotation was computed. [2023-11-12 02:25:44,542 INFO L895 garLoopResultBuilder]: At program point L88(line 88) the Hoare annotation is: (and (<= 6 |~#signed_char_Array_0~0.base|) (<= 7 |~#signed_long_int_Array_0~0.base|) (<= 5 |~#double_Array_0~0.base|) (<= |~#BOOL_unsigned_char_Array_0~0.base| 4) (<= (mod (select (select |#memory_int| |~#BOOL_unsigned_char_Array_0~0.base|) (+ |~#BOOL_unsigned_char_Array_0~0.offset| 1)) 256) 0) (not (= |~#signed_long_int_Array_0~0.base| |~#signed_char_Array_0~0.base|)) (<= 8 |~#unsigned_char_Array_0~0.base|)) [2023-11-12 02:25:44,542 INFO L899 garLoopResultBuilder]: For program point L88-1(line 88) no Hoare annotation was computed. [2023-11-12 02:25:44,542 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 73) no Hoare annotation was computed. [2023-11-12 02:25:44,543 INFO L895 garLoopResultBuilder]: At program point L90(line 90) the Hoare annotation is: (and (<= 6 |~#signed_char_Array_0~0.base|) (<= 7 |~#signed_long_int_Array_0~0.base|) (<= 5 |~#double_Array_0~0.base|) (<= |~#BOOL_unsigned_char_Array_0~0.base| 4) (<= (mod (select (select |#memory_int| |~#BOOL_unsigned_char_Array_0~0.base|) (+ |~#BOOL_unsigned_char_Array_0~0.offset| 1)) 256) 0) (not (= |~#signed_long_int_Array_0~0.base| |~#signed_char_Array_0~0.base|)) (<= 8 |~#unsigned_char_Array_0~0.base|)) [2023-11-12 02:25:44,543 INFO L899 garLoopResultBuilder]: For program point L90-1(line 90) no Hoare annotation was computed. [2023-11-12 02:25:44,543 INFO L899 garLoopResultBuilder]: For program point property_returnLabel#1(lines 102 105) no Hoare annotation was computed. [2023-11-12 02:25:44,543 INFO L899 garLoopResultBuilder]: For program point L74(lines 74 98) no Hoare annotation was computed. [2023-11-12 02:25:44,543 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-12 02:25:44,544 INFO L895 garLoopResultBuilder]: At program point L91(line 91) the Hoare annotation is: (and (<= 6 |~#signed_char_Array_0~0.base|) (<= 7 |~#signed_long_int_Array_0~0.base|) (<= 5 |~#double_Array_0~0.base|) (<= |~#BOOL_unsigned_char_Array_0~0.base| 4) (<= (mod (select (select |#memory_int| |~#BOOL_unsigned_char_Array_0~0.base|) (+ |~#BOOL_unsigned_char_Array_0~0.offset| 1)) 256) 0) (not (= |~#signed_long_int_Array_0~0.base| |~#signed_char_Array_0~0.base|)) (<= 8 |~#unsigned_char_Array_0~0.base|)) [2023-11-12 02:25:44,544 INFO L899 garLoopResultBuilder]: For program point L91-1(line 91) no Hoare annotation was computed. [2023-11-12 02:25:44,544 INFO L899 garLoopResultBuilder]: For program point L42(lines 42 46) no Hoare annotation was computed. [2023-11-12 02:25:44,544 INFO L899 garLoopResultBuilder]: For program point L42-2(lines 42 46) no Hoare annotation was computed. [2023-11-12 02:25:44,544 INFO L899 garLoopResultBuilder]: For program point L59(lines 59 63) no Hoare annotation was computed. [2023-11-12 02:25:44,544 INFO L899 garLoopResultBuilder]: For program point L59-1(lines 59 63) no Hoare annotation was computed. [2023-11-12 02:25:44,545 INFO L895 garLoopResultBuilder]: At program point L76(line 76) the Hoare annotation is: (let ((.cse9 (select |#memory_int| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse8 (select .cse9 (+ |~#BOOL_unsigned_char_Array_0~0.offset| 1)))) (let ((.cse0 (<= 6 |~#signed_char_Array_0~0.base|)) (.cse2 (<= 7 |~#signed_long_int_Array_0~0.base|)) (.cse3 (<= 5 |~#double_Array_0~0.base|)) (.cse4 (<= |~#BOOL_unsigned_char_Array_0~0.base| 4)) (.cse5 (<= (mod .cse8 256) 0)) (.cse6 (not (= |~#signed_long_int_Array_0~0.base| |~#signed_char_Array_0~0.base|))) (.cse1 (select .cse9 (+ |~#BOOL_unsigned_char_Array_0~0.offset| 3))) (.cse7 (<= 8 |~#unsigned_char_Array_0~0.base|))) (or (and .cse0 (<= .cse1 (+ (* (div (+ (- 1) .cse1) 256) 256) 255)) .cse2 .cse3 .cse4 .cse5 .cse6 (not (= (select (select |#memory_int| |~#signed_long_int_Array_0~0.base|) |~#signed_long_int_Array_0~0.offset|) (select (select |#memory_int| |~#signed_char_Array_0~0.base|) (+ |~#signed_char_Array_0~0.offset| 1)))) .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 (= .cse1 .cse8) .cse7))))) [2023-11-12 02:25:44,545 INFO L899 garLoopResultBuilder]: For program point L76-1(line 76) no Hoare annotation was computed. [2023-11-12 02:25:44,545 INFO L895 garLoopResultBuilder]: At program point L109-2(lines 109 115) the Hoare annotation is: (let ((.cse9 (select |#memory_int| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse7 (select .cse9 (+ |~#BOOL_unsigned_char_Array_0~0.offset| 1)))) (let ((.cse0 (<= 6 |~#signed_char_Array_0~0.base|)) (.cse6 (select .cse9 (+ |~#BOOL_unsigned_char_Array_0~0.offset| 3))) (.cse1 (<= 7 |~#signed_long_int_Array_0~0.base|)) (.cse2 (<= 5 |~#double_Array_0~0.base|)) (.cse3 (<= |~#BOOL_unsigned_char_Array_0~0.base| 4)) (.cse4 (<= (mod .cse7 256) 0)) (.cse5 (not (= |~#signed_long_int_Array_0~0.base| |~#signed_char_Array_0~0.base|))) (.cse8 (<= 8 |~#unsigned_char_Array_0~0.base|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= .cse6 .cse7) .cse8) (and .cse0 (<= .cse6 (+ (* (div (+ (- 1) .cse6) 256) 256) 255)) .cse1 .cse2 .cse3 .cse4 .cse5 (= (select .cse9 (+ |~#BOOL_unsigned_char_Array_0~0.offset| 2)) (select .cse9 |~#BOOL_unsigned_char_Array_0~0.offset|)) (not (= (select (select |#memory_int| |~#signed_long_int_Array_0~0.base|) |~#signed_long_int_Array_0~0.offset|) (select (select |#memory_int| |~#signed_char_Array_0~0.base|) (+ |~#signed_char_Array_0~0.offset| 1)))) .cse8))))) [2023-11-12 02:25:44,545 INFO L899 garLoopResultBuilder]: For program point L109-3(lines 109 115) no Hoare annotation was computed. [2023-11-12 02:25:44,546 INFO L895 garLoopResultBuilder]: At program point L93(line 93) the Hoare annotation is: (and (<= 6 |~#signed_char_Array_0~0.base|) (<= 7 |~#signed_long_int_Array_0~0.base|) (<= 5 |~#double_Array_0~0.base|) (<= |~#BOOL_unsigned_char_Array_0~0.base| 4) (<= (mod (select (select |#memory_int| |~#BOOL_unsigned_char_Array_0~0.base|) (+ |~#BOOL_unsigned_char_Array_0~0.offset| 1)) 256) 0) (not (= |~#signed_long_int_Array_0~0.base| |~#signed_char_Array_0~0.base|)) (<= 8 |~#unsigned_char_Array_0~0.base|)) [2023-11-12 02:25:44,546 INFO L899 garLoopResultBuilder]: For program point L93-1(line 93) no Hoare annotation was computed. [2023-11-12 02:25:44,546 INFO L899 garLoopResultBuilder]: For program point L60(lines 60 62) no Hoare annotation was computed. [2023-11-12 02:25:44,546 INFO L895 garLoopResultBuilder]: At program point L77(line 77) the Hoare annotation is: (let ((.cse9 (select |#memory_int| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse8 (select .cse9 (+ |~#BOOL_unsigned_char_Array_0~0.offset| 1)))) (let ((.cse0 (<= 6 |~#signed_char_Array_0~0.base|)) (.cse2 (<= 7 |~#signed_long_int_Array_0~0.base|)) (.cse3 (<= 5 |~#double_Array_0~0.base|)) (.cse4 (<= |~#BOOL_unsigned_char_Array_0~0.base| 4)) (.cse5 (<= (mod .cse8 256) 0)) (.cse6 (not (= |~#signed_long_int_Array_0~0.base| |~#signed_char_Array_0~0.base|))) (.cse1 (select .cse9 (+ |~#BOOL_unsigned_char_Array_0~0.offset| 3))) (.cse7 (<= 8 |~#unsigned_char_Array_0~0.base|))) (or (and .cse0 (<= .cse1 (+ (* (div (+ (- 1) .cse1) 256) 256) 255)) .cse2 .cse3 .cse4 .cse5 .cse6 (not (= (select (select |#memory_int| |~#signed_long_int_Array_0~0.base|) |~#signed_long_int_Array_0~0.offset|) (select (select |#memory_int| |~#signed_char_Array_0~0.base|) (+ |~#signed_char_Array_0~0.offset| 1)))) .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 (= .cse1 .cse8) .cse7))))) [2023-11-12 02:25:44,546 INFO L899 garLoopResultBuilder]: For program point L77-1(line 77) no Hoare annotation was computed. [2023-11-12 02:25:44,547 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 106 117) no Hoare annotation was computed. [2023-11-12 02:25:44,547 INFO L895 garLoopResultBuilder]: At program point L94(line 94) the Hoare annotation is: (and (<= 6 |~#signed_char_Array_0~0.base|) (<= 7 |~#signed_long_int_Array_0~0.base|) (<= 5 |~#double_Array_0~0.base|) (<= |~#BOOL_unsigned_char_Array_0~0.base| 4) (<= (mod (select (select |#memory_int| |~#BOOL_unsigned_char_Array_0~0.base|) (+ |~#BOOL_unsigned_char_Array_0~0.offset| 1)) 256) 0) (not (= |~#signed_long_int_Array_0~0.base| |~#signed_char_Array_0~0.base|)) (<= 8 |~#unsigned_char_Array_0~0.base|)) [2023-11-12 02:25:44,547 INFO L899 garLoopResultBuilder]: For program point L94-1(line 94) no Hoare annotation was computed. [2023-11-12 02:25:44,547 INFO L899 garLoopResultBuilder]: For program point L61(line 61) no Hoare annotation was computed. [2023-11-12 02:25:44,547 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-12 02:25:44,547 INFO L899 garLoopResultBuilder]: For program point L61-2(line 61) no Hoare annotation was computed. [2023-11-12 02:25:44,548 INFO L895 garLoopResultBuilder]: At program point L79(line 79) the Hoare annotation is: (let ((.cse0 (<= 6 |~#signed_char_Array_0~0.base|)) (.cse2 (<= 7 |~#signed_long_int_Array_0~0.base|)) (.cse3 (<= 5 |~#double_Array_0~0.base|)) (.cse4 (<= |~#BOOL_unsigned_char_Array_0~0.base| 4)) (.cse5 (not (= |~#signed_long_int_Array_0~0.base| |~#signed_char_Array_0~0.base|))) (.cse6 (<= 8 |~#unsigned_char_Array_0~0.base|))) (or (and .cse0 (let ((.cse1 (select (select |#memory_int| |~#BOOL_unsigned_char_Array_0~0.base|) (+ |~#BOOL_unsigned_char_Array_0~0.offset| 3)))) (<= .cse1 (* 256 (div .cse1 256)))) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse4 .cse5 (not (= (select (select |#memory_int| |~#signed_long_int_Array_0~0.base|) |~#signed_long_int_Array_0~0.offset|) (select (select |#memory_int| |~#signed_char_Array_0~0.base|) (+ |~#signed_char_Array_0~0.offset| 1)))) .cse6))) [2023-11-12 02:25:44,548 INFO L899 garLoopResultBuilder]: For program point L79-1(line 79) no Hoare annotation was computed. [2023-11-12 02:25:44,548 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-12 02:25:44,548 INFO L895 garLoopResultBuilder]: At program point L96(line 96) the Hoare annotation is: (and (<= 6 |~#signed_char_Array_0~0.base|) (<= 7 |~#signed_long_int_Array_0~0.base|) (<= 5 |~#double_Array_0~0.base|) (<= |~#BOOL_unsigned_char_Array_0~0.base| 4) (<= (mod (select (select |#memory_int| |~#BOOL_unsigned_char_Array_0~0.base|) (+ |~#BOOL_unsigned_char_Array_0~0.offset| 1)) 256) 0) (not (= |~#signed_long_int_Array_0~0.base| |~#signed_char_Array_0~0.base|)) (<= 8 |~#unsigned_char_Array_0~0.base|)) [2023-11-12 02:25:44,548 INFO L899 garLoopResultBuilder]: For program point L96-1(line 96) no Hoare annotation was computed. [2023-11-12 02:25:44,549 INFO L895 garLoopResultBuilder]: At program point L80(line 80) the Hoare annotation is: (let ((.cse2 (select |#memory_int| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse0 (<= 6 |~#signed_char_Array_0~0.base|)) (.cse3 (<= 7 |~#signed_long_int_Array_0~0.base|)) (.cse4 (<= 5 |~#double_Array_0~0.base|)) (.cse5 (<= |~#BOOL_unsigned_char_Array_0~0.base| 4)) (.cse6 (not (= |~#signed_long_int_Array_0~0.base| |~#signed_char_Array_0~0.base|))) (.cse7 (= |ULTIMATE.start_updateVariables_#t~mem37#1| (select .cse2 (+ |~#BOOL_unsigned_char_Array_0~0.offset| 1)))) (.cse8 (<= 8 |~#unsigned_char_Array_0~0.base|))) (or (and .cse0 (let ((.cse1 (select .cse2 (+ |~#BOOL_unsigned_char_Array_0~0.offset| 3)))) (<= .cse1 (* 256 (div .cse1 256)))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse3 .cse4 .cse5 .cse6 (not (= (select (select |#memory_int| |~#signed_long_int_Array_0~0.base|) |~#signed_long_int_Array_0~0.offset|) (select (select |#memory_int| |~#signed_char_Array_0~0.base|) (+ |~#signed_char_Array_0~0.offset| 1)))) .cse7 .cse8)))) [2023-11-12 02:25:44,549 INFO L899 garLoopResultBuilder]: For program point L80-1(line 80) no Hoare annotation was computed. [2023-11-12 02:25:44,549 INFO L899 garLoopResultBuilder]: For program point L47(lines 47 57) no Hoare annotation was computed. [2023-11-12 02:25:44,549 INFO L895 garLoopResultBuilder]: At program point L97(line 97) the Hoare annotation is: (and (<= 6 |~#signed_char_Array_0~0.base|) (<= 7 |~#signed_long_int_Array_0~0.base|) (<= 5 |~#double_Array_0~0.base|) (<= |~#BOOL_unsigned_char_Array_0~0.base| 4) (<= (mod (select (select |#memory_int| |~#BOOL_unsigned_char_Array_0~0.base|) (+ |~#BOOL_unsigned_char_Array_0~0.offset| 1)) 256) 0) (not (= |~#signed_long_int_Array_0~0.base| |~#signed_char_Array_0~0.base|)) (<= 8 |~#unsigned_char_Array_0~0.base|)) [2023-11-12 02:25:44,549 INFO L899 garLoopResultBuilder]: For program point L97-1(line 97) no Hoare annotation was computed. [2023-11-12 02:25:44,550 INFO L899 garLoopResultBuilder]: For program point L64(lines 64 72) no Hoare annotation was computed. [2023-11-12 02:25:44,550 INFO L899 garLoopResultBuilder]: For program point L48(line 48) no Hoare annotation was computed. [2023-11-12 02:25:44,550 INFO L899 garLoopResultBuilder]: For program point L48-2(line 48) no Hoare annotation was computed. [2023-11-12 02:25:44,550 INFO L899 garLoopResultBuilder]: For program point L65(line 65) no Hoare annotation was computed. [2023-11-12 02:25:44,550 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-12 02:25:44,550 INFO L899 garLoopResultBuilder]: For program point L65-2(lines 65 69) no Hoare annotation was computed. [2023-11-12 02:25:44,551 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-12 02:25:44,551 INFO L899 garLoopResultBuilder]: For program point L82(line 82) no Hoare annotation was computed. [2023-11-12 02:25:44,551 INFO L899 garLoopResultBuilder]: For program point L82-2(line 82) no Hoare annotation was computed. [2023-11-12 02:25:44,551 INFO L899 garLoopResultBuilder]: For program point L82-3(line 82) no Hoare annotation was computed. [2023-11-12 02:25:44,551 INFO L899 garLoopResultBuilder]: For program point L82-5(line 82) no Hoare annotation was computed. [2023-11-12 02:25:44,551 INFO L899 garLoopResultBuilder]: For program point L82-7(line 82) no Hoare annotation was computed. [2023-11-12 02:25:44,552 INFO L895 garLoopResultBuilder]: At program point L82-8(line 82) the Hoare annotation is: (and (<= 6 |~#signed_char_Array_0~0.base|) (<= 7 |~#signed_long_int_Array_0~0.base|) (<= 5 |~#double_Array_0~0.base|) (<= |~#BOOL_unsigned_char_Array_0~0.base| 4) (<= (mod (select (select |#memory_int| |~#BOOL_unsigned_char_Array_0~0.base|) (+ |~#BOOL_unsigned_char_Array_0~0.offset| 1)) 256) 0) (not (= |~#signed_long_int_Array_0~0.base| |~#signed_char_Array_0~0.base|)) (<= 8 |~#unsigned_char_Array_0~0.base|)) [2023-11-12 02:25:44,552 INFO L899 garLoopResultBuilder]: For program point L82-9(line 82) no Hoare annotation was computed. [2023-11-12 02:25:44,552 INFO L899 garLoopResultBuilder]: For program point L99(lines 99 101) no Hoare annotation was computed. [2023-11-12 02:25:44,552 INFO L899 garLoopResultBuilder]: For program point L66(line 66) no Hoare annotation was computed. [2023-11-12 02:25:44,552 INFO L899 garLoopResultBuilder]: For program point L66-2(line 66) no Hoare annotation was computed. [2023-11-12 02:25:44,552 INFO L899 garLoopResultBuilder]: For program point L50(lines 50 56) no Hoare annotation was computed. [2023-11-12 02:25:44,553 INFO L895 garLoopResultBuilder]: At program point L84(line 84) the Hoare annotation is: (and (<= 6 |~#signed_char_Array_0~0.base|) (<= 7 |~#signed_long_int_Array_0~0.base|) (<= 5 |~#double_Array_0~0.base|) (<= |~#BOOL_unsigned_char_Array_0~0.base| 4) (<= (mod (select (select |#memory_int| |~#BOOL_unsigned_char_Array_0~0.base|) (+ |~#BOOL_unsigned_char_Array_0~0.offset| 1)) 256) 0) (not (= |~#signed_long_int_Array_0~0.base| |~#signed_char_Array_0~0.base|)) (<= 8 |~#unsigned_char_Array_0~0.base|)) [2023-11-12 02:25:44,553 INFO L899 garLoopResultBuilder]: For program point L84-1(line 84) no Hoare annotation was computed. [2023-11-12 02:25:44,553 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-11-12 02:25:44,553 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-12 02:25:44,553 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-11-12 02:25:44,553 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-11-12 02:25:44,557 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-12 02:25:44,559 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-11-12 02:25:44,574 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 1] could not be translated [2023-11-12 02:25:44,575 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 3] could not be translated [2023-11-12 02:25:44,575 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 1] could not be translated [2023-11-12 02:25:44,575 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 3] could not be translated [2023-11-12 02:25:44,576 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 3] could not be translated [2023-11-12 02:25:44,576 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 1] could not be translated [2023-11-12 02:25:44,576 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 2] could not be translated [2023-11-12 02:25:44,576 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset] could not be translated [2023-11-12 02:25:44,577 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#signed_long_int_Array_0~0!base][~#signed_long_int_Array_0~0!offset] could not be translated [2023-11-12 02:25:44,577 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#signed_char_Array_0~0!base][~#signed_char_Array_0~0!offset + 1] could not be translated [2023-11-12 02:25:44,578 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 1] could not be translated [2023-11-12 02:25:44,579 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 3] could not be translated [2023-11-12 02:25:44,579 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 1] could not be translated [2023-11-12 02:25:44,579 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 3] could not be translated [2023-11-12 02:25:44,579 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 3] could not be translated [2023-11-12 02:25:44,580 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 1] could not be translated [2023-11-12 02:25:44,580 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 2] could not be translated [2023-11-12 02:25:44,580 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset] could not be translated [2023-11-12 02:25:44,580 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#signed_long_int_Array_0~0!base][~#signed_long_int_Array_0~0!offset] could not be translated [2023-11-12 02:25:44,581 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#signed_char_Array_0~0!base][~#signed_char_Array_0~0!offset + 1] could not be translated [2023-11-12 02:25:44,581 ERROR L464 ceAbstractionStarter]: Failed to backtranslate (let ((.cse9 (select |#memory_int| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse7 (select .cse9 (+ |~#BOOL_unsigned_char_Array_0~0.offset| 1)))) (let ((.cse0 (<= 6 |~#signed_char_Array_0~0.base|)) (.cse6 (select .cse9 (+ |~#BOOL_unsigned_char_Array_0~0.offset| 3))) (.cse1 (<= 7 |~#signed_long_int_Array_0~0.base|)) (.cse2 (<= 5 |~#double_Array_0~0.base|)) (.cse3 (<= |~#BOOL_unsigned_char_Array_0~0.base| 4)) (.cse4 (<= (mod .cse7 256) 0)) (.cse5 (not (= |~#signed_long_int_Array_0~0.base| |~#signed_char_Array_0~0.base|))) (.cse8 (<= 8 |~#unsigned_char_Array_0~0.base|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= .cse6 .cse7) .cse8) (and .cse0 (<= .cse6 (+ (* (div (+ (- 1) .cse6) 256) 256) 255)) .cse1 .cse2 .cse3 .cse4 .cse5 (= (select .cse9 (+ |~#BOOL_unsigned_char_Array_0~0.offset| 2)) (select .cse9 |~#BOOL_unsigned_char_Array_0~0.offset|)) (not (= (select (select |#memory_int| |~#signed_long_int_Array_0~0.base|) |~#signed_long_int_Array_0~0.offset|) (select (select |#memory_int| |~#signed_char_Array_0~0.base|) (+ |~#signed_char_Array_0~0.offset| 1)))) .cse8))))) [2023-11-12 02:25:44,581 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 02:25:44 BoogieIcfgContainer [2023-11-12 02:25:44,582 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-12 02:25:44,582 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-12 02:25:44,582 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-12 02:25:44,582 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-12 02:25:44,583 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:25:15" (3/4) ... [2023-11-12 02:25:44,585 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-12 02:25:44,590 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-12 02:25:44,599 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2023-11-12 02:25:44,600 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-12 02:25:44,601 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-12 02:25:44,602 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-12 02:25:44,752 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30d9e630-4905-4777-a6ae-e81945b26296/bin/uautomizer-verify-uTZkv6EMXl/witness.graphml [2023-11-12 02:25:44,754 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30d9e630-4905-4777-a6ae-e81945b26296/bin/uautomizer-verify-uTZkv6EMXl/witness.yml [2023-11-12 02:25:44,754 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-12 02:25:44,755 INFO L158 Benchmark]: Toolchain (without parser) took 30817.40ms. Allocated memory was 144.7MB in the beginning and 453.0MB in the end (delta: 308.3MB). Free memory was 100.5MB in the beginning and 182.8MB in the end (delta: -82.4MB). Peak memory consumption was 228.8MB. Max. memory is 16.1GB. [2023-11-12 02:25:44,755 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 98.6MB. Free memory is still 50.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:25:44,756 INFO L158 Benchmark]: CACSL2BoogieTranslator took 487.76ms. Allocated memory is still 144.7MB. Free memory was 100.2MB in the beginning and 85.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-12 02:25:44,760 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.69ms. Allocated memory is still 144.7MB. Free memory was 85.5MB in the beginning and 81.9MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-12 02:25:44,761 INFO L158 Benchmark]: Boogie Preprocessor took 70.93ms. Allocated memory is still 144.7MB. Free memory was 81.9MB in the beginning and 79.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 02:25:44,761 INFO L158 Benchmark]: RCFGBuilder took 870.25ms. Allocated memory is still 144.7MB. Free memory was 78.8MB in the beginning and 106.4MB in the end (delta: -27.5MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. [2023-11-12 02:25:44,762 INFO L158 Benchmark]: TraceAbstraction took 29128.09ms. Allocated memory was 144.7MB in the beginning and 453.0MB in the end (delta: 308.3MB). Free memory was 105.6MB in the beginning and 192.3MB in the end (delta: -86.6MB). Peak memory consumption was 263.0MB. Max. memory is 16.1GB. [2023-11-12 02:25:44,762 INFO L158 Benchmark]: Witness Printer took 172.29ms. Allocated memory is still 453.0MB. Free memory was 191.2MB in the beginning and 182.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-12 02:25:44,773 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.37ms. Allocated memory is still 98.6MB. Free memory is still 50.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 487.76ms. Allocated memory is still 144.7MB. Free memory was 100.2MB in the beginning and 85.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.69ms. Allocated memory is still 144.7MB. Free memory was 85.5MB in the beginning and 81.9MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.93ms. Allocated memory is still 144.7MB. Free memory was 81.9MB in the beginning and 79.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 870.25ms. Allocated memory is still 144.7MB. Free memory was 78.8MB in the beginning and 106.4MB in the end (delta: -27.5MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. * TraceAbstraction took 29128.09ms. Allocated memory was 144.7MB in the beginning and 453.0MB in the end (delta: 308.3MB). Free memory was 105.6MB in the beginning and 192.3MB in the end (delta: -86.6MB). Peak memory consumption was 263.0MB. Max. memory is 16.1GB. * Witness Printer took 172.29ms. Allocated memory is still 453.0MB. Free memory was 191.2MB in the beginning and 182.8MB in the end (delta: 8.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: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 3] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 3] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 3] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#signed_long_int_Array_0~0!base][~#signed_long_int_Array_0~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#signed_char_Array_0~0!base][~#signed_char_Array_0~0!offset + 1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 3] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 3] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 3] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#signed_long_int_Array_0~0!base][~#signed_long_int_Array_0~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#signed_char_Array_0~0!base][~#signed_char_Array_0~0!offset + 1] 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: 29.0s, OverallIterations: 22, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 9.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2741 SdHoareTripleChecker+Valid, 6.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2718 mSDsluCounter, 9118 SdHoareTripleChecker+Invalid, 5.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6422 mSDsCounter, 202 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5268 IncrementalHoareTripleChecker+Invalid, 5470 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 202 mSolverCounterUnsat, 2696 mSDtfsCounter, 5268 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1070 GetRequests, 897 SyntacticMatches, 3 SemanticMatches, 170 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=279occurred in iteration=18, InterpolantAutomatonStates: 156, 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, 545 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 448 PreInvPairs, 480 NumberOfFragments, 866 HoareAnnotationTreeSize, 448 FomulaSimplifications, 36097 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 17 FomulaSimplificationsInter, 10594 FormulaSimplificationTreeSizeReductionInter, 1.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 14.2s InterpolantComputationTime, 2919 NumberOfCodeBlocks, 2919 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 2896 ConstructedInterpolants, 0 QuantifiedInterpolants, 13426 SizeOfPredicates, 12 NumberOfNonLiveVariables, 450 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 23 InterpolantComputations, 21 PerfectInterpolantSequences, 9414/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: 109]: Loop Invariant [2023-11-12 02:25:44,782 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 1] could not be translated [2023-11-12 02:25:44,782 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 3] could not be translated [2023-11-12 02:25:44,782 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 1] could not be translated [2023-11-12 02:25:44,783 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 3] could not be translated [2023-11-12 02:25:44,783 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 3] could not be translated [2023-11-12 02:25:44,783 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 1] could not be translated [2023-11-12 02:25:44,783 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 2] could not be translated [2023-11-12 02:25:44,783 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset] could not be translated [2023-11-12 02:25:44,784 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#signed_long_int_Array_0~0!base][~#signed_long_int_Array_0~0!offset] could not be translated [2023-11-12 02:25:44,784 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#signed_char_Array_0~0!base][~#signed_char_Array_0~0!offset + 1] could not be translated [2023-11-12 02:25:44,785 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 1] could not be translated [2023-11-12 02:25:44,785 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 3] could not be translated [2023-11-12 02:25:44,785 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 1] could not be translated [2023-11-12 02:25:44,786 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 3] could not be translated [2023-11-12 02:25:44,786 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 3] could not be translated [2023-11-12 02:25:44,786 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 1] could not be translated [2023-11-12 02:25:44,786 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 2] could not be translated [2023-11-12 02:25:44,786 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset] could not be translated [2023-11-12 02:25:44,787 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#signed_long_int_Array_0~0!base][~#signed_long_int_Array_0~0!offset] could not be translated [2023-11-12 02:25:44,787 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#signed_char_Array_0~0!base][~#signed_char_Array_0~0!offset + 1] could not be translated Derived loop invariant: NULL RESULT: Ultimate proved your program to be correct! [2023-11-12 02:25:44,804 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30d9e630-4905-4777-a6ae-e81945b26296/bin/uautomizer-verify-uTZkv6EMXl/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