./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-24.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b26e8d43-442a-485a-b3d9-f0c4c82e15e7/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b26e8d43-442a-485a-b3d9-f0c4c82e15e7/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b26e8d43-442a-485a-b3d9-f0c4c82e15e7/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b26e8d43-442a-485a-b3d9-f0c4c82e15e7/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-24.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b26e8d43-442a-485a-b3d9-f0c4c82e15e7/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b26e8d43-442a-485a-b3d9-f0c4c82e15e7/bin/uautomizer-verify-uCwYo4JHxu --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1dbf57bc124875744eb5a4186252476f73fa3f14ae019c9a9da37b4d1a62cbf1 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:56:36,612 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:56:36,719 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b26e8d43-442a-485a-b3d9-f0c4c82e15e7/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-19 07:56:36,723 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:56:36,724 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:56:36,768 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:56:36,768 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:56:36,769 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:56:36,771 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:56:36,776 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:56:36,777 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:56:36,777 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:56:36,778 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:56:36,779 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:56:36,780 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:56:36,780 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:56:36,781 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:56:36,781 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:56:36,782 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:56:36,782 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:56:36,782 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:56:36,783 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:56:36,783 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:56:36,784 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:56:36,784 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:56:36,785 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:56:36,785 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:56:36,786 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:56:36,786 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:56:36,787 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:56:36,788 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:56:36,797 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:56:36,797 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:56:36,798 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:56:36,798 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:56:36,798 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:56:36,799 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:56:36,799 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:56:36,799 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:56:36,800 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_b26e8d43-442a-485a-b3d9-f0c4c82e15e7/bin/uautomizer-verify-uCwYo4JHxu/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b26e8d43-442a-485a-b3d9-f0c4c82e15e7/bin/uautomizer-verify-uCwYo4JHxu Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1dbf57bc124875744eb5a4186252476f73fa3f14ae019c9a9da37b4d1a62cbf1 [2023-11-19 07:56:37,069 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:56:37,102 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:56:37,105 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:56:37,106 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:56:37,107 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:56:37,108 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b26e8d43-442a-485a-b3d9-f0c4c82e15e7/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-24.i [2023-11-19 07:56:40,141 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:56:40,378 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:56:40,379 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b26e8d43-442a-485a-b3d9-f0c4c82e15e7/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-24.i [2023-11-19 07:56:40,390 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b26e8d43-442a-485a-b3d9-f0c4c82e15e7/bin/uautomizer-verify-uCwYo4JHxu/data/727a05d5c/69633856254f47d8bbf62f0e114a04fa/FLAG7864c8ae0 [2023-11-19 07:56:40,408 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b26e8d43-442a-485a-b3d9-f0c4c82e15e7/bin/uautomizer-verify-uCwYo4JHxu/data/727a05d5c/69633856254f47d8bbf62f0e114a04fa [2023-11-19 07:56:40,415 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:56:40,418 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:56:40,423 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:56:40,423 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:56:40,433 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:56:40,434 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:56:40" (1/1) ... [2023-11-19 07:56:40,435 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c0bb814 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:40, skipping insertion in model container [2023-11-19 07:56:40,435 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:56:40" (1/1) ... [2023-11-19 07:56:40,465 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:56:40,609 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_b26e8d43-442a-485a-b3d9-f0c4c82e15e7/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-24.i[916,929] [2023-11-19 07:56:40,670 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:56:40,684 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:56:40,696 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_b26e8d43-442a-485a-b3d9-f0c4c82e15e7/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-24.i[916,929] [2023-11-19 07:56:40,740 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:56:40,772 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:56:40,773 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:40 WrapperNode [2023-11-19 07:56:40,774 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:56:40,775 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:56:40,776 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:56:40,777 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:56:40,793 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:40" (1/1) ... [2023-11-19 07:56:40,817 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:40" (1/1) ... [2023-11-19 07:56:40,903 INFO L138 Inliner]: procedures = 29, calls = 157, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 406 [2023-11-19 07:56:40,903 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:56:40,904 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:56:40,904 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:56:40,904 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:56:40,913 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:40" (1/1) ... [2023-11-19 07:56:40,913 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:40" (1/1) ... [2023-11-19 07:56:40,920 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:40" (1/1) ... [2023-11-19 07:56:40,920 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:40" (1/1) ... [2023-11-19 07:56:40,943 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:40" (1/1) ... [2023-11-19 07:56:40,948 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:40" (1/1) ... [2023-11-19 07:56:40,952 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:40" (1/1) ... [2023-11-19 07:56:40,955 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:40" (1/1) ... [2023-11-19 07:56:40,961 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:56:40,962 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:56:40,962 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:56:40,962 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:56:40,976 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:40" (1/1) ... [2023-11-19 07:56:40,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:56:40,998 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b26e8d43-442a-485a-b3d9-f0c4c82e15e7/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:56:41,011 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b26e8d43-442a-485a-b3d9-f0c4c82e15e7/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:56:41,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:56:41,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2023-11-19 07:56:41,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 07:56:41,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2023-11-19 07:56:41,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 07:56:41,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2023-11-19 07:56:41,058 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-19 07:56:41,058 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-19 07:56:41,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:56:41,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:56:41,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:56:41,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b26e8d43-442a-485a-b3d9-f0c4c82e15e7/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:56:41,260 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:56:41,264 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:56:41,771 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:56:41,791 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:56:41,791 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-19 07:56:41,798 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:56:41 BoogieIcfgContainer [2023-11-19 07:56:41,798 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:56:41,803 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:56:41,803 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:56:41,807 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:56:41,807 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:56:40" (1/3) ... [2023-11-19 07:56:41,808 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ac89cdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:56:41, skipping insertion in model container [2023-11-19 07:56:41,809 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:40" (2/3) ... [2023-11-19 07:56:41,810 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ac89cdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:56:41, skipping insertion in model container [2023-11-19 07:56:41,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:56:41" (3/3) ... [2023-11-19 07:56:41,813 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-24.i [2023-11-19 07:56:41,835 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:56:41,835 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 07:56:41,902 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:56:41,908 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;@7b1336a4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:56:41,909 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-19 07:56:41,913 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 83 states have (on average 1.3975903614457832) internal successors, (116), 84 states have internal predecessors, (116), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-19 07:56:41,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-19 07:56:41,929 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:56:41,930 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:56:41,930 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:56:41,935 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:56:41,936 INFO L85 PathProgramCache]: Analyzing trace with hash 517644707, now seen corresponding path program 1 times [2023-11-19 07:56:41,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:56:41,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655920393] [2023-11-19 07:56:41,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:56:41,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:56:42,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:42,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:56:42,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:42,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:56:42,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:42,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:56:42,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:42,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:56:42,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:42,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:56:42,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:42,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:56:42,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:42,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:56:42,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:42,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:56:42,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:42,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:56:42,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:42,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:56:42,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:42,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:56:42,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:42,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:56:42,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:42,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:56:42,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:42,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:56:42,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:42,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:56:42,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:42,447 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-19 07:56:42,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:56:42,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655920393] [2023-11-19 07:56:42,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655920393] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:56:42,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:56:42,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:56:42,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972455334] [2023-11-19 07:56:42,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:56:42,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 07:56:42,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:56:42,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 07:56:42,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 07:56:42,510 INFO L87 Difference]: Start difference. First operand has 101 states, 83 states have (on average 1.3975903614457832) internal successors, (116), 84 states have internal predecessors, (116), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-19 07:56:42,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:56:42,546 INFO L93 Difference]: Finished difference Result 195 states and 301 transitions. [2023-11-19 07:56:42,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 07:56:42,548 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 124 [2023-11-19 07:56:42,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:56:42,557 INFO L225 Difference]: With dead ends: 195 [2023-11-19 07:56:42,557 INFO L226 Difference]: Without dead ends: 97 [2023-11-19 07:56:42,561 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 07:56:42,565 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:56:42,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:56:42,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-11-19 07:56:42,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2023-11-19 07:56:42,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 80 states have (on average 1.3625) internal successors, (109), 80 states have internal predecessors, (109), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-19 07:56:42,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 139 transitions. [2023-11-19 07:56:42,616 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 139 transitions. Word has length 124 [2023-11-19 07:56:42,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:56:42,616 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 139 transitions. [2023-11-19 07:56:42,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-19 07:56:42,617 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 139 transitions. [2023-11-19 07:56:42,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-19 07:56:42,620 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:56:42,621 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:56:42,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:56:42,621 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:56:42,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:56:42,622 INFO L85 PathProgramCache]: Analyzing trace with hash -94639779, now seen corresponding path program 1 times [2023-11-19 07:56:42,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:56:42,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080407023] [2023-11-19 07:56:42,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:56:42,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:56:42,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:42,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:56:42,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:42,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:56:42,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:42,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:56:42,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:42,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:56:42,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:42,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:56:42,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:42,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:56:42,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:42,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:56:42,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:42,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:56:42,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:42,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:56:43,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:43,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:56:43,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:43,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:56:43,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:43,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:56:43,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:43,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:56:43,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:43,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:56:43,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:43,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:56:43,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:43,028 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-19 07:56:43,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:56:43,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080407023] [2023-11-19 07:56:43,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080407023] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:56:43,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:56:43,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:56:43,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122951782] [2023-11-19 07:56:43,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:56:43,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:56:43,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:56:43,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:56:43,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:56:43,034 INFO L87 Difference]: Start difference. First operand 97 states and 139 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-19 07:56:43,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:56:43,101 INFO L93 Difference]: Finished difference Result 197 states and 284 transitions. [2023-11-19 07:56:43,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:56:43,106 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 124 [2023-11-19 07:56:43,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:56:43,108 INFO L225 Difference]: With dead ends: 197 [2023-11-19 07:56:43,109 INFO L226 Difference]: Without dead ends: 103 [2023-11-19 07:56:43,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:56:43,113 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 10 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:56:43,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 405 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:56:43,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-11-19 07:56:43,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2023-11-19 07:56:43,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 82 states have (on average 1.353658536585366) internal successors, (111), 82 states have internal predecessors, (111), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-19 07:56:43,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 141 transitions. [2023-11-19 07:56:43,142 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 141 transitions. Word has length 124 [2023-11-19 07:56:43,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:56:43,144 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 141 transitions. [2023-11-19 07:56:43,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-19 07:56:43,145 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 141 transitions. [2023-11-19 07:56:43,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-19 07:56:43,153 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:56:43,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] [2023-11-19 07:56:43,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:56:43,155 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:56:43,155 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:56:43,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1419495973, now seen corresponding path program 1 times [2023-11-19 07:56:43,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:56:43,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836523079] [2023-11-19 07:56:43,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:56:43,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:56:43,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:43,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:56:43,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:43,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:56:43,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:43,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:56:43,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:43,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:56:43,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:43,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:56:43,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:43,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:56:43,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:43,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:56:43,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:43,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:56:43,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:43,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:56:43,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:43,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:56:43,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:43,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:56:43,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:43,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:56:43,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:43,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:56:43,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:43,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:56:43,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:43,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:56:43,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:43,485 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-19 07:56:43,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:56:43,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836523079] [2023-11-19 07:56:43,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836523079] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:56:43,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:56:43,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:56:43,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693843283] [2023-11-19 07:56:43,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:56:43,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:56:43,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:56:43,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:56:43,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:56:43,496 INFO L87 Difference]: Start difference. First operand 99 states and 141 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:56:43,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:56:43,546 INFO L93 Difference]: Finished difference Result 196 states and 281 transitions. [2023-11-19 07:56:43,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:56:43,547 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2023-11-19 07:56:43,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:56:43,553 INFO L225 Difference]: With dead ends: 196 [2023-11-19 07:56:43,553 INFO L226 Difference]: Without dead ends: 100 [2023-11-19 07:56:43,554 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:56:43,559 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:56:43,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 270 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:56:43,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-11-19 07:56:43,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2023-11-19 07:56:43,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 83 states have (on average 1.3493975903614457) internal successors, (112), 83 states have internal predecessors, (112), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-19 07:56:43,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 142 transitions. [2023-11-19 07:56:43,580 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 142 transitions. Word has length 124 [2023-11-19 07:56:43,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:56:43,582 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 142 transitions. [2023-11-19 07:56:43,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:56:43,582 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 142 transitions. [2023-11-19 07:56:43,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-19 07:56:43,585 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:56:43,586 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:56:43,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:56:43,586 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:56:43,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:56:43,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1070032989, now seen corresponding path program 1 times [2023-11-19 07:56:43,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:56:43,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927493952] [2023-11-19 07:56:43,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:56:43,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:56:43,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:43,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:56:43,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:43,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:56:43,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:43,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:56:43,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:43,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:56:43,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:43,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:56:43,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:43,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:56:43,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:43,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:56:43,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:43,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:56:43,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:43,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:56:43,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:43,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:56:43,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:43,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:56:43,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:43,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:56:43,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:43,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:56:43,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:43,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:56:43,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:43,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:56:43,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:43,749 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-19 07:56:43,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:56:43,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927493952] [2023-11-19 07:56:43,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927493952] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:56:43,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:56:43,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:56:43,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248029423] [2023-11-19 07:56:43,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:56:43,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:56:43,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:56:43,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:56:43,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:56:43,752 INFO L87 Difference]: Start difference. First operand 100 states and 142 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:56:43,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:56:43,774 INFO L93 Difference]: Finished difference Result 217 states and 311 transitions. [2023-11-19 07:56:43,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:56:43,775 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2023-11-19 07:56:43,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:56:43,777 INFO L225 Difference]: With dead ends: 217 [2023-11-19 07:56:43,777 INFO L226 Difference]: Without dead ends: 120 [2023-11-19 07:56:43,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:56:43,779 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 40 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:56:43,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 286 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:56:43,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-11-19 07:56:43,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 101. [2023-11-19 07:56:43,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 84 states have (on average 1.3452380952380953) internal successors, (113), 84 states have internal predecessors, (113), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-19 07:56:43,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 143 transitions. [2023-11-19 07:56:43,791 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 143 transitions. Word has length 124 [2023-11-19 07:56:43,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:56:43,792 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 143 transitions. [2023-11-19 07:56:43,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:56:43,793 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 143 transitions. [2023-11-19 07:56:43,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-19 07:56:43,794 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:56:43,795 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:56:43,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:56:43,795 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:56:43,795 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:56:43,796 INFO L85 PathProgramCache]: Analyzing trace with hash 48964635, now seen corresponding path program 1 times [2023-11-19 07:56:43,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:56:43,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678442360] [2023-11-19 07:56:43,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:56:43,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:56:43,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:44,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:56:44,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:44,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:56:44,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:44,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:56:44,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:44,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:56:44,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:44,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:56:44,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:44,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:56:44,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:44,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:56:44,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:44,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:56:44,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:44,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:56:44,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:44,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:56:44,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:44,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:56:44,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:44,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:56:44,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:44,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:56:44,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:44,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:56:44,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:44,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:56:44,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:44,075 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-19 07:56:44,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:56:44,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678442360] [2023-11-19 07:56:44,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678442360] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:56:44,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:56:44,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:56:44,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691171985] [2023-11-19 07:56:44,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:56:44,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:56:44,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:56:44,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:56:44,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:56:44,078 INFO L87 Difference]: Start difference. First operand 101 states and 143 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:56:44,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:56:44,130 INFO L93 Difference]: Finished difference Result 211 states and 300 transitions. [2023-11-19 07:56:44,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:56:44,131 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2023-11-19 07:56:44,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:56:44,136 INFO L225 Difference]: With dead ends: 211 [2023-11-19 07:56:44,136 INFO L226 Difference]: Without dead ends: 113 [2023-11-19 07:56:44,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:56:44,144 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 21 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:56:44,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 404 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:56:44,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-11-19 07:56:44,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 103. [2023-11-19 07:56:44,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 86 states have (on average 1.3372093023255813) internal successors, (115), 86 states have internal predecessors, (115), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-19 07:56:44,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 145 transitions. [2023-11-19 07:56:44,170 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 145 transitions. Word has length 124 [2023-11-19 07:56:44,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:56:44,172 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 145 transitions. [2023-11-19 07:56:44,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:56:44,173 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 145 transitions. [2023-11-19 07:56:44,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-19 07:56:44,175 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:56:44,175 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:56:44,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 07:56:44,176 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:56:44,176 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:56:44,176 INFO L85 PathProgramCache]: Analyzing trace with hash 729023005, now seen corresponding path program 1 times [2023-11-19 07:56:44,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:56:44,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294919176] [2023-11-19 07:56:44,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:56:44,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:56:44,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:44,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:56:44,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:44,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:56:44,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:44,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:56:44,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:44,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:56:44,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:44,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:56:44,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:44,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:56:44,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:44,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:56:44,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:44,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:56:44,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:44,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:56:44,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:44,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:56:44,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:44,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:56:44,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:44,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:56:44,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:44,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:56:44,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:44,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:56:44,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:44,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:56:44,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:44,417 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-19 07:56:44,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:56:44,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294919176] [2023-11-19 07:56:44,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294919176] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:56:44,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:56:44,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:56:44,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711349117] [2023-11-19 07:56:44,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:56:44,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:56:44,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:56:44,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:56:44,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:56:44,424 INFO L87 Difference]: Start difference. First operand 103 states and 145 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:56:44,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:56:44,469 INFO L93 Difference]: Finished difference Result 211 states and 298 transitions. [2023-11-19 07:56:44,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:56:44,469 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2023-11-19 07:56:44,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:56:44,474 INFO L225 Difference]: With dead ends: 211 [2023-11-19 07:56:44,474 INFO L226 Difference]: Without dead ends: 111 [2023-11-19 07:56:44,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:56:44,482 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 12 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:56:44,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 402 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:56:44,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-11-19 07:56:44,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 105. [2023-11-19 07:56:44,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 88 states have (on average 1.3295454545454546) internal successors, (117), 88 states have internal predecessors, (117), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-19 07:56:44,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 147 transitions. [2023-11-19 07:56:44,507 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 147 transitions. Word has length 124 [2023-11-19 07:56:44,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:56:44,508 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 147 transitions. [2023-11-19 07:56:44,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:56:44,509 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 147 transitions. [2023-11-19 07:56:44,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-19 07:56:44,512 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:56:44,513 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:56:44,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 07:56:44,513 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:56:44,514 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:56:44,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1790936929, now seen corresponding path program 1 times [2023-11-19 07:56:44,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:56:44,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506201373] [2023-11-19 07:56:44,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:56:44,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:56:44,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:44,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:56:44,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:44,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:56:44,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:44,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:56:44,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:44,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:56:44,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:44,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:56:44,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:44,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:56:44,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:44,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:56:44,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:44,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:56:44,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:44,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:56:44,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:44,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:56:44,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:44,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:56:44,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:44,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:56:44,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:44,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:56:44,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:44,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:56:44,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:44,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:56:44,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:44,738 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-19 07:56:44,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:56:44,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506201373] [2023-11-19 07:56:44,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506201373] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:56:44,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:56:44,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:56:44,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145377686] [2023-11-19 07:56:44,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:56:44,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:56:44,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:56:44,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:56:44,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:56:44,743 INFO L87 Difference]: Start difference. First operand 105 states and 147 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:56:44,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:56:44,793 INFO L93 Difference]: Finished difference Result 211 states and 296 transitions. [2023-11-19 07:56:44,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:56:44,794 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2023-11-19 07:56:44,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:56:44,798 INFO L225 Difference]: With dead ends: 211 [2023-11-19 07:56:44,798 INFO L226 Difference]: Without dead ends: 109 [2023-11-19 07:56:44,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:56:44,802 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 3 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:56:44,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 401 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:56:44,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-11-19 07:56:44,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2023-11-19 07:56:44,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 90 states have (on average 1.3222222222222222) internal successors, (119), 90 states have internal predecessors, (119), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-19 07:56:44,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 149 transitions. [2023-11-19 07:56:44,821 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 149 transitions. Word has length 124 [2023-11-19 07:56:44,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:56:44,821 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 149 transitions. [2023-11-19 07:56:44,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:56:44,822 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 149 transitions. [2023-11-19 07:56:44,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-19 07:56:44,824 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:56:44,824 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:56:44,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 07:56:44,825 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:56:44,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:56:44,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1789089887, now seen corresponding path program 1 times [2023-11-19 07:56:44,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:56:44,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883998714] [2023-11-19 07:56:44,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:56:44,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:56:44,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:45,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:56:45,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:45,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:56:45,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:45,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:56:45,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:45,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:56:45,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:45,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:56:45,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:45,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:56:45,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:45,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:56:45,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:45,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:56:45,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:45,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:56:45,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:45,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:56:45,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:45,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:56:45,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:45,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:56:45,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:45,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:56:45,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:45,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:56:45,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:45,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:56:45,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:45,309 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-19 07:56:45,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:56:45,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883998714] [2023-11-19 07:56:45,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883998714] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:56:45,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:56:45,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:56:45,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021899232] [2023-11-19 07:56:45,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:56:45,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:56:45,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:56:45,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:56:45,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:56:45,313 INFO L87 Difference]: Start difference. First operand 107 states and 149 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:56:45,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:56:45,555 INFO L93 Difference]: Finished difference Result 286 states and 397 transitions. [2023-11-19 07:56:45,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:56:45,555 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2023-11-19 07:56:45,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:56:45,557 INFO L225 Difference]: With dead ends: 286 [2023-11-19 07:56:45,557 INFO L226 Difference]: Without dead ends: 182 [2023-11-19 07:56:45,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 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-19 07:56:45,558 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 107 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 07:56:45,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 503 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 07:56:45,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2023-11-19 07:56:45,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 116. [2023-11-19 07:56:45,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 99 states have (on average 1.3333333333333333) internal successors, (132), 99 states have internal predecessors, (132), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-19 07:56:45,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 162 transitions. [2023-11-19 07:56:45,566 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 162 transitions. Word has length 124 [2023-11-19 07:56:45,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:56:45,567 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 162 transitions. [2023-11-19 07:56:45,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:56:45,567 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 162 transitions. [2023-11-19 07:56:45,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-11-19 07:56:45,569 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:56:45,569 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:56:45,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 07:56:45,569 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:56:45,570 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:56:45,570 INFO L85 PathProgramCache]: Analyzing trace with hash 379764372, now seen corresponding path program 1 times [2023-11-19 07:56:45,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:56:45,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650434504] [2023-11-19 07:56:45,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:56:45,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:56:45,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:46,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:56:46,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:46,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:56:46,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:46,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:56:46,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:46,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:56:46,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:46,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:56:46,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:46,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:56:46,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:46,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:56:46,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:46,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:56:46,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:46,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:56:46,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:46,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:56:46,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:46,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:56:46,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:46,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:56:46,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:46,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:56:46,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:46,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:56:46,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:46,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:56:46,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:46,366 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-19 07:56:46,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:56:46,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650434504] [2023-11-19 07:56:46,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650434504] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:56:46,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:56:46,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 07:56:46,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820563596] [2023-11-19 07:56:46,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:56:46,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:56:46,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:56:46,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:56:46,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:56:46,369 INFO L87 Difference]: Start difference. First operand 116 states and 162 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:56:46,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:56:46,883 INFO L93 Difference]: Finished difference Result 326 states and 453 transitions. [2023-11-19 07:56:46,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:56:46,884 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 125 [2023-11-19 07:56:46,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:56:46,887 INFO L225 Difference]: With dead ends: 326 [2023-11-19 07:56:46,887 INFO L226 Difference]: Without dead ends: 213 [2023-11-19 07:56:46,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-19 07:56:46,890 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 373 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-19 07:56:46,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 406 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-19 07:56:46,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2023-11-19 07:56:46,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 183. [2023-11-19 07:56:46,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 159 states have (on average 1.3333333333333333) internal successors, (212), 160 states have internal predecessors, (212), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-19 07:56:46,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 254 transitions. [2023-11-19 07:56:46,911 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 254 transitions. Word has length 125 [2023-11-19 07:56:46,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:56:46,911 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 254 transitions. [2023-11-19 07:56:46,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:56:46,912 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 254 transitions. [2023-11-19 07:56:46,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-11-19 07:56:46,913 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:56:46,914 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:56:46,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 07:56:46,914 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:56:46,914 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:56:46,914 INFO L85 PathProgramCache]: Analyzing trace with hash 245750866, now seen corresponding path program 1 times [2023-11-19 07:56:46,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:56:46,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173284610] [2023-11-19 07:56:46,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:56:46,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:56:47,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:47,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:56:47,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:47,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:56:47,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:47,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:56:47,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:47,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:56:47,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:47,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:56:47,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:47,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:56:47,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:47,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:56:47,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:47,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:56:47,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:47,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:56:47,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:47,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:56:47,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:47,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:56:47,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:47,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:56:47,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:47,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:56:47,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:47,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:56:47,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:47,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:56:47,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:47,356 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-19 07:56:47,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:56:47,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173284610] [2023-11-19 07:56:47,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173284610] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:56:47,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:56:47,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:56:47,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397375318] [2023-11-19 07:56:47,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:56:47,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:56:47,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:56:47,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:56:47,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:56:47,359 INFO L87 Difference]: Start difference. First operand 183 states and 254 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:56:47,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:56:47,571 INFO L93 Difference]: Finished difference Result 381 states and 528 transitions. [2023-11-19 07:56:47,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:56:47,572 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 125 [2023-11-19 07:56:47,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:56:47,575 INFO L225 Difference]: With dead ends: 381 [2023-11-19 07:56:47,575 INFO L226 Difference]: Without dead ends: 201 [2023-11-19 07:56:47,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:56:47,577 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 51 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 07:56:47,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 333 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 07:56:47,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2023-11-19 07:56:47,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 183. [2023-11-19 07:56:47,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 159 states have (on average 1.3270440251572326) internal successors, (211), 160 states have internal predecessors, (211), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-19 07:56:47,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 253 transitions. [2023-11-19 07:56:47,595 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 253 transitions. Word has length 125 [2023-11-19 07:56:47,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:56:47,596 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 253 transitions. [2023-11-19 07:56:47,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:56:47,596 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 253 transitions. [2023-11-19 07:56:47,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-11-19 07:56:47,598 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:56:47,598 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:56:47,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 07:56:47,599 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:56:47,599 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:56:47,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1336086526, now seen corresponding path program 1 times [2023-11-19 07:56:47,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:56:47,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53654584] [2023-11-19 07:56:47,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:56:47,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:56:47,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:48,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:56:48,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:48,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:56:48,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:48,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:56:48,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:48,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:56:48,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:48,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:56:48,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:48,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:56:48,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:48,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:56:48,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:48,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:56:48,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:48,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:56:48,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:48,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:56:48,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:48,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:56:48,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:48,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:56:48,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:48,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:56:48,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:48,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:56:48,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:48,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:56:48,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:48,203 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-19 07:56:48,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:56:48,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53654584] [2023-11-19 07:56:48,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53654584] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:56:48,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:56:48,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 07:56:48,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909005143] [2023-11-19 07:56:48,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:56:48,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:56:48,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:56:48,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:56:48,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:56:48,207 INFO L87 Difference]: Start difference. First operand 183 states and 253 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:56:48,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:56:48,642 INFO L93 Difference]: Finished difference Result 491 states and 675 transitions. [2023-11-19 07:56:48,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:56:48,643 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 126 [2023-11-19 07:56:48,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:56:48,645 INFO L225 Difference]: With dead ends: 491 [2023-11-19 07:56:48,646 INFO L226 Difference]: Without dead ends: 311 [2023-11-19 07:56:48,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-19 07:56:48,647 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 346 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-19 07:56:48,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 287 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-19 07:56:48,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2023-11-19 07:56:48,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 186. [2023-11-19 07:56:48,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 162 states have (on average 1.3209876543209877) internal successors, (214), 163 states have internal predecessors, (214), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-19 07:56:48,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 256 transitions. [2023-11-19 07:56:48,664 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 256 transitions. Word has length 126 [2023-11-19 07:56:48,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:56:48,664 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 256 transitions. [2023-11-19 07:56:48,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:56:48,665 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 256 transitions. [2023-11-19 07:56:48,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-11-19 07:56:48,666 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:56:48,667 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:56:48,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 07:56:48,667 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:56:48,667 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:56:48,668 INFO L85 PathProgramCache]: Analyzing trace with hash -658058180, now seen corresponding path program 1 times [2023-11-19 07:56:48,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:56:48,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049355572] [2023-11-19 07:56:48,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:56:48,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:56:48,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:48,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:56:48,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:48,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:56:49,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:49,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:56:49,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:49,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:56:49,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:49,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:56:49,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:49,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:56:49,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:49,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:56:49,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:49,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:56:49,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:49,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:56:49,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:49,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:56:49,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:49,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:56:49,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:49,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:56:49,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:49,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:56:49,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:49,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:56:49,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:49,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:56:49,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:49,030 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-19 07:56:49,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:56:49,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049355572] [2023-11-19 07:56:49,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049355572] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:56:49,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:56:49,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:56:49,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265472550] [2023-11-19 07:56:49,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:56:49,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:56:49,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:56:49,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:56:49,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:56:49,033 INFO L87 Difference]: Start difference. First operand 186 states and 256 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:56:49,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:56:49,309 INFO L93 Difference]: Finished difference Result 580 states and 793 transitions. [2023-11-19 07:56:49,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:56:49,310 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 126 [2023-11-19 07:56:49,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:56:49,313 INFO L225 Difference]: With dead ends: 580 [2023-11-19 07:56:49,313 INFO L226 Difference]: Without dead ends: 397 [2023-11-19 07:56:49,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:56:49,315 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 237 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 07:56:49,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 335 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 07:56:49,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2023-11-19 07:56:49,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 186. [2023-11-19 07:56:49,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 162 states have (on average 1.3148148148148149) internal successors, (213), 163 states have internal predecessors, (213), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-19 07:56:49,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 255 transitions. [2023-11-19 07:56:49,332 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 255 transitions. Word has length 126 [2023-11-19 07:56:49,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:56:49,333 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 255 transitions. [2023-11-19 07:56:49,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:56:49,333 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 255 transitions. [2023-11-19 07:56:49,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-11-19 07:56:49,335 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:56:49,335 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:56:49,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-19 07:56:49,336 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:56:49,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:56:49,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1414004056, now seen corresponding path program 1 times [2023-11-19 07:56:49,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:56:49,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36606883] [2023-11-19 07:56:49,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:56:49,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:56:49,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:49,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:56:49,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:49,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:56:49,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:49,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:56:49,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:49,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:56:49,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:49,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:56:49,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:49,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:56:49,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:49,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:56:49,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:49,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:56:49,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:49,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:56:49,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:49,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:56:49,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:49,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:56:49,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:49,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:56:49,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:49,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:56:49,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:49,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:56:49,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:49,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:56:49,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:49,922 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-19 07:56:49,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:56:49,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36606883] [2023-11-19 07:56:49,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36606883] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:56:49,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:56:49,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 07:56:49,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013925413] [2023-11-19 07:56:49,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:56:49,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:56:49,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:56:49,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:56:49,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:56:49,925 INFO L87 Difference]: Start difference. First operand 186 states and 255 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:56:50,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:56:50,363 INFO L93 Difference]: Finished difference Result 478 states and 654 transitions. [2023-11-19 07:56:50,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 07:56:50,363 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 126 [2023-11-19 07:56:50,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:56:50,366 INFO L225 Difference]: With dead ends: 478 [2023-11-19 07:56:50,366 INFO L226 Difference]: Without dead ends: 295 [2023-11-19 07:56:50,367 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-11-19 07:56:50,368 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 220 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-19 07:56:50,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 443 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-19 07:56:50,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2023-11-19 07:56:50,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 190. [2023-11-19 07:56:50,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 166 states have (on average 1.319277108433735) internal successors, (219), 167 states have internal predecessors, (219), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-19 07:56:50,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 261 transitions. [2023-11-19 07:56:50,385 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 261 transitions. Word has length 126 [2023-11-19 07:56:50,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:56:50,386 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 261 transitions. [2023-11-19 07:56:50,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:56:50,387 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 261 transitions. [2023-11-19 07:56:50,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-11-19 07:56:50,388 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:56:50,388 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:56:50,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-19 07:56:50,389 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:56:50,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:56:50,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1749076431, now seen corresponding path program 1 times [2023-11-19 07:56:50,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:56:50,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056777836] [2023-11-19 07:56:50,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:56:50,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:56:50,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:51,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:56:51,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:51,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:56:51,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:51,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:56:51,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:51,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:56:51,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:51,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:56:51,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:51,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:56:51,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:51,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:56:51,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:51,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:56:51,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:51,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:56:51,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:51,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:56:51,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:51,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:56:51,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:51,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:56:51,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:51,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:56:51,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:51,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:56:51,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:51,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:56:51,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:51,645 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-19 07:56:51,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:56:51,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056777836] [2023-11-19 07:56:51,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056777836] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:56:51,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:56:51,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:56:51,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719182362] [2023-11-19 07:56:51,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:56:51,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:56:51,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:56:51,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:56:51,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:56:51,648 INFO L87 Difference]: Start difference. First operand 190 states and 261 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:56:52,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:56:52,136 INFO L93 Difference]: Finished difference Result 452 states and 619 transitions. [2023-11-19 07:56:52,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 07:56:52,137 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 127 [2023-11-19 07:56:52,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:56:52,139 INFO L225 Difference]: With dead ends: 452 [2023-11-19 07:56:52,139 INFO L226 Difference]: Without dead ends: 265 [2023-11-19 07:56:52,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-11-19 07:56:52,140 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 139 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:56:52,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 718 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:56:52,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2023-11-19 07:56:52,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 199. [2023-11-19 07:56:52,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 175 states have (on average 1.32) internal successors, (231), 176 states have internal predecessors, (231), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-19 07:56:52,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 273 transitions. [2023-11-19 07:56:52,165 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 273 transitions. Word has length 127 [2023-11-19 07:56:52,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:56:52,165 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 273 transitions. [2023-11-19 07:56:52,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:56:52,166 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 273 transitions. [2023-11-19 07:56:52,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-11-19 07:56:52,167 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:56:52,168 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:56:52,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-19 07:56:52,168 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:56:52,168 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:56:52,169 INFO L85 PathProgramCache]: Analyzing trace with hash -204199717, now seen corresponding path program 1 times [2023-11-19 07:56:52,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:56:52,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342330709] [2023-11-19 07:56:52,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:56:52,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:56:52,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:52,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:56:52,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:52,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:56:52,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:52,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:56:52,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:52,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:56:52,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:52,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:56:52,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:52,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:56:52,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:52,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:56:52,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:52,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:56:52,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:52,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:56:52,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:52,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:56:52,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:52,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:56:52,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:52,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:56:52,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:52,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:56:52,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:52,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:56:52,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:52,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:56:52,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:52,928 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-19 07:56:52,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:56:52,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342330709] [2023-11-19 07:56:52,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342330709] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:56:52,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:56:52,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 07:56:52,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501666905] [2023-11-19 07:56:52,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:56:52,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:56:52,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:56:52,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:56:52,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:56:52,931 INFO L87 Difference]: Start difference. First operand 199 states and 273 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:56:53,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:56:53,505 INFO L93 Difference]: Finished difference Result 535 states and 730 transitions. [2023-11-19 07:56:53,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:56:53,505 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 127 [2023-11-19 07:56:53,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:56:53,508 INFO L225 Difference]: With dead ends: 535 [2023-11-19 07:56:53,508 INFO L226 Difference]: Without dead ends: 339 [2023-11-19 07:56:53,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-11-19 07:56:53,511 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 230 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-19 07:56:53,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 456 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-19 07:56:53,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2023-11-19 07:56:53,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 201. [2023-11-19 07:56:53,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 177 states have (on average 1.3220338983050848) internal successors, (234), 178 states have internal predecessors, (234), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-19 07:56:53,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 276 transitions. [2023-11-19 07:56:53,536 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 276 transitions. Word has length 127 [2023-11-19 07:56:53,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:56:53,536 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 276 transitions. [2023-11-19 07:56:53,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:56:53,537 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 276 transitions. [2023-11-19 07:56:53,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-11-19 07:56:53,539 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:56:53,540 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:56:53,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-19 07:56:53,540 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:56:53,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:56:53,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1046338064, now seen corresponding path program 1 times [2023-11-19 07:56:53,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:56:53,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18207715] [2023-11-19 07:56:53,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:56:53,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:56:53,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:53,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:56:53,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:53,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:56:53,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:53,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:56:53,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:53,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:56:53,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:53,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:56:53,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:53,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:56:53,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:53,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:56:53,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:53,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:56:53,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:53,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:56:53,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:53,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:56:53,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:53,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:56:53,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:53,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:56:53,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:53,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:56:53,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:53,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:56:53,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:53,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:56:53,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:53,802 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-19 07:56:53,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:56:53,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18207715] [2023-11-19 07:56:53,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18207715] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:56:53,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:56:53,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:56:53,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950359030] [2023-11-19 07:56:53,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:56:53,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:56:53,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:56:53,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:56:53,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:56:53,810 INFO L87 Difference]: Start difference. First operand 201 states and 276 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:56:53,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:56:53,884 INFO L93 Difference]: Finished difference Result 431 states and 591 transitions. [2023-11-19 07:56:53,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:56:53,885 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 128 [2023-11-19 07:56:53,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:56:53,887 INFO L225 Difference]: With dead ends: 431 [2023-11-19 07:56:53,887 INFO L226 Difference]: Without dead ends: 233 [2023-11-19 07:56:53,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:56:53,889 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 42 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:56:53,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 532 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:56:53,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2023-11-19 07:56:53,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 207. [2023-11-19 07:56:53,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 183 states have (on average 1.3114754098360655) internal successors, (240), 184 states have internal predecessors, (240), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-19 07:56:53,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 282 transitions. [2023-11-19 07:56:53,917 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 282 transitions. Word has length 128 [2023-11-19 07:56:53,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:56:53,918 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 282 transitions. [2023-11-19 07:56:53,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:56:53,918 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 282 transitions. [2023-11-19 07:56:53,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-11-19 07:56:53,921 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:56:53,921 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:56:53,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-19 07:56:53,921 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:56:53,922 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:56:53,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1016317253, now seen corresponding path program 1 times [2023-11-19 07:56:53,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:56:53,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103510267] [2023-11-19 07:56:53,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:56:53,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:56:54,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:54,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:56:54,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:54,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:56:54,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:54,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:56:54,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:54,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:56:54,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:54,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:56:54,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:54,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:56:54,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:54,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:56:54,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:54,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:56:54,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:54,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:56:54,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:54,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:56:54,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:54,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:56:54,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:54,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:56:54,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:54,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:56:54,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:54,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:56:54,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:54,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:56:54,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:54,666 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-19 07:56:54,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:56:54,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103510267] [2023-11-19 07:56:54,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103510267] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:56:54,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:56:54,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 07:56:54,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858134068] [2023-11-19 07:56:54,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:56:54,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:56:54,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:56:54,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:56:54,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:56:54,670 INFO L87 Difference]: Start difference. First operand 207 states and 282 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:56:55,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:56:55,171 INFO L93 Difference]: Finished difference Result 446 states and 602 transitions. [2023-11-19 07:56:55,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:56:55,172 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 128 [2023-11-19 07:56:55,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:56:55,174 INFO L225 Difference]: With dead ends: 446 [2023-11-19 07:56:55,174 INFO L226 Difference]: Without dead ends: 242 [2023-11-19 07:56:55,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:56:55,176 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 468 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-19 07:56:55,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 266 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-19 07:56:55,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2023-11-19 07:56:55,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 150. [2023-11-19 07:56:55,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 132 states have (on average 1.3106060606060606) internal successors, (173), 132 states have internal predecessors, (173), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-19 07:56:55,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 203 transitions. [2023-11-19 07:56:55,194 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 203 transitions. Word has length 128 [2023-11-19 07:56:55,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:56:55,194 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 203 transitions. [2023-11-19 07:56:55,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:56:55,195 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 203 transitions. [2023-11-19 07:56:55,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-11-19 07:56:55,197 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:56:55,197 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:56:55,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-19 07:56:55,197 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:56:55,198 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:56:55,198 INFO L85 PathProgramCache]: Analyzing trace with hash -297850184, now seen corresponding path program 1 times [2023-11-19 07:56:55,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:56:55,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85352906] [2023-11-19 07:56:55,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:56:55,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:56:55,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:56,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:56:56,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:56,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:56:56,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:56,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:56:56,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:56,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:56:56,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:56,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:56:56,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:56,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:56:56,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:56,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:56:56,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:56,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:56:56,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:56,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:56:56,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:56,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:56:56,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:56,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:56:56,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:56,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:56:56,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:56,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:56:56,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:56,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:56:56,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:56,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:56:56,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:56,433 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-19 07:56:56,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:56:56,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85352906] [2023-11-19 07:56:56,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85352906] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:56:56,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:56:56,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-19 07:56:56,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97746137] [2023-11-19 07:56:56,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:56:56,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 07:56:56,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:56:56,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 07:56:56,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:56:56,436 INFO L87 Difference]: Start difference. First operand 150 states and 203 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:56:57,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:56:57,026 INFO L93 Difference]: Finished difference Result 376 states and 505 transitions. [2023-11-19 07:56:57,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-19 07:56:57,027 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2023-11-19 07:56:57,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:56:57,029 INFO L225 Difference]: With dead ends: 376 [2023-11-19 07:56:57,029 INFO L226 Difference]: Without dead ends: 229 [2023-11-19 07:56:57,030 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2023-11-19 07:56:57,030 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 297 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-19 07:56:57,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 562 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-19 07:56:57,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2023-11-19 07:56:57,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 152. [2023-11-19 07:56:57,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 134 states have (on average 1.3134328358208955) internal successors, (176), 134 states have internal predecessors, (176), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-19 07:56:57,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 206 transitions. [2023-11-19 07:56:57,050 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 206 transitions. Word has length 129 [2023-11-19 07:56:57,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:56:57,051 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 206 transitions. [2023-11-19 07:56:57,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:56:57,052 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 206 transitions. [2023-11-19 07:56:57,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-11-19 07:56:57,053 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:56:57,054 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:56:57,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-19 07:56:57,054 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:56:57,054 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:56:57,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1890290934, now seen corresponding path program 1 times [2023-11-19 07:56:57,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:56:57,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167620362] [2023-11-19 07:56:57,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:56:57,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:56:57,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:58,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:56:58,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:58,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:56:58,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:58,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:56:58,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:58,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:56:58,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:58,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:56:58,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:58,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:56:58,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:58,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:56:58,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:58,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:56:58,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:58,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:56:58,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:58,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:56:58,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:58,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:56:58,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:58,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:56:58,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:58,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:56:58,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:58,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:56:58,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:58,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:56:58,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:58,430 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-11-19 07:56:58,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:56:58,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167620362] [2023-11-19 07:56:58,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167620362] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:56:58,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581376118] [2023-11-19 07:56:58,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:56:58,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:56:58,431 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b26e8d43-442a-485a-b3d9-f0c4c82e15e7/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:56:58,433 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b26e8d43-442a-485a-b3d9-f0c4c82e15e7/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:56:58,438 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b26e8d43-442a-485a-b3d9-f0c4c82e15e7/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 07:56:58,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:58,799 INFO L262 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 30 conjunts are in the unsatisfiable core [2023-11-19 07:56:58,817 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:56:59,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2023-11-19 07:56:59,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2023-11-19 07:56:59,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:56:59,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-19 07:56:59,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:56:59,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-19 07:57:00,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:57:00,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-19 07:57:00,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:57:00,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-19 07:57:00,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:57:00,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-19 07:57:00,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2023-11-19 07:57:00,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:57:00,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:57:00,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 22 [2023-11-19 07:57:00,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:57:00,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2023-11-19 07:57:00,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:57:00,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2023-11-19 07:57:00,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:57:00,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:57:00,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 22 [2023-11-19 07:57:00,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:57:00,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:57:00,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:57:00,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 22 [2023-11-19 07:57:01,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:57:01,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:57:01,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 22 [2023-11-19 07:57:01,116 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 12 proven. 140 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2023-11-19 07:57:01,116 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:57:01,151 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1068 (Array Int Int)) (v_ArrVal_1067 (Array Int Int)) (v_ArrVal_1066 (Array Int Int))) (not (= (mod (select (select (store (store (store |c_#memory_int| |c_~#unsigned_char_Array_0~0.base| v_ArrVal_1066) |c_~#float_Array_0~0.base| v_ArrVal_1067) |c_~#signed_char_Array_0~0.base| v_ArrVal_1068) |c_~#BOOL_unsigned_char_Array_0~0.base|) |c_~#BOOL_unsigned_char_Array_0~0.offset|) 256) 0))) is different from false [2023-11-19 07:57:01,162 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1068 (Array Int Int)) (v_ArrVal_1067 (Array Int Int)) (v_ArrVal_1066 (Array Int Int))) (not (= (mod (select (select (store (store (store (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base|))) (store .cse0 |c_~#BOOL_unsigned_char_Array_0~0.offset| (select .cse0 (+ 2 |c_~#BOOL_unsigned_char_Array_0~0.offset|))))) |c_~#unsigned_char_Array_0~0.base| v_ArrVal_1066) |c_~#float_Array_0~0.base| v_ArrVal_1067) |c_~#signed_char_Array_0~0.base| v_ArrVal_1068) |c_~#BOOL_unsigned_char_Array_0~0.base|) |c_~#BOOL_unsigned_char_Array_0~0.offset|) 256) 0))) is different from false [2023-11-19 07:57:01,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581376118] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:57:01,190 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-19 07:57:01,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2023-11-19 07:57:01,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973171288] [2023-11-19 07:57:01,191 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-19 07:57:01,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-19 07:57:01,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:57:01,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-19 07:57:01,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=285, Unknown=2, NotChecked=70, Total=420 [2023-11-19 07:57:01,194 INFO L87 Difference]: Start difference. First operand 152 states and 206 transitions. Second operand has 18 states, 16 states have (on average 6.0) internal successors, (96), 18 states have internal predecessors, (96), 6 states have call successors, (30), 4 states have call predecessors, (30), 5 states have return successors, (30), 4 states have call predecessors, (30), 6 states have call successors, (30) [2023-11-19 07:57:03,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:57:03,413 INFO L93 Difference]: Finished difference Result 435 states and 583 transitions. [2023-11-19 07:57:03,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-19 07:57:03,414 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.0) internal successors, (96), 18 states have internal predecessors, (96), 6 states have call successors, (30), 4 states have call predecessors, (30), 5 states have return successors, (30), 4 states have call predecessors, (30), 6 states have call successors, (30) Word has length 129 [2023-11-19 07:57:03,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:57:03,416 INFO L225 Difference]: With dead ends: 435 [2023-11-19 07:57:03,416 INFO L226 Difference]: Without dead ends: 286 [2023-11-19 07:57:03,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=265, Invalid=1001, Unknown=2, NotChecked=138, Total=1406 [2023-11-19 07:57:03,418 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 377 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 1361 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 1430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-19 07:57:03,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 549 Invalid, 1430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1361 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-19 07:57:03,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2023-11-19 07:57:03,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 158. [2023-11-19 07:57:03,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 139 states have (on average 1.3021582733812949) internal successors, (181), 139 states have internal predecessors, (181), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-19 07:57:03,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 211 transitions. [2023-11-19 07:57:03,445 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 211 transitions. Word has length 129 [2023-11-19 07:57:03,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:57:03,446 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 211 transitions. [2023-11-19 07:57:03,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.0) internal successors, (96), 18 states have internal predecessors, (96), 6 states have call successors, (30), 4 states have call predecessors, (30), 5 states have return successors, (30), 4 states have call predecessors, (30), 6 states have call successors, (30) [2023-11-19 07:57:03,446 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 211 transitions. [2023-11-19 07:57:03,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-11-19 07:57:03,448 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:57:03,448 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:57:03,474 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b26e8d43-442a-485a-b3d9-f0c4c82e15e7/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-19 07:57:03,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b26e8d43-442a-485a-b3d9-f0c4c82e15e7/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:57:03,665 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:57:03,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:57:03,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1867658680, now seen corresponding path program 1 times [2023-11-19 07:57:03,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:57:03,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398369249] [2023-11-19 07:57:03,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:57:03,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:57:03,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:57:03,847 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:57:03,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:57:04,002 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:57:04,002 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 07:57:04,003 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-19 07:57:04,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-19 07:57:04,008 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:57:04,014 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 07:57:04,090 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem44 could not be translated [2023-11-19 07:57:04,093 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem44 could not be translated [2023-11-19 07:57:04,093 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem45 could not be translated [2023-11-19 07:57:04,094 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem45 could not be translated [2023-11-19 07:57:04,095 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem47 could not be translated [2023-11-19 07:57:04,103 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem47 could not be translated [2023-11-19 07:57:04,104 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem48 could not be translated [2023-11-19 07:57:04,106 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem48 could not be translated [2023-11-19 07:57:04,107 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem50 could not be translated [2023-11-19 07:57:04,108 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem50 could not be translated [2023-11-19 07:57:04,111 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem51 could not be translated [2023-11-19 07:57:04,114 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem51 could not be translated [2023-11-19 07:57:04,115 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem53 could not be translated [2023-11-19 07:57:04,116 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem54 could not be translated [2023-11-19 07:57:04,116 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short59 could not be translated [2023-11-19 07:57:04,117 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem53 could not be translated [2023-11-19 07:57:04,117 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem54 could not be translated [2023-11-19 07:57:04,117 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short55 could not be translated [2023-11-19 07:57:04,118 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem53 could not be translated [2023-11-19 07:57:04,118 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem54 could not be translated [2023-11-19 07:57:04,118 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short59 could not be translated [2023-11-19 07:57:04,118 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short55 could not be translated [2023-11-19 07:57:04,118 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem61 could not be translated [2023-11-19 07:57:04,119 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem61 could not be translated [2023-11-19 07:57:04,121 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem62 could not be translated [2023-11-19 07:57:04,121 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem62 could not be translated [2023-11-19 07:57:04,122 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem64 could not be translated [2023-11-19 07:57:04,123 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem64 could not be translated [2023-11-19 07:57:04,125 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem65 could not be translated [2023-11-19 07:57:04,128 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem65 could not be translated [2023-11-19 07:57:04,130 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem67 could not be translated [2023-11-19 07:57:04,130 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem67 could not be translated [2023-11-19 07:57:04,130 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem68 could not be translated [2023-11-19 07:57:04,131 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem68 could not be translated [2023-11-19 07:57:04,132 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem70 could not be translated [2023-11-19 07:57:04,133 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem70 could not be translated [2023-11-19 07:57:04,135 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem71 could not be translated [2023-11-19 07:57:04,135 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem71 could not be translated [2023-11-19 07:57:04,135 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem4 could not be translated [2023-11-19 07:57:04,136 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem11 could not be translated [2023-11-19 07:57:04,136 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem10 could not be translated [2023-11-19 07:57:04,136 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem13 could not be translated [2023-11-19 07:57:04,136 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem16 could not be translated [2023-11-19 07:57:04,137 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem17 could not be translated [2023-11-19 07:57:04,137 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem18 could not be translated [2023-11-19 07:57:04,137 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite20 could not be translated [2023-11-19 07:57:04,137 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem17 could not be translated [2023-11-19 07:57:04,137 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem16 could not be translated [2023-11-19 07:57:04,138 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem17 could not be translated [2023-11-19 07:57:04,138 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite20 could not be translated [2023-11-19 07:57:04,138 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem18 could not be translated [2023-11-19 07:57:04,138 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem21 could not be translated [2023-11-19 07:57:04,138 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem16 could not be translated [2023-11-19 07:57:04,139 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem21 could not be translated [2023-11-19 07:57:04,140 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite28 could not be translated [2023-11-19 07:57:04,140 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem16 could not be translated [2023-11-19 07:57:04,140 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem17 could not be translated [2023-11-19 07:57:04,140 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem27 could not be translated [2023-11-19 07:57:04,140 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem18 could not be translated [2023-11-19 07:57:04,141 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite20 could not be translated [2023-11-19 07:57:04,141 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem31 could not be translated [2023-11-19 07:57:04,141 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem30 could not be translated [2023-11-19 07:57:04,141 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem32 could not be translated [2023-11-19 07:57:04,142 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem30 could not be translated [2023-11-19 07:57:04,142 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem31 could not be translated [2023-11-19 07:57:04,142 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem35 could not be translated [2023-11-19 07:57:04,142 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem31 could not be translated [2023-11-19 07:57:04,142 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem32 could not be translated [2023-11-19 07:57:04,143 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem30 could not be translated [2023-11-19 07:57:04,143 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem73 could not be translated [2023-11-19 07:57:04,143 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem72 could not be translated [2023-11-19 07:57:04,143 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem72 could not be translated [2023-11-19 07:57:04,143 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite96 could not be translated [2023-11-19 07:57:04,144 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem73 could not be translated [2023-11-19 07:57:04,144 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem95 could not be translated [2023-11-19 07:57:04,144 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem94 could not be translated [2023-11-19 07:57:04,144 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short74 could not be translated [2023-11-19 07:57:04,144 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem94 could not be translated [2023-11-19 07:57:04,144 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem95 could not be translated [2023-11-19 07:57:04,145 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem73 could not be translated [2023-11-19 07:57:04,145 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short74 could not be translated [2023-11-19 07:57:04,145 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short112 could not be translated [2023-11-19 07:57:04,145 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite96 could not be translated [2023-11-19 07:57:04,145 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem72 could not be translated [2023-11-19 07:57:04,146 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem73 could not be translated [2023-11-19 07:57:04,146 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem95 could not be translated [2023-11-19 07:57:04,146 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short119 could not be translated [2023-11-19 07:57:04,146 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short112 could not be translated [2023-11-19 07:57:04,146 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite96 could not be translated [2023-11-19 07:57:04,146 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem94 could not be translated [2023-11-19 07:57:04,147 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short74 could not be translated [2023-11-19 07:57:04,147 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem72 could not be translated [2023-11-19 07:57:04,147 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short122 could not be translated [2023-11-19 07:57:04,147 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite96 could not be translated [2023-11-19 07:57:04,147 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem72 could not be translated [2023-11-19 07:57:04,147 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem73 could not be translated [2023-11-19 07:57:04,148 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short119 could not be translated [2023-11-19 07:57:04,148 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short112 could not be translated [2023-11-19 07:57:04,148 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short74 could not be translated [2023-11-19 07:57:04,148 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem95 could not be translated [2023-11-19 07:57:04,148 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem94 could not be translated [2023-11-19 07:57:04,149 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short74 could not be translated [2023-11-19 07:57:04,149 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem95 could not be translated [2023-11-19 07:57:04,149 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short119 could not be translated [2023-11-19 07:57:04,149 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem94 could not be translated [2023-11-19 07:57:04,149 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short112 could not be translated [2023-11-19 07:57:04,149 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem73 could not be translated [2023-11-19 07:57:04,150 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem72 could not be translated [2023-11-19 07:57:04,150 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short122 could not be translated [2023-11-19 07:57:04,150 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite96 could not be translated [2023-11-19 07:57:04,150 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short125 could not be translated [2023-11-19 07:57:04,150 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short128 could not be translated [2023-11-19 07:57:04,151 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem95 could not be translated [2023-11-19 07:57:04,151 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short122 could not be translated [2023-11-19 07:57:04,151 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem73 could not be translated [2023-11-19 07:57:04,151 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem94 could not be translated [2023-11-19 07:57:04,151 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short125 could not be translated [2023-11-19 07:57:04,151 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite96 could not be translated [2023-11-19 07:57:04,152 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem72 could not be translated [2023-11-19 07:57:04,152 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short119 could not be translated [2023-11-19 07:57:04,152 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short112 could not be translated [2023-11-19 07:57:04,152 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short74 could not be translated [2023-11-19 07:57:04,183 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:57:04 BoogieIcfgContainer [2023-11-19 07:57:04,183 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 07:57:04,184 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 07:57:04,184 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 07:57:04,184 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 07:57:04,185 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:56:41" (3/4) ... [2023-11-19 07:57:04,187 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-19 07:57:04,188 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 07:57:04,189 INFO L158 Benchmark]: Toolchain (without parser) took 23771.05ms. Allocated memory was 119.5MB in the beginning and 390.1MB in the end (delta: 270.5MB). Free memory was 75.1MB in the beginning and 267.8MB in the end (delta: -192.7MB). Peak memory consumption was 80.5MB. Max. memory is 16.1GB. [2023-11-19 07:57:04,192 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 119.5MB. Free memory was 89.1MB in the beginning and 88.9MB in the end (delta: 179.8kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:57:04,192 INFO L158 Benchmark]: CACSL2BoogieTranslator took 351.15ms. Allocated memory is still 119.5MB. Free memory was 74.7MB in the beginning and 60.5MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-19 07:57:04,193 INFO L158 Benchmark]: Boogie Procedure Inliner took 128.60ms. Allocated memory is still 119.5MB. Free memory was 60.5MB in the beginning and 56.7MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-19 07:57:04,197 INFO L158 Benchmark]: Boogie Preprocessor took 57.07ms. Allocated memory is still 119.5MB. Free memory was 56.7MB in the beginning and 53.3MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-19 07:57:04,197 INFO L158 Benchmark]: RCFGBuilder took 836.04ms. Allocated memory was 119.5MB in the beginning and 148.9MB in the end (delta: 29.4MB). Free memory was 53.3MB in the beginning and 98.9MB in the end (delta: -45.6MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. [2023-11-19 07:57:04,198 INFO L158 Benchmark]: TraceAbstraction took 22380.42ms. Allocated memory was 148.9MB in the beginning and 390.1MB in the end (delta: 241.2MB). Free memory was 98.1MB in the beginning and 268.8MB in the end (delta: -170.7MB). Peak memory consumption was 71.9MB. Max. memory is 16.1GB. [2023-11-19 07:57:04,198 INFO L158 Benchmark]: Witness Printer took 4.40ms. Allocated memory is still 390.1MB. Free memory was 268.8MB in the beginning and 267.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:57:04,201 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.28ms. Allocated memory is still 119.5MB. Free memory was 89.1MB in the beginning and 88.9MB in the end (delta: 179.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 351.15ms. Allocated memory is still 119.5MB. Free memory was 74.7MB in the beginning and 60.5MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 128.60ms. Allocated memory is still 119.5MB. Free memory was 60.5MB in the beginning and 56.7MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.07ms. Allocated memory is still 119.5MB. Free memory was 56.7MB in the beginning and 53.3MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 836.04ms. Allocated memory was 119.5MB in the beginning and 148.9MB in the end (delta: 29.4MB). Free memory was 53.3MB in the beginning and 98.9MB in the end (delta: -45.6MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. * TraceAbstraction took 22380.42ms. Allocated memory was 148.9MB in the beginning and 390.1MB in the end (delta: 241.2MB). Free memory was 98.1MB in the beginning and 268.8MB in the end (delta: -170.7MB). Peak memory consumption was 71.9MB. Max. memory is 16.1GB. * Witness Printer took 4.40ms. Allocated memory is still 390.1MB. Free memory was 268.8MB in the beginning and 267.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem44 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem44 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem45 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem45 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem47 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem47 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem48 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem48 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem50 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem50 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem51 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem51 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem53 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem54 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short59 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem53 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem54 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short55 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem53 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem54 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short59 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short55 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem61 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem61 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem62 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem62 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem64 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem64 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem65 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem65 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem67 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem67 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem68 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem68 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem70 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem70 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem71 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem71 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem10 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem13 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem16 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem18 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite20 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem16 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite20 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem18 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem21 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem16 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem21 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite28 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem16 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem27 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem18 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite20 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem31 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem30 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem32 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem30 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem31 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem35 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem31 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem32 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem30 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem73 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem72 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem72 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite96 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem73 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem95 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem94 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short74 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem94 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem95 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem73 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short74 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short112 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite96 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem72 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem73 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem95 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short119 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short112 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite96 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem94 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short74 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem72 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short122 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite96 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem72 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem73 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short119 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short112 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short74 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem95 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem94 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short74 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem95 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short119 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem94 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short112 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem73 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem72 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short122 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite96 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short125 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short128 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem95 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short122 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem73 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem94 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short125 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite96 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem72 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short119 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short112 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short74 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 89, overapproximation of someBinaryDOUBLEComparisonOperation at line 57, overapproximation of someBinaryArithmeticDOUBLEoperation at line 57. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 1}, {1, 0} }; [L25-L27] float float_Array_0[2] = { 2.25, 199.4 }; [L28-L30] signed char signed_char_Array_0[5] = { -128, 0, 4, 16, 32 }; [L31-L33] unsigned char unsigned_char_Array_0[1] = { 100 }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2] = { 55182, 0 }; VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L93] isInitial = 1 [L94] FCALL initially() [L95] COND TRUE 1 [L96] FCALL updateLastVariables() [L97] CALL updateVariables() [L62] BOOL_unsigned_char_Array_0[1][0] = __VERIFIER_nondet_uchar() [L63] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L63] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L63] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L64] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L64] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L64] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L65] BOOL_unsigned_char_Array_0[0][1] = __VERIFIER_nondet_uchar() [L66] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L66] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L66] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L67] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L67] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L67] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L68] BOOL_unsigned_char_Array_0[1][1] = __VERIFIER_nondet_uchar() [L69] EXPR BOOL_unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L69] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L69] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L70] EXPR BOOL_unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L70] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L70] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L71] float_Array_0[1] = __VERIFIER_nondet_float() [L72] EXPR float_Array_0[1] [L72] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F [L72] EXPR float_Array_0[1] [L72] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] CALL assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] RET assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L73] signed_char_Array_0[1] = __VERIFIER_nondet_char() [L74] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L74] CALL assume_abort_if_not(signed_char_Array_0[1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L74] RET assume_abort_if_not(signed_char_Array_0[1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] CALL assume_abort_if_not(signed_char_Array_0[1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] RET assume_abort_if_not(signed_char_Array_0[1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L76] signed_char_Array_0[2] = __VERIFIER_nondet_char() [L77] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] CALL assume_abort_if_not(signed_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] RET assume_abort_if_not(signed_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L78] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L78] CALL assume_abort_if_not(signed_char_Array_0[2] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L78] RET assume_abort_if_not(signed_char_Array_0[2] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L79] signed_char_Array_0[3] = __VERIFIER_nondet_char() [L80] EXPR signed_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L80] CALL assume_abort_if_not(signed_char_Array_0[3] >= -1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L80] RET assume_abort_if_not(signed_char_Array_0[3] >= -1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L81] EXPR signed_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L81] CALL assume_abort_if_not(signed_char_Array_0[3] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L81] RET assume_abort_if_not(signed_char_Array_0[3] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L82] unsigned_short_int_Array_0[0] = __VERIFIER_nondet_ushort() [L83] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L83] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] >= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L83] RET assume_abort_if_not(unsigned_short_int_Array_0[0] >= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L84] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L84] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L84] RET assume_abort_if_not(unsigned_short_int_Array_0[0] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L97] RET updateVariables() [L98] CALL step() [L40] EXPR BOOL_unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L40] COND FALSE !(! BOOL_unsigned_char_Array_0[1][1]) [L43] EXPR BOOL_unsigned_char_Array_0[0][1] [L43] BOOL_unsigned_char_Array_0[0][0] = ((! BOOL_unsigned_char_Array_0[0][1]) || (! (! 0))) [L45] EXPR signed_char_Array_0[2] [L45] unsigned_char_Array_0[0] = signed_char_Array_0[2] [L46] EXPR float_Array_0[1] [L46] float_Array_0[0] = float_Array_0[1] [L47] EXPR signed_char_Array_0[3] [L47] signed_char_Array_0[0] = signed_char_Array_0[3] [L48] EXPR BOOL_unsigned_char_Array_0[0][0] [L48] BOOL_unsigned_char_Array_0[0][0] || (64.75f < float_Array_0[0]) [L48] EXPR float_Array_0[0] [L48] BOOL_unsigned_char_Array_0[0][0] || (64.75f < float_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L48] COND TRUE BOOL_unsigned_char_Array_0[0][0] || (64.75f < float_Array_0[0]) [L49] BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L49] COND FALSE !(BOOL_unsigned_char_Array_0[0][0]) [L52] EXPR signed_char_Array_0[3] [L52] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L52] EXPR ((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2]) [L52] EXPR signed_char_Array_0[3] [L52] EXPR ((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L52] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L52] EXPR ((((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) < (signed_char_Array_0[1])) ? (((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) : (signed_char_Array_0[1]) [L52] EXPR signed_char_Array_0[1] [L52] EXPR ((((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) < (signed_char_Array_0[1])) ? (((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) : (signed_char_Array_0[1]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L52] signed_char_Array_0[4] = ((((((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) < (signed_char_Array_0[1])) ? (((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) : (signed_char_Array_0[1]))) [L57] EXPR float_Array_0[0] [L57] EXPR float_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L57] EXPR (((float_Array_0[0] * 127.75)) > ((float_Array_0[0] / 3.4))) ? ((float_Array_0[0] * 127.75)) : ((float_Array_0[0] / 3.4)) [L57] EXPR float_Array_0[0] [L57] EXPR (((float_Array_0[0] * 127.75)) > ((float_Array_0[0] / 3.4))) ? ((float_Array_0[0] * 127.75)) : ((float_Array_0[0] / 3.4)) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L57] EXPR float_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L57] COND FALSE !((((((float_Array_0[0] * 127.75)) > ((float_Array_0[0] / 3.4))) ? ((float_Array_0[0] * 127.75)) : ((float_Array_0[0] / 3.4)))) >= float_Array_0[0]) [L98] RET step() [L99] CALL, EXPR property() [L89] EXPR BOOL_unsigned_char_Array_0[0][0] [L89] EXPR BOOL_unsigned_char_Array_0[0][0] || (64.75f < float_Array_0[0]) [L89] EXPR float_Array_0[0] [L89] EXPR BOOL_unsigned_char_Array_0[0][0] || (64.75f < float_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L89] EXPR (BOOL_unsigned_char_Array_0[0][0] || (64.75f < float_Array_0[0])) ? (BOOL_unsigned_char_Array_0[0][0] ? (signed_char_Array_0[4] == ((signed char) (signed_char_Array_0[3] - signed_char_Array_0[2]))) : (signed_char_Array_0[4] == ((signed char) ((((((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) < (signed_char_Array_0[1])) ? (((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) : (signed_char_Array_0[1])))))) : (signed_char_Array_0[4] == ((signed char) signed_char_Array_0[3])) [L89] EXPR signed_char_Array_0[4] [L89] EXPR signed_char_Array_0[3] [L89] EXPR (BOOL_unsigned_char_Array_0[0][0] || (64.75f < float_Array_0[0])) ? (BOOL_unsigned_char_Array_0[0][0] ? (signed_char_Array_0[4] == ((signed char) (signed_char_Array_0[3] - signed_char_Array_0[2]))) : (signed_char_Array_0[4] == ((signed char) ((((((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) < (signed_char_Array_0[1])) ? (((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) : (signed_char_Array_0[1])))))) : (signed_char_Array_0[4] == ((signed char) signed_char_Array_0[3])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L89] EXPR ((BOOL_unsigned_char_Array_0[0][0] || (64.75f < float_Array_0[0])) ? (BOOL_unsigned_char_Array_0[0][0] ? (signed_char_Array_0[4] == ((signed char) (signed_char_Array_0[3] - signed_char_Array_0[2]))) : (signed_char_Array_0[4] == ((signed char) ((((((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) < (signed_char_Array_0[1])) ? (((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) : (signed_char_Array_0[1])))))) : (signed_char_Array_0[4] == ((signed char) signed_char_Array_0[3]))) && (((((((float_Array_0[0] * 127.75)) > ((float_Array_0[0] / 3.4))) ? ((float_Array_0[0] * 127.75)) : ((float_Array_0[0] / 3.4)))) >= float_Array_0[0]) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_short_int_Array_0[0] - (22925 - signed_char_Array_0[2]))) < (unsigned_char_Array_0[0])) ? ((unsigned_short_int_Array_0[0] - (22925 - signed_char_Array_0[2]))) : (unsigned_char_Array_0[0]))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L89] EXPR (((BOOL_unsigned_char_Array_0[0][0] || (64.75f < float_Array_0[0])) ? (BOOL_unsigned_char_Array_0[0][0] ? (signed_char_Array_0[4] == ((signed char) (signed_char_Array_0[3] - signed_char_Array_0[2]))) : (signed_char_Array_0[4] == ((signed char) ((((((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) < (signed_char_Array_0[1])) ? (((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) : (signed_char_Array_0[1])))))) : (signed_char_Array_0[4] == ((signed char) signed_char_Array_0[3]))) && (((((((float_Array_0[0] * 127.75)) > ((float_Array_0[0] / 3.4))) ? ((float_Array_0[0] * 127.75)) : ((float_Array_0[0] / 3.4)))) >= float_Array_0[0]) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_short_int_Array_0[0] - (22925 - signed_char_Array_0[2]))) < (unsigned_char_Array_0[0])) ? ((unsigned_short_int_Array_0[0] - (22925 - signed_char_Array_0[2]))) : (unsigned_char_Array_0[0]))))) : 1)) && ((! BOOL_unsigned_char_Array_0[1][1]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) ((! BOOL_unsigned_char_Array_0[0][1]) || (! (! 0)))))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L89] EXPR ((((BOOL_unsigned_char_Array_0[0][0] || (64.75f < float_Array_0[0])) ? (BOOL_unsigned_char_Array_0[0][0] ? (signed_char_Array_0[4] == ((signed char) (signed_char_Array_0[3] - signed_char_Array_0[2]))) : (signed_char_Array_0[4] == ((signed char) ((((((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) < (signed_char_Array_0[1])) ? (((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) : (signed_char_Array_0[1])))))) : (signed_char_Array_0[4] == ((signed char) signed_char_Array_0[3]))) && (((((((float_Array_0[0] * 127.75)) > ((float_Array_0[0] / 3.4))) ? ((float_Array_0[0] * 127.75)) : ((float_Array_0[0] / 3.4)))) >= float_Array_0[0]) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_short_int_Array_0[0] - (22925 - signed_char_Array_0[2]))) < (unsigned_char_Array_0[0])) ? ((unsigned_short_int_Array_0[0] - (22925 - signed_char_Array_0[2]))) : (unsigned_char_Array_0[0]))))) : 1)) && ((! BOOL_unsigned_char_Array_0[1][1]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) ((! BOOL_unsigned_char_Array_0[0][1]) || (! (! 0))))))) && (unsigned_char_Array_0[0] == ((unsigned char) signed_char_Array_0[2])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L89] EXPR (((((BOOL_unsigned_char_Array_0[0][0] || (64.75f < float_Array_0[0])) ? (BOOL_unsigned_char_Array_0[0][0] ? (signed_char_Array_0[4] == ((signed char) (signed_char_Array_0[3] - signed_char_Array_0[2]))) : (signed_char_Array_0[4] == ((signed char) ((((((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) < (signed_char_Array_0[1])) ? (((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) : (signed_char_Array_0[1])))))) : (signed_char_Array_0[4] == ((signed char) signed_char_Array_0[3]))) && (((((((float_Array_0[0] * 127.75)) > ((float_Array_0[0] / 3.4))) ? ((float_Array_0[0] * 127.75)) : ((float_Array_0[0] / 3.4)))) >= float_Array_0[0]) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_short_int_Array_0[0] - (22925 - signed_char_Array_0[2]))) < (unsigned_char_Array_0[0])) ? ((unsigned_short_int_Array_0[0] - (22925 - signed_char_Array_0[2]))) : (unsigned_char_Array_0[0]))))) : 1)) && ((! BOOL_unsigned_char_Array_0[1][1]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) ((! BOOL_unsigned_char_Array_0[0][1]) || (! (! 0))))))) && (unsigned_char_Array_0[0] == ((unsigned char) signed_char_Array_0[2]))) && (float_Array_0[0] == ((float) float_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L89] EXPR ((((((BOOL_unsigned_char_Array_0[0][0] || (64.75f < float_Array_0[0])) ? (BOOL_unsigned_char_Array_0[0][0] ? (signed_char_Array_0[4] == ((signed char) (signed_char_Array_0[3] - signed_char_Array_0[2]))) : (signed_char_Array_0[4] == ((signed char) ((((((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) < (signed_char_Array_0[1])) ? (((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) : (signed_char_Array_0[1])))))) : (signed_char_Array_0[4] == ((signed char) signed_char_Array_0[3]))) && (((((((float_Array_0[0] * 127.75)) > ((float_Array_0[0] / 3.4))) ? ((float_Array_0[0] * 127.75)) : ((float_Array_0[0] / 3.4)))) >= float_Array_0[0]) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_short_int_Array_0[0] - (22925 - signed_char_Array_0[2]))) < (unsigned_char_Array_0[0])) ? ((unsigned_short_int_Array_0[0] - (22925 - signed_char_Array_0[2]))) : (unsigned_char_Array_0[0]))))) : 1)) && ((! BOOL_unsigned_char_Array_0[1][1]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) ((! BOOL_unsigned_char_Array_0[0][1]) || (! (! 0))))))) && (unsigned_char_Array_0[0] == ((unsigned char) signed_char_Array_0[2]))) && (float_Array_0[0] == ((float) float_Array_0[1]))) && (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[3])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L89-L90] return ((((((BOOL_unsigned_char_Array_0[0][0] || (64.75f < float_Array_0[0])) ? (BOOL_unsigned_char_Array_0[0][0] ? (signed_char_Array_0[4] == ((signed char) (signed_char_Array_0[3] - signed_char_Array_0[2]))) : (signed_char_Array_0[4] == ((signed char) ((((((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) < (signed_char_Array_0[1])) ? (((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) : (signed_char_Array_0[1])))))) : (signed_char_Array_0[4] == ((signed char) signed_char_Array_0[3]))) && (((((((float_Array_0[0] * 127.75)) > ((float_Array_0[0] / 3.4))) ? ((float_Array_0[0] * 127.75)) : ((float_Array_0[0] / 3.4)))) >= float_Array_0[0]) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_short_int_Array_0[0] - (22925 - signed_char_Array_0[2]))) < (unsigned_char_Array_0[0])) ? ((unsigned_short_int_Array_0[0] - (22925 - signed_char_Array_0[2]))) : (unsigned_char_Array_0[0]))))) : 1)) && ((! BOOL_unsigned_char_Array_0[1][1]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) ((! BOOL_unsigned_char_Array_0[0][1]) || (! (! 0))))))) && (unsigned_char_Array_0[0] == ((unsigned char) signed_char_Array_0[2]))) && (float_Array_0[0] == ((float) float_Array_0[1]))) && (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[3])) ; [L99] RET, EXPR property() [L99] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 101 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.1s, OverallIterations: 20, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2977 SdHoareTripleChecker+Valid, 5.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2973 mSDsluCounter, 7697 SdHoareTripleChecker+Invalid, 4.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5121 mSDsCounter, 243 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4170 IncrementalHoareTripleChecker+Invalid, 4413 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 243 mSolverCounterUnsat, 2576 mSDtfsCounter, 4170 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 909 GetRequests, 783 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=207occurred in iteration=16, InterpolantAutomatonStates: 127, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 19 MinimizatonAttempts, 1123 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 11.8s InterpolantComputationTime, 2646 NumberOfCodeBlocks, 2646 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 2497 ConstructedInterpolants, 1 QuantifiedInterpolants, 12120 SizeOfPredicates, 8 NumberOfNonLiveVariables, 451 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 20 InterpolantComputations, 18 PerfectInterpolantSequences, 8218/8400 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-19 07:57:04,284 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b26e8d43-442a-485a-b3d9-f0c4c82e15e7/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b26e8d43-442a-485a-b3d9-f0c4c82e15e7/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b26e8d43-442a-485a-b3d9-f0c4c82e15e7/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b26e8d43-442a-485a-b3d9-f0c4c82e15e7/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b26e8d43-442a-485a-b3d9-f0c4c82e15e7/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-24.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b26e8d43-442a-485a-b3d9-f0c4c82e15e7/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b26e8d43-442a-485a-b3d9-f0c4c82e15e7/bin/uautomizer-verify-uCwYo4JHxu --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1dbf57bc124875744eb5a4186252476f73fa3f14ae019c9a9da37b4d1a62cbf1 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:57:06,914 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:57:07,052 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b26e8d43-442a-485a-b3d9-f0c4c82e15e7/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-19 07:57:07,061 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:57:07,062 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:57:07,110 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:57:07,111 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:57:07,111 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:57:07,113 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:57:07,118 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:57:07,119 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:57:07,120 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:57:07,120 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:57:07,123 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:57:07,123 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:57:07,124 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:57:07,124 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:57:07,125 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:57:07,126 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:57:07,127 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:57:07,127 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:57:07,128 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-19 07:57:07,129 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-19 07:57:07,129 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-19 07:57:07,130 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:57:07,130 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:57:07,131 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:57:07,131 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:57:07,132 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:57:07,132 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:57:07,134 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:57:07,134 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:57:07,135 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:57:07,135 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:57:07,136 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-19 07:57:07,136 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-19 07:57:07,136 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:57:07,137 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:57:07,137 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:57:07,138 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:57:07,139 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-19 07:57:07,139 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:57:07,139 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_b26e8d43-442a-485a-b3d9-f0c4c82e15e7/bin/uautomizer-verify-uCwYo4JHxu/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b26e8d43-442a-485a-b3d9-f0c4c82e15e7/bin/uautomizer-verify-uCwYo4JHxu Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1dbf57bc124875744eb5a4186252476f73fa3f14ae019c9a9da37b4d1a62cbf1 [2023-11-19 07:57:07,568 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:57:07,599 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:57:07,602 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:57:07,604 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:57:07,604 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:57:07,605 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b26e8d43-442a-485a-b3d9-f0c4c82e15e7/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-24.i [2023-11-19 07:57:10,795 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:57:11,106 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:57:11,106 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b26e8d43-442a-485a-b3d9-f0c4c82e15e7/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-24.i [2023-11-19 07:57:11,127 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b26e8d43-442a-485a-b3d9-f0c4c82e15e7/bin/uautomizer-verify-uCwYo4JHxu/data/c1de208f7/ec6b461e10634190ba7e4eeb9a0f9ffe/FLAG331bde414 [2023-11-19 07:57:11,151 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b26e8d43-442a-485a-b3d9-f0c4c82e15e7/bin/uautomizer-verify-uCwYo4JHxu/data/c1de208f7/ec6b461e10634190ba7e4eeb9a0f9ffe [2023-11-19 07:57:11,157 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:57:11,159 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:57:11,163 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:57:11,163 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:57:11,169 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:57:11,169 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:57:11" (1/1) ... [2023-11-19 07:57:11,171 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50944a60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:57:11, skipping insertion in model container [2023-11-19 07:57:11,171 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:57:11" (1/1) ... [2023-11-19 07:57:11,215 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:57:11,438 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_b26e8d43-442a-485a-b3d9-f0c4c82e15e7/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-24.i[916,929] [2023-11-19 07:57:11,552 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:57:11,583 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:57:11,604 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_b26e8d43-442a-485a-b3d9-f0c4c82e15e7/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-24.i[916,929] [2023-11-19 07:57:11,684 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:57:11,713 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:57:11,714 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:57:11 WrapperNode [2023-11-19 07:57:11,714 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:57:11,715 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:57:11,716 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:57:11,717 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:57:11,724 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:57:11" (1/1) ... [2023-11-19 07:57:11,756 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:57:11" (1/1) ... [2023-11-19 07:57:11,878 INFO L138 Inliner]: procedures = 33, calls = 157, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 403 [2023-11-19 07:57:11,878 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:57:11,879 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:57:11,879 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:57:11,879 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:57:11,888 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:57:11" (1/1) ... [2023-11-19 07:57:11,889 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:57:11" (1/1) ... [2023-11-19 07:57:11,901 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:57:11" (1/1) ... [2023-11-19 07:57:11,902 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:57:11" (1/1) ... [2023-11-19 07:57:11,955 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:57:11" (1/1) ... [2023-11-19 07:57:11,973 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:57:11" (1/1) ... [2023-11-19 07:57:11,977 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:57:11" (1/1) ... [2023-11-19 07:57:11,981 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:57:11" (1/1) ... [2023-11-19 07:57:11,987 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:57:11,988 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:57:11,989 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:57:11,989 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:57:11,990 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:57:11" (1/1) ... [2023-11-19 07:57:11,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:57:12,014 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b26e8d43-442a-485a-b3d9-f0c4c82e15e7/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:57:12,027 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b26e8d43-442a-485a-b3d9-f0c4c82e15e7/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:57:12,065 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b26e8d43-442a-485a-b3d9-f0c4c82e15e7/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:57:12,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:57:12,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-11-19 07:57:12,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2023-11-19 07:57:12,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-19 07:57:12,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2023-11-19 07:57:12,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2023-11-19 07:57:12,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2023-11-19 07:57:12,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2023-11-19 07:57:12,094 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-19 07:57:12,096 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-19 07:57:12,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:57:12,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:57:12,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2023-11-19 07:57:12,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2023-11-19 07:57:12,237 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:57:12,239 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:57:22,844 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:57:22,861 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:57:22,862 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-19 07:57:22,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:57:22 BoogieIcfgContainer [2023-11-19 07:57:22,870 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:57:22,873 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:57:22,874 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:57:22,877 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:57:22,878 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:57:11" (1/3) ... [2023-11-19 07:57:22,879 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@508f642a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:57:22, skipping insertion in model container [2023-11-19 07:57:22,879 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:57:11" (2/3) ... [2023-11-19 07:57:22,882 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@508f642a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:57:22, skipping insertion in model container [2023-11-19 07:57:22,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:57:22" (3/3) ... [2023-11-19 07:57:22,884 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-24.i [2023-11-19 07:57:22,906 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:57:22,908 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 07:57:22,983 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:57:22,990 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;@74199d67, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:57:22,991 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-19 07:57:22,998 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 83 states have (on average 1.3975903614457832) internal successors, (116), 84 states have internal predecessors, (116), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-19 07:57:23,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-19 07:57:23,022 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:57:23,024 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:57:23,024 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:57:23,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:57:23,033 INFO L85 PathProgramCache]: Analyzing trace with hash 517644707, now seen corresponding path program 1 times [2023-11-19 07:57:23,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-19 07:57:23,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [355672468] [2023-11-19 07:57:23,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:57:23,061 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-19 07:57:23,061 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b26e8d43-442a-485a-b3d9-f0c4c82e15e7/bin/uautomizer-verify-uCwYo4JHxu/mathsat [2023-11-19 07:57:23,068 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b26e8d43-442a-485a-b3d9-f0c4c82e15e7/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-19 07:57:23,075 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b26e8d43-442a-485a-b3d9-f0c4c82e15e7/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-19 07:57:24,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:24,666 INFO L262 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-19 07:57:24,680 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:57:24,729 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2023-11-19 07:57:24,729 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 07:57:24,730 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-19 07:57:24,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [355672468] [2023-11-19 07:57:24,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [355672468] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:57:24,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:57:24,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:57:24,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317497695] [2023-11-19 07:57:24,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:57:24,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 07:57:24,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-19 07:57:24,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 07:57:24,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 07:57:24,776 INFO L87 Difference]: Start difference. First operand has 101 states, 83 states have (on average 1.3975903614457832) internal successors, (116), 84 states have internal predecessors, (116), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-19 07:57:24,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:57:24,813 INFO L93 Difference]: Finished difference Result 195 states and 301 transitions. [2023-11-19 07:57:24,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 07:57:24,816 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 124 [2023-11-19 07:57:24,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:57:24,825 INFO L225 Difference]: With dead ends: 195 [2023-11-19 07:57:24,825 INFO L226 Difference]: Without dead ends: 97 [2023-11-19 07:57:24,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 07:57:24,833 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:57:24,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:57:24,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-11-19 07:57:24,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2023-11-19 07:57:24,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 80 states have (on average 1.3625) internal successors, (109), 80 states have internal predecessors, (109), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-19 07:57:24,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 139 transitions. [2023-11-19 07:57:24,882 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 139 transitions. Word has length 124 [2023-11-19 07:57:24,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:57:24,883 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 139 transitions. [2023-11-19 07:57:24,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-19 07:57:24,883 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 139 transitions. [2023-11-19 07:57:24,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-19 07:57:24,887 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:57:24,887 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:57:24,903 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b26e8d43-442a-485a-b3d9-f0c4c82e15e7/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-11-19 07:57:25,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b26e8d43-442a-485a-b3d9-f0c4c82e15e7/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-19 07:57:25,089 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:57:25,089 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:57:25,089 INFO L85 PathProgramCache]: Analyzing trace with hash -94639779, now seen corresponding path program 1 times [2023-11-19 07:57:25,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-19 07:57:25,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1129388703] [2023-11-19 07:57:25,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:57:25,091 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-19 07:57:25,092 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b26e8d43-442a-485a-b3d9-f0c4c82e15e7/bin/uautomizer-verify-uCwYo4JHxu/mathsat [2023-11-19 07:57:25,093 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b26e8d43-442a-485a-b3d9-f0c4c82e15e7/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-19 07:57:25,095 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b26e8d43-442a-485a-b3d9-f0c4c82e15e7/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process