./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/openssl-simplified/s3_clnt_2.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a 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_69f8b60b-1233-4764-b302-98ae0d411066/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69f8b60b-1233-4764-b302-98ae0d411066/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69f8b60b-1233-4764-b302-98ae0d411066/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69f8b60b-1233-4764-b302-98ae0d411066/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/openssl-simplified/s3_clnt_2.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69f8b60b-1233-4764-b302-98ae0d411066/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69f8b60b-1233-4764-b302-98ae0d411066/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e8a8eb6c750c607e2f549ecc5582c4aebf9571fc15330f2a7e0973b7c96cc082 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:43:46,894 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:43:46,896 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:43:46,944 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:43:46,945 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:43:46,946 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:43:46,948 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:43:46,950 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:43:46,952 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:43:46,953 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:43:46,959 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:43:46,964 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:43:46,965 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:43:46,971 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:43:46,976 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:43:46,979 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:43:46,981 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:43:46,983 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:43:46,985 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:43:46,993 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:43:46,995 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:43:46,997 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:43:47,001 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:43:47,002 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:43:47,011 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:43:47,012 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:43:47,012 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:43:47,014 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:43:47,015 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:43:47,017 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:43:47,019 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:43:47,020 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:43:47,022 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:43:47,024 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:43:47,025 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:43:47,026 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:43:47,027 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:43:47,027 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:43:47,028 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:43:47,029 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:43:47,030 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:43:47,031 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69f8b60b-1233-4764-b302-98ae0d411066/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:43:47,078 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:43:47,078 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:43:47,079 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:43:47,079 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:43:47,080 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:43:47,081 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:43:47,082 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:43:47,082 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:43:47,083 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:43:47,083 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:43:47,085 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:43:47,085 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:43:47,085 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:43:47,086 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:43:47,086 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:43:47,086 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:43:47,087 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:43:47,087 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:43:47,087 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:43:47,088 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:43:47,088 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:43:47,088 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:43:47,089 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:43:47,089 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:43:47,089 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:43:47,090 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:43:47,090 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:43:47,091 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:43:47,091 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:43:47,091 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:43:47,092 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:43:47,092 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:43:47,092 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:43:47,093 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_69f8b60b-1233-4764-b302-98ae0d411066/bin/uautomizer-Dbtcem3rbc/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_69f8b60b-1233-4764-b302-98ae0d411066/bin/uautomizer-Dbtcem3rbc Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e8a8eb6c750c607e2f549ecc5582c4aebf9571fc15330f2a7e0973b7c96cc082 [2022-11-02 20:43:47,451 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:43:47,477 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:43:47,480 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:43:47,482 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:43:47,483 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:43:47,484 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69f8b60b-1233-4764-b302-98ae0d411066/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/openssl-simplified/s3_clnt_2.cil-2.c [2022-11-02 20:43:47,568 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69f8b60b-1233-4764-b302-98ae0d411066/bin/uautomizer-Dbtcem3rbc/data/b4174dbc2/67e09dc71fa64696812d265b3b362def/FLAG370584d00 [2022-11-02 20:43:48,166 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:43:48,168 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69f8b60b-1233-4764-b302-98ae0d411066/sv-benchmarks/c/openssl-simplified/s3_clnt_2.cil-2.c [2022-11-02 20:43:48,188 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69f8b60b-1233-4764-b302-98ae0d411066/bin/uautomizer-Dbtcem3rbc/data/b4174dbc2/67e09dc71fa64696812d265b3b362def/FLAG370584d00 [2022-11-02 20:43:48,443 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69f8b60b-1233-4764-b302-98ae0d411066/bin/uautomizer-Dbtcem3rbc/data/b4174dbc2/67e09dc71fa64696812d265b3b362def [2022-11-02 20:43:48,449 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:43:48,451 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:43:48,458 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:43:48,458 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:43:48,462 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:43:48,463 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:43:48" (1/1) ... [2022-11-02 20:43:48,466 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13786098 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:43:48, skipping insertion in model container [2022-11-02 20:43:48,466 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:43:48" (1/1) ... [2022-11-02 20:43:48,475 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:43:48,534 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:43:48,872 WARN L230 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_69f8b60b-1233-4764-b302-98ae0d411066/sv-benchmarks/c/openssl-simplified/s3_clnt_2.cil-2.c[35827,35840] [2022-11-02 20:43:48,890 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:43:48,899 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:43:48,968 WARN L230 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_69f8b60b-1233-4764-b302-98ae0d411066/sv-benchmarks/c/openssl-simplified/s3_clnt_2.cil-2.c[35827,35840] [2022-11-02 20:43:48,971 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:43:48,990 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:43:48,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:43:48 WrapperNode [2022-11-02 20:43:48,991 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:43:48,992 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:43:48,993 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:43:48,993 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:43:49,000 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:43:48" (1/1) ... [2022-11-02 20:43:49,019 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:43:48" (1/1) ... [2022-11-02 20:43:49,058 INFO L138 Inliner]: procedures = 15, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 504 [2022-11-02 20:43:49,059 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:43:49,060 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:43:49,060 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:43:49,060 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:43:49,069 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:43:48" (1/1) ... [2022-11-02 20:43:49,069 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:43:48" (1/1) ... [2022-11-02 20:43:49,073 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:43:48" (1/1) ... [2022-11-02 20:43:49,073 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:43:48" (1/1) ... [2022-11-02 20:43:49,080 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:43:48" (1/1) ... [2022-11-02 20:43:49,086 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:43:48" (1/1) ... [2022-11-02 20:43:49,088 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:43:48" (1/1) ... [2022-11-02 20:43:49,090 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:43:48" (1/1) ... [2022-11-02 20:43:49,094 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:43:49,095 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:43:49,095 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:43:49,095 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:43:49,098 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:43:48" (1/1) ... [2022-11-02 20:43:49,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:43:49,133 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69f8b60b-1233-4764-b302-98ae0d411066/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:49,145 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69f8b60b-1233-4764-b302-98ae0d411066/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:43:49,156 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69f8b60b-1233-4764-b302-98ae0d411066/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:43:49,218 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:43:49,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:43:49,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:43:49,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:43:49,391 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:43:49,393 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:43:49,409 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:43:50,124 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-11-02 20:43:50,125 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-11-02 20:43:50,126 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:43:50,137 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:43:50,143 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-02 20:43:50,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:43:50 BoogieIcfgContainer [2022-11-02 20:43:50,147 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:43:50,150 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:43:50,151 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:43:50,155 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:43:50,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:43:48" (1/3) ... [2022-11-02 20:43:50,157 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eaf3218 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:43:50, skipping insertion in model container [2022-11-02 20:43:50,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:43:48" (2/3) ... [2022-11-02 20:43:50,158 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eaf3218 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:43:50, skipping insertion in model container [2022-11-02 20:43:50,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:43:50" (3/3) ... [2022-11-02 20:43:50,159 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_2.cil-2.c [2022-11-02 20:43:50,184 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:43:50,184 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 20:43:50,265 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:43:50,273 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@9961526, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:43:50,273 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 20:43:50,279 INFO L276 IsEmpty]: Start isEmpty. Operand has 128 states, 126 states have (on average 1.7142857142857142) internal successors, (216), 127 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:43:50,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-02 20:43:50,287 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:50,288 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:50,289 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:43:50,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:50,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1457695038, now seen corresponding path program 1 times [2022-11-02 20:43:50,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:50,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146378463] [2022-11-02 20:43:50,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:50,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:50,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:50,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:43:50,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:50,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146378463] [2022-11-02 20:43:50,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146378463] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:50,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:43:50,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:43:50,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479207624] [2022-11-02 20:43:50,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:50,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:43:50,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:50,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:43:50,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:43:50,753 INFO L87 Difference]: Start difference. First operand has 128 states, 126 states have (on average 1.7142857142857142) internal successors, (216), 127 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:43:50,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:50,918 INFO L93 Difference]: Finished difference Result 252 states and 427 transitions. [2022-11-02 20:43:50,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:43:50,921 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-02 20:43:50,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:50,933 INFO L225 Difference]: With dead ends: 252 [2022-11-02 20:43:50,933 INFO L226 Difference]: Without dead ends: 115 [2022-11-02 20:43:50,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:43:50,942 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 7 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:50,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 325 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:43:50,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-11-02 20:43:50,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2022-11-02 20:43:50,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 114 states have (on average 1.5087719298245614) internal successors, (172), 114 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:43:50,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 172 transitions. [2022-11-02 20:43:50,987 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 172 transitions. Word has length 24 [2022-11-02 20:43:50,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:50,988 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 172 transitions. [2022-11-02 20:43:50,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:43:50,989 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 172 transitions. [2022-11-02 20:43:50,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-02 20:43:50,990 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:50,990 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:50,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:43:50,991 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:43:50,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:50,992 INFO L85 PathProgramCache]: Analyzing trace with hash 561717339, now seen corresponding path program 1 times [2022-11-02 20:43:50,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:50,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256874122] [2022-11-02 20:43:50,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:50,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:51,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:51,142 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:43:51,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:51,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256874122] [2022-11-02 20:43:51,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256874122] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:51,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:43:51,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:43:51,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475539060] [2022-11-02 20:43:51,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:51,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:43:51,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:51,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:43:51,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:43:51,149 INFO L87 Difference]: Start difference. First operand 115 states and 172 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:43:51,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:51,305 INFO L93 Difference]: Finished difference Result 239 states and 362 transitions. [2022-11-02 20:43:51,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:43:51,306 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-11-02 20:43:51,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:51,308 INFO L225 Difference]: With dead ends: 239 [2022-11-02 20:43:51,308 INFO L226 Difference]: Without dead ends: 134 [2022-11-02 20:43:51,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:43:51,310 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 15 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:51,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 244 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:43:51,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-11-02 20:43:51,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 130. [2022-11-02 20:43:51,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 1.4883720930232558) internal successors, (192), 129 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:43:51,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 192 transitions. [2022-11-02 20:43:51,342 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 192 transitions. Word has length 37 [2022-11-02 20:43:51,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:51,342 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 192 transitions. [2022-11-02 20:43:51,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:43:51,343 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 192 transitions. [2022-11-02 20:43:51,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-02 20:43:51,344 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:51,345 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:51,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:43:51,345 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:43:51,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:51,346 INFO L85 PathProgramCache]: Analyzing trace with hash 684962052, now seen corresponding path program 1 times [2022-11-02 20:43:51,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:51,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693491518] [2022-11-02 20:43:51,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:51,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:51,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:51,491 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:43:51,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:51,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693491518] [2022-11-02 20:43:51,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693491518] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:51,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:43:51,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:43:51,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128576309] [2022-11-02 20:43:51,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:51,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:43:51,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:51,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:43:51,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:43:51,499 INFO L87 Difference]: Start difference. First operand 130 states and 192 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:43:51,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:51,673 INFO L93 Difference]: Finished difference Result 271 states and 406 transitions. [2022-11-02 20:43:51,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:43:51,674 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-11-02 20:43:51,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:51,676 INFO L225 Difference]: With dead ends: 271 [2022-11-02 20:43:51,676 INFO L226 Difference]: Without dead ends: 151 [2022-11-02 20:43:51,677 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:43:51,678 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 15 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:51,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 257 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:43:51,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-11-02 20:43:51,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 147. [2022-11-02 20:43:51,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 146 states have (on average 1.4657534246575343) internal successors, (214), 146 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:43:51,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 214 transitions. [2022-11-02 20:43:51,706 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 214 transitions. Word has length 51 [2022-11-02 20:43:51,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:51,707 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 214 transitions. [2022-11-02 20:43:51,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:43:51,708 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 214 transitions. [2022-11-02 20:43:51,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-02 20:43:51,710 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:51,719 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:51,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:43:51,720 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:43:51,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:51,721 INFO L85 PathProgramCache]: Analyzing trace with hash -184561774, now seen corresponding path program 1 times [2022-11-02 20:43:51,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:51,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930414325] [2022-11-02 20:43:51,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:51,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:51,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:51,909 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-02 20:43:51,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:51,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930414325] [2022-11-02 20:43:51,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930414325] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:51,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:43:51,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:43:51,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613326156] [2022-11-02 20:43:51,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:51,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:43:51,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:51,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:43:51,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:43:51,913 INFO L87 Difference]: Start difference. First operand 147 states and 214 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:43:52,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:52,134 INFO L93 Difference]: Finished difference Result 335 states and 503 transitions. [2022-11-02 20:43:52,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:43:52,135 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2022-11-02 20:43:52,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:52,143 INFO L225 Difference]: With dead ends: 335 [2022-11-02 20:43:52,143 INFO L226 Difference]: Without dead ends: 197 [2022-11-02 20:43:52,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:43:52,152 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 53 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:52,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 231 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:43:52,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-11-02 20:43:52,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 188. [2022-11-02 20:43:52,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 187 states have (on average 1.411764705882353) internal successors, (264), 187 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:43:52,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 264 transitions. [2022-11-02 20:43:52,172 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 264 transitions. Word has length 68 [2022-11-02 20:43:52,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:52,173 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 264 transitions. [2022-11-02 20:43:52,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:43:52,173 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 264 transitions. [2022-11-02 20:43:52,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-02 20:43:52,175 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:52,176 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:52,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:43:52,176 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:43:52,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:52,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1990000108, now seen corresponding path program 1 times [2022-11-02 20:43:52,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:52,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478453970] [2022-11-02 20:43:52,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:52,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:52,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:52,281 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-02 20:43:52,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:52,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478453970] [2022-11-02 20:43:52,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478453970] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:52,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:43:52,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:43:52,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957613010] [2022-11-02 20:43:52,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:52,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:43:52,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:52,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:43:52,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:43:52,285 INFO L87 Difference]: Start difference. First operand 188 states and 264 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:43:52,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:52,435 INFO L93 Difference]: Finished difference Result 390 states and 555 transitions. [2022-11-02 20:43:52,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:43:52,436 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2022-11-02 20:43:52,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:52,437 INFO L225 Difference]: With dead ends: 390 [2022-11-02 20:43:52,438 INFO L226 Difference]: Without dead ends: 212 [2022-11-02 20:43:52,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:43:52,448 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 16 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:52,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 262 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:43:52,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-11-02 20:43:52,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 207. [2022-11-02 20:43:52,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 206 states have (on average 1.3980582524271845) internal successors, (288), 206 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:43:52,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 288 transitions. [2022-11-02 20:43:52,475 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 288 transitions. Word has length 68 [2022-11-02 20:43:52,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:52,483 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 288 transitions. [2022-11-02 20:43:52,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:43:52,483 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 288 transitions. [2022-11-02 20:43:52,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-11-02 20:43:52,493 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:52,493 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:52,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:43:52,494 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:43:52,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:52,495 INFO L85 PathProgramCache]: Analyzing trace with hash -843012112, now seen corresponding path program 1 times [2022-11-02 20:43:52,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:52,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846036775] [2022-11-02 20:43:52,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:52,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:52,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:52,566 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-11-02 20:43:52,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:52,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846036775] [2022-11-02 20:43:52,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846036775] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:52,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:43:52,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:43:52,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984762156] [2022-11-02 20:43:52,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:52,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:43:52,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:52,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:43:52,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:43:52,569 INFO L87 Difference]: Start difference. First operand 207 states and 288 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:43:52,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:52,694 INFO L93 Difference]: Finished difference Result 428 states and 604 transitions. [2022-11-02 20:43:52,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:43:52,695 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2022-11-02 20:43:52,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:52,697 INFO L225 Difference]: With dead ends: 428 [2022-11-02 20:43:52,697 INFO L226 Difference]: Without dead ends: 231 [2022-11-02 20:43:52,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:43:52,698 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 13 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:52,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 261 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:43:52,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-11-02 20:43:52,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 228. [2022-11-02 20:43:52,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 227 states have (on average 1.3832599118942732) internal successors, (314), 227 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:43:52,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 314 transitions. [2022-11-02 20:43:52,718 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 314 transitions. Word has length 85 [2022-11-02 20:43:52,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:52,719 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 314 transitions. [2022-11-02 20:43:52,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:43:52,719 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 314 transitions. [2022-11-02 20:43:52,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-11-02 20:43:52,720 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:52,721 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:52,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:43:52,721 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:43:52,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:52,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1725839848, now seen corresponding path program 1 times [2022-11-02 20:43:52,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:52,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399132366] [2022-11-02 20:43:52,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:52,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:52,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:52,822 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-02 20:43:52,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:52,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399132366] [2022-11-02 20:43:52,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399132366] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:52,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:43:52,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:43:52,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481132231] [2022-11-02 20:43:52,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:52,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:43:52,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:52,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:43:52,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:43:52,825 INFO L87 Difference]: Start difference. First operand 228 states and 314 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:43:52,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:52,866 INFO L93 Difference]: Finished difference Result 661 states and 912 transitions. [2022-11-02 20:43:52,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:43:52,867 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-11-02 20:43:52,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:52,870 INFO L225 Difference]: With dead ends: 661 [2022-11-02 20:43:52,870 INFO L226 Difference]: Without dead ends: 443 [2022-11-02 20:43:52,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:43:52,871 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 125 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:52,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 363 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:43:52,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2022-11-02 20:43:52,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 443. [2022-11-02 20:43:52,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 442 states have (on average 1.3710407239819005) internal successors, (606), 442 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:43:52,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 606 transitions. [2022-11-02 20:43:52,888 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 606 transitions. Word has length 105 [2022-11-02 20:43:52,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:52,889 INFO L495 AbstractCegarLoop]: Abstraction has 443 states and 606 transitions. [2022-11-02 20:43:52,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:43:52,889 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 606 transitions. [2022-11-02 20:43:52,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-11-02 20:43:52,891 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:52,891 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:52,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:43:52,892 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:43:52,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:52,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1889855194, now seen corresponding path program 1 times [2022-11-02 20:43:52,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:52,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465561932] [2022-11-02 20:43:52,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:52,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:52,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:52,955 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-11-02 20:43:52,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:52,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465561932] [2022-11-02 20:43:52,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465561932] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:52,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:43:52,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:43:52,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246867748] [2022-11-02 20:43:52,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:52,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:43:52,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:52,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:43:52,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:43:52,959 INFO L87 Difference]: Start difference. First operand 443 states and 606 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:43:52,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:52,992 INFO L93 Difference]: Finished difference Result 897 states and 1226 transitions. [2022-11-02 20:43:52,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:43:52,993 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-11-02 20:43:52,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:52,995 INFO L225 Difference]: With dead ends: 897 [2022-11-02 20:43:52,996 INFO L226 Difference]: Without dead ends: 464 [2022-11-02 20:43:52,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:43:52,998 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 11 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:52,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 343 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:43:52,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2022-11-02 20:43:53,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 464. [2022-11-02 20:43:53,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 463 states have (on average 1.367170626349892) internal successors, (633), 463 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:43:53,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 633 transitions. [2022-11-02 20:43:53,020 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 633 transitions. Word has length 105 [2022-11-02 20:43:53,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:53,022 INFO L495 AbstractCegarLoop]: Abstraction has 464 states and 633 transitions. [2022-11-02 20:43:53,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:43:53,023 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 633 transitions. [2022-11-02 20:43:53,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-11-02 20:43:53,033 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:53,034 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:53,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:43:53,034 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:43:53,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:53,035 INFO L85 PathProgramCache]: Analyzing trace with hash -810746188, now seen corresponding path program 1 times [2022-11-02 20:43:53,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:53,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179696641] [2022-11-02 20:43:53,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:53,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:53,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:53,141 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2022-11-02 20:43:53,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:53,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179696641] [2022-11-02 20:43:53,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179696641] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:53,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:43:53,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:43:53,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044183552] [2022-11-02 20:43:53,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:53,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:43:53,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:53,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:43:53,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:43:53,150 INFO L87 Difference]: Start difference. First operand 464 states and 633 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:43:53,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:53,185 INFO L93 Difference]: Finished difference Result 945 states and 1287 transitions. [2022-11-02 20:43:53,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:43:53,186 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2022-11-02 20:43:53,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:53,189 INFO L225 Difference]: With dead ends: 945 [2022-11-02 20:43:53,189 INFO L226 Difference]: Without dead ends: 491 [2022-11-02 20:43:53,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:43:53,193 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 20 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:53,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 315 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:43:53,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2022-11-02 20:43:53,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 491. [2022-11-02 20:43:53,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 490 states have (on average 1.3612244897959183) internal successors, (667), 490 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:43:53,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 667 transitions. [2022-11-02 20:43:53,225 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 667 transitions. Word has length 106 [2022-11-02 20:43:53,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:53,225 INFO L495 AbstractCegarLoop]: Abstraction has 491 states and 667 transitions. [2022-11-02 20:43:53,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:43:53,226 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 667 transitions. [2022-11-02 20:43:53,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-11-02 20:43:53,228 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:53,228 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:53,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:43:53,229 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:43:53,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:53,236 INFO L85 PathProgramCache]: Analyzing trace with hash 625791090, now seen corresponding path program 1 times [2022-11-02 20:43:53,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:53,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915749605] [2022-11-02 20:43:53,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:53,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:53,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:53,349 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-11-02 20:43:53,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:53,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915749605] [2022-11-02 20:43:53,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915749605] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:53,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:43:53,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:43:53,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626277627] [2022-11-02 20:43:53,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:53,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:43:53,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:53,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:43:53,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:43:53,356 INFO L87 Difference]: Start difference. First operand 491 states and 667 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:43:53,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:53,409 INFO L93 Difference]: Finished difference Result 709 states and 967 transitions. [2022-11-02 20:43:53,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:43:53,410 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2022-11-02 20:43:53,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:53,415 INFO L225 Difference]: With dead ends: 709 [2022-11-02 20:43:53,415 INFO L226 Difference]: Without dead ends: 707 [2022-11-02 20:43:53,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:43:53,417 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 139 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:53,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 305 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:43:53,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2022-11-02 20:43:53,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 707. [2022-11-02 20:43:53,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 706 states have (on average 1.36685552407932) internal successors, (965), 706 states have internal predecessors, (965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:43:53,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 965 transitions. [2022-11-02 20:43:53,449 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 965 transitions. Word has length 107 [2022-11-02 20:43:53,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:53,450 INFO L495 AbstractCegarLoop]: Abstraction has 707 states and 965 transitions. [2022-11-02 20:43:53,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:43:53,450 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 965 transitions. [2022-11-02 20:43:53,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-11-02 20:43:53,457 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:53,457 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:53,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:43:53,462 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:43:53,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:53,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1290635395, now seen corresponding path program 1 times [2022-11-02 20:43:53,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:53,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154322899] [2022-11-02 20:43:53,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:53,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:53,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:53,597 INFO L134 CoverageAnalysis]: Checked inductivity of 471 backedges. 311 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2022-11-02 20:43:53,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:53,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154322899] [2022-11-02 20:43:53,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154322899] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:53,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:43:53,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:43:53,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17015821] [2022-11-02 20:43:53,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:53,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:43:53,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:53,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:43:53,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:43:53,601 INFO L87 Difference]: Start difference. First operand 707 states and 965 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:43:53,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:53,817 INFO L93 Difference]: Finished difference Result 1530 states and 2149 transitions. [2022-11-02 20:43:53,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:43:53,817 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 176 [2022-11-02 20:43:53,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:53,823 INFO L225 Difference]: With dead ends: 1530 [2022-11-02 20:43:53,829 INFO L226 Difference]: Without dead ends: 857 [2022-11-02 20:43:53,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:43:53,831 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 97 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:53,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 196 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:43:53,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2022-11-02 20:43:53,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 824. [2022-11-02 20:43:53,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 824 states, 823 states have (on average 1.402187120291616) internal successors, (1154), 823 states have internal predecessors, (1154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:43:53,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 1154 transitions. [2022-11-02 20:43:53,859 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 1154 transitions. Word has length 176 [2022-11-02 20:43:53,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:53,863 INFO L495 AbstractCegarLoop]: Abstraction has 824 states and 1154 transitions. [2022-11-02 20:43:53,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:43:53,863 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 1154 transitions. [2022-11-02 20:43:53,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-11-02 20:43:53,867 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:53,867 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 9, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:53,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:43:53,867 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:43:53,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:53,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1154586908, now seen corresponding path program 2 times [2022-11-02 20:43:53,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:53,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657586168] [2022-11-02 20:43:53,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:53,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:53,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:54,005 INFO L134 CoverageAnalysis]: Checked inductivity of 527 backedges. 327 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2022-11-02 20:43:54,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:54,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657586168] [2022-11-02 20:43:54,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657586168] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:54,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:43:54,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:43:54,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767089643] [2022-11-02 20:43:54,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:54,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:43:54,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:54,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:43:54,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:43:54,009 INFO L87 Difference]: Start difference. First operand 824 states and 1154 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:43:54,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:54,201 INFO L93 Difference]: Finished difference Result 1892 states and 2730 transitions. [2022-11-02 20:43:54,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:43:54,201 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 189 [2022-11-02 20:43:54,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:54,206 INFO L225 Difference]: With dead ends: 1892 [2022-11-02 20:43:54,206 INFO L226 Difference]: Without dead ends: 1054 [2022-11-02 20:43:54,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:43:54,209 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 96 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:54,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 203 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:43:54,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2022-11-02 20:43:54,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 1013. [2022-11-02 20:43:54,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1013 states, 1012 states have (on average 1.3893280632411067) internal successors, (1406), 1012 states have internal predecessors, (1406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:43:54,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 1406 transitions. [2022-11-02 20:43:54,249 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 1406 transitions. Word has length 189 [2022-11-02 20:43:54,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:54,250 INFO L495 AbstractCegarLoop]: Abstraction has 1013 states and 1406 transitions. [2022-11-02 20:43:54,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:43:54,250 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1406 transitions. [2022-11-02 20:43:54,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2022-11-02 20:43:54,254 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:54,256 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:54,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:43:54,256 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:43:54,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:54,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1143144718, now seen corresponding path program 1 times [2022-11-02 20:43:54,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:54,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356807695] [2022-11-02 20:43:54,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:54,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:54,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:54,389 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 404 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2022-11-02 20:43:54,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:54,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356807695] [2022-11-02 20:43:54,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356807695] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:54,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:43:54,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:43:54,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168445664] [2022-11-02 20:43:54,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:54,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:43:54,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:54,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:43:54,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:43:54,393 INFO L87 Difference]: Start difference. First operand 1013 states and 1406 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:43:54,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:54,592 INFO L93 Difference]: Finished difference Result 2148 states and 3007 transitions. [2022-11-02 20:43:54,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:43:54,593 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 210 [2022-11-02 20:43:54,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:54,598 INFO L225 Difference]: With dead ends: 2148 [2022-11-02 20:43:54,599 INFO L226 Difference]: Without dead ends: 1127 [2022-11-02 20:43:54,601 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:43:54,603 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 99 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:54,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 199 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:43:54,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1127 states. [2022-11-02 20:43:54,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1127 to 1088. [2022-11-02 20:43:54,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1088 states, 1087 states have (on average 1.3817847286108556) internal successors, (1502), 1087 states have internal predecessors, (1502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:43:54,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1502 transitions. [2022-11-02 20:43:54,646 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1502 transitions. Word has length 210 [2022-11-02 20:43:54,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:54,647 INFO L495 AbstractCegarLoop]: Abstraction has 1088 states and 1502 transitions. [2022-11-02 20:43:54,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:43:54,647 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1502 transitions. [2022-11-02 20:43:54,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2022-11-02 20:43:54,652 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:54,652 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 11, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:54,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:43:54,653 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:43:54,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:54,654 INFO L85 PathProgramCache]: Analyzing trace with hash 455987487, now seen corresponding path program 1 times [2022-11-02 20:43:54,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:54,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988652696] [2022-11-02 20:43:54,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:54,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:54,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:54,805 INFO L134 CoverageAnalysis]: Checked inductivity of 807 backedges. 479 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2022-11-02 20:43:54,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:54,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988652696] [2022-11-02 20:43:54,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988652696] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:54,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:43:54,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:43:54,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936941721] [2022-11-02 20:43:54,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:54,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:43:54,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:54,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:43:54,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:43:54,809 INFO L87 Difference]: Start difference. First operand 1088 states and 1502 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:43:55,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:55,029 INFO L93 Difference]: Finished difference Result 2298 states and 3196 transitions. [2022-11-02 20:43:55,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:43:55,030 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 234 [2022-11-02 20:43:55,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:55,035 INFO L225 Difference]: With dead ends: 2298 [2022-11-02 20:43:55,036 INFO L226 Difference]: Without dead ends: 1208 [2022-11-02 20:43:55,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:43:55,038 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 100 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:55,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 197 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:43:55,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2022-11-02 20:43:55,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 1172. [2022-11-02 20:43:55,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1172 states, 1171 states have (on average 1.3774551665243382) internal successors, (1613), 1171 states have internal predecessors, (1613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:43:55,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1172 states to 1172 states and 1613 transitions. [2022-11-02 20:43:55,086 INFO L78 Accepts]: Start accepts. Automaton has 1172 states and 1613 transitions. Word has length 234 [2022-11-02 20:43:55,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:55,087 INFO L495 AbstractCegarLoop]: Abstraction has 1172 states and 1613 transitions. [2022-11-02 20:43:55,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:43:55,087 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 1613 transitions. [2022-11-02 20:43:55,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2022-11-02 20:43:55,091 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:55,092 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 11, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:55,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:43:55,092 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:43:55,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:55,093 INFO L85 PathProgramCache]: Analyzing trace with hash 574428961, now seen corresponding path program 1 times [2022-11-02 20:43:55,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:55,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77117844] [2022-11-02 20:43:55,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:55,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:55,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:55,228 INFO L134 CoverageAnalysis]: Checked inductivity of 807 backedges. 479 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2022-11-02 20:43:55,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:55,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77117844] [2022-11-02 20:43:55,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77117844] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:55,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:43:55,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:43:55,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165534262] [2022-11-02 20:43:55,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:55,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:43:55,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:55,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:43:55,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:43:55,231 INFO L87 Difference]: Start difference. First operand 1172 states and 1613 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:43:55,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:55,450 INFO L93 Difference]: Finished difference Result 2466 states and 3421 transitions. [2022-11-02 20:43:55,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:43:55,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 234 [2022-11-02 20:43:55,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:55,457 INFO L225 Difference]: With dead ends: 2466 [2022-11-02 20:43:55,457 INFO L226 Difference]: Without dead ends: 1304 [2022-11-02 20:43:55,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:43:55,462 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 102 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:55,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 195 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:43:55,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1304 states. [2022-11-02 20:43:55,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1304 to 1265. [2022-11-02 20:43:55,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1265 states, 1264 states have (on average 1.3805379746835442) internal successors, (1745), 1264 states have internal predecessors, (1745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:43:55,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1265 states and 1745 transitions. [2022-11-02 20:43:55,555 INFO L78 Accepts]: Start accepts. Automaton has 1265 states and 1745 transitions. Word has length 234 [2022-11-02 20:43:55,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:55,556 INFO L495 AbstractCegarLoop]: Abstraction has 1265 states and 1745 transitions. [2022-11-02 20:43:55,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:43:55,557 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 1745 transitions. [2022-11-02 20:43:55,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2022-11-02 20:43:55,563 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:55,564 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 12, 12, 12, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:55,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:43:55,564 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:43:55,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:55,565 INFO L85 PathProgramCache]: Analyzing trace with hash 172133823, now seen corresponding path program 1 times [2022-11-02 20:43:55,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:55,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907328165] [2022-11-02 20:43:55,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:55,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:55,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:55,725 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 622 proven. 0 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2022-11-02 20:43:55,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:55,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907328165] [2022-11-02 20:43:55,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907328165] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:55,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:43:55,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:43:55,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533489097] [2022-11-02 20:43:55,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:55,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:43:55,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:55,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:43:55,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:43:55,731 INFO L87 Difference]: Start difference. First operand 1265 states and 1745 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:43:55,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:55,821 INFO L93 Difference]: Finished difference Result 3718 states and 5136 transitions. [2022-11-02 20:43:55,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:43:55,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 264 [2022-11-02 20:43:55,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:55,832 INFO L225 Difference]: With dead ends: 3718 [2022-11-02 20:43:55,832 INFO L226 Difference]: Without dead ends: 2490 [2022-11-02 20:43:55,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:43:55,835 INFO L413 NwaCegarLoop]: 319 mSDtfsCounter, 127 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 483 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 [2022-11-02 20:43:55,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 483 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:43:55,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2490 states. [2022-11-02 20:43:55,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2490 to 2488. [2022-11-02 20:43:55,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2488 states, 2487 states have (on average 1.3811821471652594) internal successors, (3435), 2487 states have internal predecessors, (3435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:43:55,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2488 states to 2488 states and 3435 transitions. [2022-11-02 20:43:55,989 INFO L78 Accepts]: Start accepts. Automaton has 2488 states and 3435 transitions. Word has length 264 [2022-11-02 20:43:55,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:55,990 INFO L495 AbstractCegarLoop]: Abstraction has 2488 states and 3435 transitions. [2022-11-02 20:43:55,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:43:55,990 INFO L276 IsEmpty]: Start isEmpty. Operand 2488 states and 3435 transitions. [2022-11-02 20:43:55,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2022-11-02 20:43:55,997 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:55,998 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 12, 12, 12, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:55,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:43:55,998 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:43:55,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:55,999 INFO L85 PathProgramCache]: Analyzing trace with hash 290575297, now seen corresponding path program 1 times [2022-11-02 20:43:55,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:55,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128984504] [2022-11-02 20:43:56,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:56,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:56,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:56,172 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 554 proven. 0 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2022-11-02 20:43:56,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:56,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128984504] [2022-11-02 20:43:56,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128984504] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:56,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:43:56,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:43:56,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676247750] [2022-11-02 20:43:56,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:56,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:43:56,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:56,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:43:56,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:43:56,176 INFO L87 Difference]: Start difference. First operand 2488 states and 3435 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:43:56,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:56,439 INFO L93 Difference]: Finished difference Result 5251 states and 7296 transitions. [2022-11-02 20:43:56,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:43:56,439 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 264 [2022-11-02 20:43:56,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:56,451 INFO L225 Difference]: With dead ends: 5251 [2022-11-02 20:43:56,451 INFO L226 Difference]: Without dead ends: 2770 [2022-11-02 20:43:56,454 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:43:56,455 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 117 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:56,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 177 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:43:56,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2770 states. [2022-11-02 20:43:56,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2770 to 2698. [2022-11-02 20:43:56,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2698 states, 2697 states have (on average 1.389321468298109) internal successors, (3747), 2697 states have internal predecessors, (3747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:43:56,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2698 states to 2698 states and 3747 transitions. [2022-11-02 20:43:56,605 INFO L78 Accepts]: Start accepts. Automaton has 2698 states and 3747 transitions. Word has length 264 [2022-11-02 20:43:56,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:56,606 INFO L495 AbstractCegarLoop]: Abstraction has 2698 states and 3747 transitions. [2022-11-02 20:43:56,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:43:56,606 INFO L276 IsEmpty]: Start isEmpty. Operand 2698 states and 3747 transitions. [2022-11-02 20:43:56,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2022-11-02 20:43:56,614 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:56,614 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 13, 13, 13, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:56,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:43:56,615 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:43:56,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:56,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1239310138, now seen corresponding path program 1 times [2022-11-02 20:43:56,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:56,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743133423] [2022-11-02 20:43:56,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:56,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:56,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:56,777 INFO L134 CoverageAnalysis]: Checked inductivity of 1169 backedges. 629 proven. 0 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2022-11-02 20:43:56,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:56,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743133423] [2022-11-02 20:43:56,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743133423] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:56,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:43:56,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:43:56,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966979347] [2022-11-02 20:43:56,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:56,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:43:56,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:56,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:43:56,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:43:56,780 INFO L87 Difference]: Start difference. First operand 2698 states and 3747 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:43:57,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:57,068 INFO L93 Difference]: Finished difference Result 5443 states and 7548 transitions. [2022-11-02 20:43:57,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:43:57,069 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 299 [2022-11-02 20:43:57,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:57,080 INFO L225 Difference]: With dead ends: 5443 [2022-11-02 20:43:57,081 INFO L226 Difference]: Without dead ends: 2764 [2022-11-02 20:43:57,083 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:43:57,084 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 122 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:57,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 170 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:43:57,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2764 states. [2022-11-02 20:43:57,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2764 to 2692. [2022-11-02 20:43:57,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2692 states, 2691 states have (on average 1.379041248606466) internal successors, (3711), 2691 states have internal predecessors, (3711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:43:57,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2692 states to 2692 states and 3711 transitions. [2022-11-02 20:43:57,203 INFO L78 Accepts]: Start accepts. Automaton has 2692 states and 3711 transitions. Word has length 299 [2022-11-02 20:43:57,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:57,204 INFO L495 AbstractCegarLoop]: Abstraction has 2692 states and 3711 transitions. [2022-11-02 20:43:57,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:43:57,205 INFO L276 IsEmpty]: Start isEmpty. Operand 2692 states and 3711 transitions. [2022-11-02 20:43:57,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2022-11-02 20:43:57,214 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:57,215 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:57,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 20:43:57,215 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:43:57,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:57,216 INFO L85 PathProgramCache]: Analyzing trace with hash 918915254, now seen corresponding path program 1 times [2022-11-02 20:43:57,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:57,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037358437] [2022-11-02 20:43:57,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:57,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:57,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:57,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1312 backedges. 663 proven. 0 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2022-11-02 20:43:57,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:57,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037358437] [2022-11-02 20:43:57,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037358437] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:57,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:43:57,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:43:57,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911154847] [2022-11-02 20:43:57,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:57,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:43:57,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:57,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:43:57,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:43:57,394 INFO L87 Difference]: Start difference. First operand 2692 states and 3711 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:43:57,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:57,705 INFO L93 Difference]: Finished difference Result 5407 states and 7446 transitions. [2022-11-02 20:43:57,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:43:57,706 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 322 [2022-11-02 20:43:57,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:57,718 INFO L225 Difference]: With dead ends: 5407 [2022-11-02 20:43:57,719 INFO L226 Difference]: Without dead ends: 2752 [2022-11-02 20:43:57,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:43:57,724 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 55 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:57,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 251 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:43:57,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2752 states. [2022-11-02 20:43:57,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2752 to 2692. [2022-11-02 20:43:57,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2692 states, 2691 states have (on average 1.358974358974359) internal successors, (3657), 2691 states have internal predecessors, (3657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:43:57,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2692 states to 2692 states and 3657 transitions. [2022-11-02 20:43:57,889 INFO L78 Accepts]: Start accepts. Automaton has 2692 states and 3657 transitions. Word has length 322 [2022-11-02 20:43:57,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:57,890 INFO L495 AbstractCegarLoop]: Abstraction has 2692 states and 3657 transitions. [2022-11-02 20:43:57,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:43:57,890 INFO L276 IsEmpty]: Start isEmpty. Operand 2692 states and 3657 transitions. [2022-11-02 20:43:57,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2022-11-02 20:43:57,903 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:57,904 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:57,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 20:43:57,904 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:43:57,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:57,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1665023372, now seen corresponding path program 1 times [2022-11-02 20:43:57,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:57,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264672946] [2022-11-02 20:43:57,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:57,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:57,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:58,086 INFO L134 CoverageAnalysis]: Checked inductivity of 1420 backedges. 731 proven. 0 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2022-11-02 20:43:58,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:58,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264672946] [2022-11-02 20:43:58,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264672946] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:58,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:43:58,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:43:58,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846122506] [2022-11-02 20:43:58,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:58,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:43:58,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:58,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:43:58,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:43:58,090 INFO L87 Difference]: Start difference. First operand 2692 states and 3657 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:43:58,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:58,404 INFO L93 Difference]: Finished difference Result 5653 states and 7626 transitions. [2022-11-02 20:43:58,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:43:58,404 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 336 [2022-11-02 20:43:58,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:58,417 INFO L225 Difference]: With dead ends: 5653 [2022-11-02 20:43:58,417 INFO L226 Difference]: Without dead ends: 2998 [2022-11-02 20:43:58,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:43:58,422 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 130 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:58,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 147 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:43:58,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2998 states. [2022-11-02 20:43:58,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2998 to 2782. [2022-11-02 20:43:58,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2782 states, 2781 states have (on average 1.3581445523193096) internal successors, (3777), 2781 states have internal predecessors, (3777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:43:58,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2782 states to 2782 states and 3777 transitions. [2022-11-02 20:43:58,572 INFO L78 Accepts]: Start accepts. Automaton has 2782 states and 3777 transitions. Word has length 336 [2022-11-02 20:43:58,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:58,573 INFO L495 AbstractCegarLoop]: Abstraction has 2782 states and 3777 transitions. [2022-11-02 20:43:58,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:43:58,573 INFO L276 IsEmpty]: Start isEmpty. Operand 2782 states and 3777 transitions. [2022-11-02 20:43:58,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2022-11-02 20:43:58,582 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:58,583 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:58,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 20:43:58,583 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:43:58,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:58,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1597112402, now seen corresponding path program 1 times [2022-11-02 20:43:58,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:58,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142954109] [2022-11-02 20:43:58,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:58,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:58,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:58,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1420 backedges. 871 proven. 0 refuted. 0 times theorem prover too weak. 549 trivial. 0 not checked. [2022-11-02 20:43:58,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:58,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142954109] [2022-11-02 20:43:58,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142954109] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:58,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:43:58,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:43:58,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926973044] [2022-11-02 20:43:58,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:58,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:43:58,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:58,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:43:58,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:43:58,765 INFO L87 Difference]: Start difference. First operand 2782 states and 3777 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:43:58,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:58,948 INFO L93 Difference]: Finished difference Result 7882 states and 10755 transitions. [2022-11-02 20:43:58,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:43:58,949 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 337 [2022-11-02 20:43:58,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:58,987 INFO L225 Difference]: With dead ends: 7882 [2022-11-02 20:43:58,987 INFO L226 Difference]: Without dead ends: 5137 [2022-11-02 20:43:58,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:43:59,002 INFO L413 NwaCegarLoop]: 283 mSDtfsCounter, 84 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:59,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 445 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:43:59,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5137 states. [2022-11-02 20:43:59,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5137 to 5135. [2022-11-02 20:43:59,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5135 states, 5134 states have (on average 1.36482275029217) internal successors, (7007), 5134 states have internal predecessors, (7007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:43:59,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5135 states to 5135 states and 7007 transitions. [2022-11-02 20:43:59,287 INFO L78 Accepts]: Start accepts. Automaton has 5135 states and 7007 transitions. Word has length 337 [2022-11-02 20:43:59,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:59,288 INFO L495 AbstractCegarLoop]: Abstraction has 5135 states and 7007 transitions. [2022-11-02 20:43:59,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:43:59,289 INFO L276 IsEmpty]: Start isEmpty. Operand 5135 states and 7007 transitions. [2022-11-02 20:43:59,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2022-11-02 20:43:59,301 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:59,302 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:59,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-02 20:43:59,302 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:43:59,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:59,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1354743787, now seen corresponding path program 1 times [2022-11-02 20:43:59,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:59,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619007982] [2022-11-02 20:43:59,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:59,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:59,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:59,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1563 backedges. 904 proven. 10 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2022-11-02 20:43:59,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:59,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619007982] [2022-11-02 20:43:59,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619007982] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:43:59,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513220306] [2022-11-02 20:43:59,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:59,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:59,544 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69f8b60b-1233-4764-b302-98ae0d411066/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:59,551 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69f8b60b-1233-4764-b302-98ae0d411066/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:43:59,557 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69f8b60b-1233-4764-b302-98ae0d411066/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:43:59,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:59,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:43:59,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:59,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1563 backedges. 904 proven. 10 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2022-11-02 20:43:59,996 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:44:00,105 INFO L134 CoverageAnalysis]: Checked inductivity of 1563 backedges. 904 proven. 10 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2022-11-02 20:44:00,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513220306] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:44:00,106 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:44:00,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-11-02 20:44:00,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915692961] [2022-11-02 20:44:00,109 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:44:00,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:44:00,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:00,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:44:00,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:44:00,112 INFO L87 Difference]: Start difference. First operand 5135 states and 7007 transitions. Second operand has 6 states, 6 states have (on average 38.833333333333336) internal successors, (233), 6 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:01,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:44:01,054 INFO L93 Difference]: Finished difference Result 10227 states and 13933 transitions. [2022-11-02 20:44:01,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:44:01,055 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 38.833333333333336) internal successors, (233), 6 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 361 [2022-11-02 20:44:01,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:44:01,078 INFO L225 Difference]: With dead ends: 10227 [2022-11-02 20:44:01,078 INFO L226 Difference]: Without dead ends: 7740 [2022-11-02 20:44:01,084 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 728 GetRequests, 722 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:44:01,086 INFO L413 NwaCegarLoop]: 298 mSDtfsCounter, 263 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:44:01,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 832 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:44:01,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7740 states. [2022-11-02 20:44:01,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7740 to 5669. [2022-11-02 20:44:01,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5669 states, 5668 states have (on average 1.3484474241354976) internal successors, (7643), 5668 states have internal predecessors, (7643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:01,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5669 states to 5669 states and 7643 transitions. [2022-11-02 20:44:01,474 INFO L78 Accepts]: Start accepts. Automaton has 5669 states and 7643 transitions. Word has length 361 [2022-11-02 20:44:01,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:44:01,475 INFO L495 AbstractCegarLoop]: Abstraction has 5669 states and 7643 transitions. [2022-11-02 20:44:01,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.833333333333336) internal successors, (233), 6 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:01,476 INFO L276 IsEmpty]: Start isEmpty. Operand 5669 states and 7643 transitions. [2022-11-02 20:44:01,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2022-11-02 20:44:01,491 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:44:01,492 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 16, 16, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:44:01,537 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69f8b60b-1233-4764-b302-98ae0d411066/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:44:01,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69f8b60b-1233-4764-b302-98ae0d411066/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:44:01,711 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:44:01,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:01,712 INFO L85 PathProgramCache]: Analyzing trace with hash 290805068, now seen corresponding path program 2 times [2022-11-02 20:44:01,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:01,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21862615] [2022-11-02 20:44:01,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:01,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:01,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:01,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2022-11-02 20:44:01,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:01,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21862615] [2022-11-02 20:44:01,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21862615] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:44:01,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287140176] [2022-11-02 20:44:01,964 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:44:01,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:44:01,965 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69f8b60b-1233-4764-b302-98ae0d411066/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:44:01,966 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69f8b60b-1233-4764-b302-98ae0d411066/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:44:01,990 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69f8b60b-1233-4764-b302-98ae0d411066/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:44:02,173 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:44:02,174 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:44:02,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 692 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:44:02,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:44:02,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2022-11-02 20:44:02,290 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:44:02,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2022-11-02 20:44:02,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1287140176] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:44:02,449 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:44:02,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-11-02 20:44:02,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511516053] [2022-11-02 20:44:02,450 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:44:02,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:44:02,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:02,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:44:02,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:44:02,453 INFO L87 Difference]: Start difference. First operand 5669 states and 7643 transitions. Second operand has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:03,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:44:03,099 INFO L93 Difference]: Finished difference Result 12703 states and 17150 transitions. [2022-11-02 20:44:03,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:44:03,100 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 374 [2022-11-02 20:44:03,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:44:03,120 INFO L225 Difference]: With dead ends: 12703 [2022-11-02 20:44:03,120 INFO L226 Difference]: Without dead ends: 7058 [2022-11-02 20:44:03,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 752 GetRequests, 747 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:44:03,129 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 360 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:44:03,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 436 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:44:03,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7058 states. [2022-11-02 20:44:03,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7058 to 5789. [2022-11-02 20:44:03,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5789 states, 5788 states have (on average 1.3344851416724257) internal successors, (7724), 5788 states have internal predecessors, (7724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:03,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5789 states to 5789 states and 7724 transitions. [2022-11-02 20:44:03,422 INFO L78 Accepts]: Start accepts. Automaton has 5789 states and 7724 transitions. Word has length 374 [2022-11-02 20:44:03,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:44:03,423 INFO L495 AbstractCegarLoop]: Abstraction has 5789 states and 7724 transitions. [2022-11-02 20:44:03,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:03,424 INFO L276 IsEmpty]: Start isEmpty. Operand 5789 states and 7724 transitions. [2022-11-02 20:44:03,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2022-11-02 20:44:03,439 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:44:03,439 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:44:03,486 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69f8b60b-1233-4764-b302-98ae0d411066/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:44:03,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69f8b60b-1233-4764-b302-98ae0d411066/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:44:03,663 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:44:03,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:03,664 INFO L85 PathProgramCache]: Analyzing trace with hash -939951161, now seen corresponding path program 1 times [2022-11-02 20:44:03,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:03,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504181136] [2022-11-02 20:44:03,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:03,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:03,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:03,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1970 backedges. 885 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2022-11-02 20:44:03,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:03,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504181136] [2022-11-02 20:44:03,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504181136] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:44:03,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:44:03,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:44:03,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447366549] [2022-11-02 20:44:03,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:44:03,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:44:03,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:03,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:44:03,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:44:03,924 INFO L87 Difference]: Start difference. First operand 5789 states and 7724 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:04,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:44:04,239 INFO L93 Difference]: Finished difference Result 11133 states and 14642 transitions. [2022-11-02 20:44:04,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:44:04,240 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 413 [2022-11-02 20:44:04,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:44:04,248 INFO L225 Difference]: With dead ends: 11133 [2022-11-02 20:44:04,249 INFO L226 Difference]: Without dead ends: 3109 [2022-11-02 20:44:04,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:44:04,258 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 39 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:44:04,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 259 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:44:04,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3109 states. [2022-11-02 20:44:04,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3109 to 3043. [2022-11-02 20:44:04,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3043 states, 3042 states have (on average 1.3356344510190663) internal successors, (4063), 3042 states have internal predecessors, (4063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:04,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3043 states to 3043 states and 4063 transitions. [2022-11-02 20:44:04,388 INFO L78 Accepts]: Start accepts. Automaton has 3043 states and 4063 transitions. Word has length 413 [2022-11-02 20:44:04,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:44:04,389 INFO L495 AbstractCegarLoop]: Abstraction has 3043 states and 4063 transitions. [2022-11-02 20:44:04,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:04,390 INFO L276 IsEmpty]: Start isEmpty. Operand 3043 states and 4063 transitions. [2022-11-02 20:44:04,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 512 [2022-11-02 20:44:04,404 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:44:04,405 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 19, 19, 17, 17, 15, 15, 13, 13, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:44:04,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-02 20:44:04,405 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:44:04,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:04,406 INFO L85 PathProgramCache]: Analyzing trace with hash -826650578, now seen corresponding path program 1 times [2022-11-02 20:44:04,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:04,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720955790] [2022-11-02 20:44:04,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:04,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:04,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:04,766 INFO L134 CoverageAnalysis]: Checked inductivity of 2898 backedges. 1648 proven. 14 refuted. 0 times theorem prover too weak. 1236 trivial. 0 not checked. [2022-11-02 20:44:04,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:04,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720955790] [2022-11-02 20:44:04,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720955790] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:44:04,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673730850] [2022-11-02 20:44:04,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:04,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:44:04,768 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69f8b60b-1233-4764-b302-98ae0d411066/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:44:04,769 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69f8b60b-1233-4764-b302-98ae0d411066/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:44:04,785 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69f8b60b-1233-4764-b302-98ae0d411066/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 20:44:05,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:05,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 860 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:44:05,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:44:05,843 INFO L134 CoverageAnalysis]: Checked inductivity of 2898 backedges. 1075 proven. 0 refuted. 0 times theorem prover too weak. 1823 trivial. 0 not checked. [2022-11-02 20:44:05,843 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:44:05,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673730850] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:44:05,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:44:05,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-11-02 20:44:05,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710091009] [2022-11-02 20:44:05,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:44:05,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:44:05,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:05,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:44:05,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:44:05,846 INFO L87 Difference]: Start difference. First operand 3043 states and 4063 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:05,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:44:05,926 INFO L93 Difference]: Finished difference Result 3068 states and 4093 transitions. [2022-11-02 20:44:05,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:44:05,927 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 511 [2022-11-02 20:44:05,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:44:05,933 INFO L225 Difference]: With dead ends: 3068 [2022-11-02 20:44:05,933 INFO L226 Difference]: Without dead ends: 2571 [2022-11-02 20:44:05,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 514 GetRequests, 511 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:44:05,936 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 56 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:44:05,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 256 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:44:05,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2571 states. [2022-11-02 20:44:06,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2571 to 2548. [2022-11-02 20:44:06,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2548 states, 2547 states have (on average 1.3345111896348645) internal successors, (3399), 2547 states have internal predecessors, (3399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:06,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2548 states to 2548 states and 3399 transitions. [2022-11-02 20:44:06,037 INFO L78 Accepts]: Start accepts. Automaton has 2548 states and 3399 transitions. Word has length 511 [2022-11-02 20:44:06,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:44:06,038 INFO L495 AbstractCegarLoop]: Abstraction has 2548 states and 3399 transitions. [2022-11-02 20:44:06,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:06,038 INFO L276 IsEmpty]: Start isEmpty. Operand 2548 states and 3399 transitions. [2022-11-02 20:44:06,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 513 [2022-11-02 20:44:06,051 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:44:06,051 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 18, 16, 16, 14, 14, 13, 13, 12, 12, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:44:06,095 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69f8b60b-1233-4764-b302-98ae0d411066/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 20:44:06,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69f8b60b-1233-4764-b302-98ae0d411066/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-02 20:44:06,275 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:44:06,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:06,275 INFO L85 PathProgramCache]: Analyzing trace with hash -301655084, now seen corresponding path program 1 times [2022-11-02 20:44:06,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:06,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846912605] [2022-11-02 20:44:06,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:06,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:06,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:06,565 INFO L134 CoverageAnalysis]: Checked inductivity of 2784 backedges. 1623 proven. 14 refuted. 0 times theorem prover too weak. 1147 trivial. 0 not checked. [2022-11-02 20:44:06,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:06,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846912605] [2022-11-02 20:44:06,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846912605] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:44:06,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1962918227] [2022-11-02 20:44:06,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:06,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:44:06,566 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69f8b60b-1233-4764-b302-98ae0d411066/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:44:06,568 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69f8b60b-1233-4764-b302-98ae0d411066/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:44:06,582 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69f8b60b-1233-4764-b302-98ae0d411066/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 20:44:06,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:06,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 850 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-02 20:44:06,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:44:06,870 INFO L134 CoverageAnalysis]: Checked inductivity of 2784 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 2506 trivial. 0 not checked. [2022-11-02 20:44:06,870 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:44:06,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1962918227] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:44:06,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:44:06,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-11-02 20:44:06,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177814264] [2022-11-02 20:44:06,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:44:06,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:44:06,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:06,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:44:06,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:44:06,874 INFO L87 Difference]: Start difference. First operand 2548 states and 3399 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:07,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:44:07,121 INFO L93 Difference]: Finished difference Result 5167 states and 6909 transitions. [2022-11-02 20:44:07,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:44:07,122 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 512 [2022-11-02 20:44:07,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:44:07,130 INFO L225 Difference]: With dead ends: 5167 [2022-11-02 20:44:07,130 INFO L226 Difference]: Without dead ends: 2656 [2022-11-02 20:44:07,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 515 GetRequests, 512 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:44:07,135 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 49 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:44:07,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 207 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:44:07,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2656 states. [2022-11-02 20:44:07,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2656 to 2653. [2022-11-02 20:44:07,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2653 states, 2652 states have (on average 1.2861990950226245) internal successors, (3411), 2652 states have internal predecessors, (3411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:07,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2653 states to 2653 states and 3411 transitions. [2022-11-02 20:44:07,274 INFO L78 Accepts]: Start accepts. Automaton has 2653 states and 3411 transitions. Word has length 512 [2022-11-02 20:44:07,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:44:07,276 INFO L495 AbstractCegarLoop]: Abstraction has 2653 states and 3411 transitions. [2022-11-02 20:44:07,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:07,276 INFO L276 IsEmpty]: Start isEmpty. Operand 2653 states and 3411 transitions. [2022-11-02 20:44:07,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 624 [2022-11-02 20:44:07,299 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:44:07,299 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 21, 21, 21, 19, 19, 17, 17, 16, 16, 15, 15, 13, 13, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:44:07,338 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69f8b60b-1233-4764-b302-98ae0d411066/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-02 20:44:07,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69f8b60b-1233-4764-b302-98ae0d411066/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-02 20:44:07,518 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:44:07,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:07,519 INFO L85 PathProgramCache]: Analyzing trace with hash 44620561, now seen corresponding path program 2 times [2022-11-02 20:44:07,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:07,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354026005] [2022-11-02 20:44:07,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:07,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:07,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:07,898 INFO L134 CoverageAnalysis]: Checked inductivity of 4135 backedges. 2131 proven. 14 refuted. 0 times theorem prover too weak. 1990 trivial. 0 not checked. [2022-11-02 20:44:07,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:07,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354026005] [2022-11-02 20:44:07,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354026005] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:44:07,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [319903995] [2022-11-02 20:44:07,899 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:44:07,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:44:07,900 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69f8b60b-1233-4764-b302-98ae0d411066/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:44:07,901 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69f8b60b-1233-4764-b302-98ae0d411066/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:44:07,925 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69f8b60b-1233-4764-b302-98ae0d411066/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-02 20:44:08,161 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:44:08,164 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:44:08,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 1001 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:44:08,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:44:08,300 INFO L134 CoverageAnalysis]: Checked inductivity of 4135 backedges. 2131 proven. 14 refuted. 0 times theorem prover too weak. 1990 trivial. 0 not checked. [2022-11-02 20:44:08,300 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:44:08,429 INFO L134 CoverageAnalysis]: Checked inductivity of 4135 backedges. 2131 proven. 14 refuted. 0 times theorem prover too weak. 1990 trivial. 0 not checked. [2022-11-02 20:44:08,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [319903995] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:44:08,430 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:44:08,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-11-02 20:44:08,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494450733] [2022-11-02 20:44:08,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:44:08,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:44:08,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:08,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:44:08,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:44:08,433 INFO L87 Difference]: Start difference. First operand 2653 states and 3411 transitions. Second operand has 8 states, 8 states have (on average 41.75) internal successors, (334), 8 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:08,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:44:08,743 INFO L93 Difference]: Finished difference Result 2888 states and 3708 transitions. [2022-11-02 20:44:08,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:44:08,744 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 41.75) internal successors, (334), 8 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 623 [2022-11-02 20:44:08,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:44:08,745 INFO L225 Difference]: With dead ends: 2888 [2022-11-02 20:44:08,745 INFO L226 Difference]: Without dead ends: 0 [2022-11-02 20:44:08,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1252 GetRequests, 1244 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:44:08,749 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 131 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:44:08,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 464 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:44:08,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-02 20:44:08,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-02 20:44:08,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:08,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-02 20:44:08,750 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 623 [2022-11-02 20:44:08,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:44:08,751 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-02 20:44:08,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 41.75) internal successors, (334), 8 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:44:08,751 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-02 20:44:08,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-02 20:44:08,754 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-02 20:44:08,800 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69f8b60b-1233-4764-b302-98ae0d411066/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-02 20:44:08,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69f8b60b-1233-4764-b302-98ae0d411066/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-02 20:44:08,978 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-02 20:44:14,778 INFO L899 garLoopResultBuilder]: For program point L399(lines 399 403) no Hoare annotation was computed. [2022-11-02 20:44:14,779 INFO L895 garLoopResultBuilder]: At program point L333(lines 87 562) the Hoare annotation is: false [2022-11-02 20:44:14,779 INFO L899 garLoopResultBuilder]: For program point L399-2(lines 213 496) no Hoare annotation was computed. [2022-11-02 20:44:14,779 INFO L899 garLoopResultBuilder]: For program point L234(lines 234 245) no Hoare annotation was computed. [2022-11-02 20:44:14,779 INFO L899 garLoopResultBuilder]: For program point L234-2(lines 213 496) no Hoare annotation was computed. [2022-11-02 20:44:14,779 INFO L899 garLoopResultBuilder]: For program point L532(lines 532 548) no Hoare annotation was computed. [2022-11-02 20:44:14,779 INFO L899 garLoopResultBuilder]: For program point L533(lines 533 547) no Hoare annotation was computed. [2022-11-02 20:44:14,780 INFO L899 garLoopResultBuilder]: For program point L368(lines 368 370) no Hoare annotation was computed. [2022-11-02 20:44:14,780 INFO L899 garLoopResultBuilder]: For program point L335(lines 335 337) no Hoare annotation was computed. [2022-11-02 20:44:14,780 INFO L899 garLoopResultBuilder]: For program point L302(lines 302 304) no Hoare annotation was computed. [2022-11-02 20:44:14,780 INFO L899 garLoopResultBuilder]: For program point L236(lines 236 239) no Hoare annotation was computed. [2022-11-02 20:44:14,780 INFO L899 garLoopResultBuilder]: For program point L302-2(lines 300 308) no Hoare annotation was computed. [2022-11-02 20:44:14,780 INFO L899 garLoopResultBuilder]: For program point L203(lines 203 501) no Hoare annotation was computed. [2022-11-02 20:44:14,780 INFO L899 garLoopResultBuilder]: For program point L170(lines 170 512) no Hoare annotation was computed. [2022-11-02 20:44:14,780 INFO L899 garLoopResultBuilder]: For program point L137(lines 137 523) no Hoare annotation was computed. [2022-11-02 20:44:14,780 INFO L899 garLoopResultBuilder]: For program point L104(lines 104 108) no Hoare annotation was computed. [2022-11-02 20:44:14,780 INFO L899 garLoopResultBuilder]: For program point L534(lines 534 539) no Hoare annotation was computed. [2022-11-02 20:44:14,781 INFO L899 garLoopResultBuilder]: For program point L534-2(lines 533 547) no Hoare annotation was computed. [2022-11-02 20:44:14,781 INFO L895 garLoopResultBuilder]: At program point L204(lines 200 502) the Hoare annotation is: (let ((.cse1 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4560)) (.cse0 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0)) (.cse2 (<= 4560 |ULTIMATE.start_ssl3_connect_~s__state~0#1|))) (or (and .cse0 (<= |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1| 4560) .cse1 .cse2 (<= 4560 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1|)) (and (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) .cse1 (not .cse0) .cse2))) [2022-11-02 20:44:14,781 INFO L895 garLoopResultBuilder]: At program point L138(lines 134 524) the Hoare annotation is: (and (< 4368 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) (not (<= 4400 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 1)) [2022-11-02 20:44:14,781 INFO L899 garLoopResultBuilder]: For program point L105(lines 105 107) no Hoare annotation was computed. [2022-11-02 20:44:14,781 INFO L899 garLoopResultBuilder]: For program point L536(lines 536 538) no Hoare annotation was computed. [2022-11-02 20:44:14,782 INFO L899 garLoopResultBuilder]: For program point L206(lines 206 500) no Hoare annotation was computed. [2022-11-02 20:44:14,782 INFO L899 garLoopResultBuilder]: For program point L173(lines 173 511) no Hoare annotation was computed. [2022-11-02 20:44:14,782 INFO L899 garLoopResultBuilder]: For program point L140(lines 140 522) no Hoare annotation was computed. [2022-11-02 20:44:14,782 INFO L899 garLoopResultBuilder]: For program point L372(lines 372 377) no Hoare annotation was computed. [2022-11-02 20:44:14,782 INFO L899 garLoopResultBuilder]: For program point L372-2(lines 372 377) no Hoare annotation was computed. [2022-11-02 20:44:14,782 INFO L899 garLoopResultBuilder]: For program point L240(lines 240 243) no Hoare annotation was computed. [2022-11-02 20:44:14,782 INFO L895 garLoopResultBuilder]: At program point L207(lines 206 500) the Hoare annotation is: (let ((.cse1 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4352)) (.cse0 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0)) (.cse2 (<= 4352 |ULTIMATE.start_ssl3_connect_~s__state~0#1|))) (or (and .cse0 (<= |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1| 4560) .cse1 .cse2 (<= 4560 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1|)) (and (= 3 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1|) (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) .cse1 (not .cse0) .cse2))) [2022-11-02 20:44:14,783 INFO L895 garLoopResultBuilder]: At program point L174(lines 164 514) the Hoare annotation is: (and (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0) (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4480) (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) [2022-11-02 20:44:14,783 INFO L899 garLoopResultBuilder]: For program point L472-1(lines 472 474) no Hoare annotation was computed. [2022-11-02 20:44:14,783 INFO L899 garLoopResultBuilder]: For program point L274(lines 274 276) no Hoare annotation was computed. [2022-11-02 20:44:14,783 INFO L902 garLoopResultBuilder]: At program point L572(lines 564 574) the Hoare annotation is: true [2022-11-02 20:44:14,783 INFO L899 garLoopResultBuilder]: For program point L209(lines 209 499) no Hoare annotation was computed. [2022-11-02 20:44:14,783 INFO L899 garLoopResultBuilder]: For program point L176(lines 176 510) no Hoare annotation was computed. [2022-11-02 20:44:14,783 INFO L899 garLoopResultBuilder]: For program point L143(lines 143 521) no Hoare annotation was computed. [2022-11-02 20:44:14,784 INFO L895 garLoopResultBuilder]: At program point L110-1(lines 87 562) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0))) (let ((.cse6 (<= 4560 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1|)) (.cse8 (= 3 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse3 (<= |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1| 4560)) (.cse11 (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 0)) (.cse9 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4352)) (.cse10 (<= 4352 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse2 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) (.cse12 (= 4400 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse4 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4560)) (.cse13 (not .cse0)) (.cse5 (<= 4560 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse7 (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|)) (.cse1 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4528))) (or (and (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse4 .cse5 .cse6) (and (= 4384 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 1)) (and .cse0 .cse7 .cse8) (and .cse0 .cse3 .cse9 .cse10 .cse6) (and .cse3 .cse8) (and (= 4368 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) .cse11) (and .cse0 .cse3 .cse2 .cse12) (and (= 12292 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) .cse11) (and (= 3 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1|) .cse7 .cse9 .cse13 .cse10) (and .cse0 (= 4416 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) .cse2) (and .cse0 .cse7 .cse12) (and .cse7 .cse4 .cse13 .cse5) (and .cse7 (<= 4512 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) .cse1)))) [2022-11-02 20:44:14,784 INFO L899 garLoopResultBuilder]: For program point L408(lines 408 411) no Hoare annotation was computed. [2022-11-02 20:44:14,784 INFO L902 garLoopResultBuilder]: At program point L210(lines 209 499) the Hoare annotation is: true [2022-11-02 20:44:14,784 INFO L895 garLoopResultBuilder]: At program point L144(lines 140 522) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0)) (.cse1 (< 4368 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse2 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4432))) (or (and .cse0 .cse1 .cse2 (<= |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1| 4560) (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) (and .cse0 .cse1 .cse2 (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|)))) [2022-11-02 20:44:14,784 INFO L899 garLoopResultBuilder]: For program point L111(line 111) no Hoare annotation was computed. [2022-11-02 20:44:14,784 INFO L899 garLoopResultBuilder]: For program point L541(lines 541 545) no Hoare annotation was computed. [2022-11-02 20:44:14,784 INFO L899 garLoopResultBuilder]: For program point L443(lines 443 445) no Hoare annotation was computed. [2022-11-02 20:44:14,785 INFO L899 garLoopResultBuilder]: For program point L344(lines 344 346) no Hoare annotation was computed. [2022-11-02 20:44:14,785 INFO L902 garLoopResultBuilder]: At program point L212(lines 211 499) the Hoare annotation is: true [2022-11-02 20:44:14,785 INFO L899 garLoopResultBuilder]: For program point L179(lines 179 509) no Hoare annotation was computed. [2022-11-02 20:44:14,785 INFO L899 garLoopResultBuilder]: For program point L146(lines 146 520) no Hoare annotation was computed. [2022-11-02 20:44:14,785 INFO L899 garLoopResultBuilder]: For program point L113(lines 113 531) no Hoare annotation was computed. [2022-11-02 20:44:14,785 INFO L895 garLoopResultBuilder]: At program point L180(lines 176 510) the Hoare annotation is: (and (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0) (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4) (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4512)) [2022-11-02 20:44:14,785 INFO L895 garLoopResultBuilder]: At program point L114(lines 113 531) the Hoare annotation is: (and (= 12292 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 0)) [2022-11-02 20:44:14,785 INFO L899 garLoopResultBuilder]: For program point L478(lines 478 480) no Hoare annotation was computed. [2022-11-02 20:44:14,786 INFO L899 garLoopResultBuilder]: For program point L478-2(lines 478 480) no Hoare annotation was computed. [2022-11-02 20:44:14,786 INFO L899 garLoopResultBuilder]: For program point L446(lines 446 450) no Hoare annotation was computed. [2022-11-02 20:44:14,786 INFO L899 garLoopResultBuilder]: For program point L446-2(lines 446 450) no Hoare annotation was computed. [2022-11-02 20:44:14,786 INFO L899 garLoopResultBuilder]: For program point L347(lines 347 351) no Hoare annotation was computed. [2022-11-02 20:44:14,786 INFO L899 garLoopResultBuilder]: For program point L281(lines 281 283) no Hoare annotation was computed. [2022-11-02 20:44:14,786 INFO L899 garLoopResultBuilder]: For program point L347-2(lines 347 351) no Hoare annotation was computed. [2022-11-02 20:44:14,786 INFO L899 garLoopResultBuilder]: For program point L281-2(lines 213 496) no Hoare annotation was computed. [2022-11-02 20:44:14,786 INFO L899 garLoopResultBuilder]: For program point L182(lines 182 508) no Hoare annotation was computed. [2022-11-02 20:44:14,786 INFO L899 garLoopResultBuilder]: For program point L149(lines 149 519) no Hoare annotation was computed. [2022-11-02 20:44:14,787 INFO L899 garLoopResultBuilder]: For program point L116(lines 116 530) no Hoare annotation was computed. [2022-11-02 20:44:14,787 INFO L895 garLoopResultBuilder]: At program point L150(lines 146 520) the Hoare annotation is: (and (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0) (< 4368 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4432) (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) [2022-11-02 20:44:14,787 INFO L899 garLoopResultBuilder]: For program point L316(lines 316 318) no Hoare annotation was computed. [2022-11-02 20:44:14,787 INFO L899 garLoopResultBuilder]: For program point L250(lines 250 253) no Hoare annotation was computed. [2022-11-02 20:44:14,787 INFO L899 garLoopResultBuilder]: For program point L316-2(lines 213 496) no Hoare annotation was computed. [2022-11-02 20:44:14,787 INFO L899 garLoopResultBuilder]: For program point L416(lines 416 418) no Hoare annotation was computed. [2022-11-02 20:44:14,787 INFO L899 garLoopResultBuilder]: For program point L383(lines 383 385) no Hoare annotation was computed. [2022-11-02 20:44:14,787 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-02 20:44:14,788 INFO L895 garLoopResultBuilder]: At program point L218(lines 116 530) the Hoare annotation is: (and (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4352) (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 0)) [2022-11-02 20:44:14,788 INFO L899 garLoopResultBuilder]: For program point L185(lines 185 507) no Hoare annotation was computed. [2022-11-02 20:44:14,788 INFO L899 garLoopResultBuilder]: For program point L152(lines 152 518) no Hoare annotation was computed. [2022-11-02 20:44:14,788 INFO L899 garLoopResultBuilder]: For program point L119(lines 119 529) no Hoare annotation was computed. [2022-11-02 20:44:14,788 INFO L895 garLoopResultBuilder]: At program point L186(lines 182 508) the Hoare annotation is: (and (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0) (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4) (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4512)) [2022-11-02 20:44:14,788 INFO L899 garLoopResultBuilder]: For program point L484(lines 484 486) no Hoare annotation was computed. [2022-11-02 20:44:14,788 INFO L899 garLoopResultBuilder]: For program point L484-2(lines 484 486) no Hoare annotation was computed. [2022-11-02 20:44:14,788 INFO L902 garLoopResultBuilder]: At program point L551(lines 109 552) the Hoare annotation is: true [2022-11-02 20:44:14,789 INFO L899 garLoopResultBuilder]: For program point L287(lines 287 291) no Hoare annotation was computed. [2022-11-02 20:44:14,789 INFO L899 garLoopResultBuilder]: For program point L287-2(lines 287 291) no Hoare annotation was computed. [2022-11-02 20:44:14,789 INFO L899 garLoopResultBuilder]: For program point L188(lines 188 506) no Hoare annotation was computed. [2022-11-02 20:44:14,789 INFO L899 garLoopResultBuilder]: For program point L155(lines 155 517) no Hoare annotation was computed. [2022-11-02 20:44:14,789 INFO L899 garLoopResultBuilder]: For program point L122(lines 122 528) no Hoare annotation was computed. [2022-11-02 20:44:14,789 INFO L895 garLoopResultBuilder]: At program point L156(lines 152 518) the Hoare annotation is: (and (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0) (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4448) (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) [2022-11-02 20:44:14,789 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-02 20:44:14,789 INFO L899 garLoopResultBuilder]: For program point L223(lines 223 225) no Hoare annotation was computed. [2022-11-02 20:44:14,789 INFO L899 garLoopResultBuilder]: For program point L223-2(lines 223 225) no Hoare annotation was computed. [2022-11-02 20:44:14,790 INFO L899 garLoopResultBuilder]: For program point L191(lines 191 505) no Hoare annotation was computed. [2022-11-02 20:44:14,790 INFO L899 garLoopResultBuilder]: For program point L158(lines 158 516) no Hoare annotation was computed. [2022-11-02 20:44:14,790 INFO L899 garLoopResultBuilder]: For program point L125(lines 125 527) no Hoare annotation was computed. [2022-11-02 20:44:14,790 INFO L899 garLoopResultBuilder]: For program point L489(lines 489 491) no Hoare annotation was computed. [2022-11-02 20:44:14,790 INFO L899 garLoopResultBuilder]: For program point L456(lines 456 467) no Hoare annotation was computed. [2022-11-02 20:44:14,790 INFO L899 garLoopResultBuilder]: For program point L423(lines 423 437) no Hoare annotation was computed. [2022-11-02 20:44:14,790 INFO L899 garLoopResultBuilder]: For program point L423-1(lines 423 437) no Hoare annotation was computed. [2022-11-02 20:44:14,790 INFO L899 garLoopResultBuilder]: For program point L456-2(lines 456 467) no Hoare annotation was computed. [2022-11-02 20:44:14,793 INFO L899 garLoopResultBuilder]: For program point L324(lines 324 327) no Hoare annotation was computed. [2022-11-02 20:44:14,793 INFO L895 garLoopResultBuilder]: At program point L192(lines 188 506) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4528))) (or (and (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0) .cse0 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) (and (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) (<= 4512 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) .cse0))) [2022-11-02 20:44:14,793 INFO L899 garLoopResultBuilder]: For program point L556(lines 556 558) no Hoare annotation was computed. [2022-11-02 20:44:14,793 INFO L899 garLoopResultBuilder]: For program point L556-2(lines 556 558) no Hoare annotation was computed. [2022-11-02 20:44:14,793 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-02 20:44:14,794 INFO L899 garLoopResultBuilder]: For program point L359(lines 359 361) no Hoare annotation was computed. [2022-11-02 20:44:14,794 INFO L899 garLoopResultBuilder]: For program point L194(lines 194 504) no Hoare annotation was computed. [2022-11-02 20:44:14,794 INFO L899 garLoopResultBuilder]: For program point L161(lines 161 515) no Hoare annotation was computed. [2022-11-02 20:44:14,794 INFO L899 garLoopResultBuilder]: For program point L128(lines 128 526) no Hoare annotation was computed. [2022-11-02 20:44:14,794 INFO L899 garLoopResultBuilder]: For program point L393(lines 393 395) no Hoare annotation was computed. [2022-11-02 20:44:14,794 INFO L899 garLoopResultBuilder]: For program point L228(lines 228 231) no Hoare annotation was computed. [2022-11-02 20:44:14,795 INFO L895 garLoopResultBuilder]: At program point L162(lines 158 516) the Hoare annotation is: (and (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0) (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4464) (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) [2022-11-02 20:44:14,795 INFO L899 garLoopResultBuilder]: For program point L96(lines 96 102) no Hoare annotation was computed. [2022-11-02 20:44:14,795 INFO L899 garLoopResultBuilder]: For program point L427(lines 427 433) no Hoare annotation was computed. [2022-11-02 20:44:14,795 INFO L899 garLoopResultBuilder]: For program point L262(lines 262 268) no Hoare annotation was computed. [2022-11-02 20:44:14,795 INFO L899 garLoopResultBuilder]: For program point L461(lines 461 464) no Hoare annotation was computed. [2022-11-02 20:44:14,795 INFO L899 garLoopResultBuilder]: For program point L197(lines 197 503) no Hoare annotation was computed. [2022-11-02 20:44:14,796 INFO L899 garLoopResultBuilder]: For program point L164(lines 164 514) no Hoare annotation was computed. [2022-11-02 20:44:14,796 INFO L899 garLoopResultBuilder]: For program point L131(lines 131 525) no Hoare annotation was computed. [2022-11-02 20:44:14,796 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-02 20:44:14,796 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 560) no Hoare annotation was computed. [2022-11-02 20:44:14,796 INFO L902 garLoopResultBuilder]: At program point L561(lines 22 563) the Hoare annotation is: true [2022-11-02 20:44:14,797 INFO L895 garLoopResultBuilder]: At program point L198(lines 194 504) the Hoare annotation is: (let ((.cse0 (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse1 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0)) (.cse2 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4560))) (or (and .cse0 .cse1 (<= |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1| 4560) .cse2) (and .cse0 .cse1 .cse2 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) (and (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) (<= 4512 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) .cse2))) [2022-11-02 20:44:14,797 INFO L895 garLoopResultBuilder]: At program point L132(lines 128 526) the Hoare annotation is: (and (< |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4400) (<= 4352 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 0)) [2022-11-02 20:44:14,797 INFO L899 garLoopResultBuilder]: For program point L99(lines 99 101) no Hoare annotation was computed. [2022-11-02 20:44:14,797 INFO L899 garLoopResultBuilder]: For program point L99-2(lines 96 102) no Hoare annotation was computed. [2022-11-02 20:44:14,797 INFO L899 garLoopResultBuilder]: For program point L298(lines 298 308) no Hoare annotation was computed. [2022-11-02 20:44:14,798 INFO L899 garLoopResultBuilder]: For program point L265(lines 265 267) no Hoare annotation was computed. [2022-11-02 20:44:14,798 INFO L899 garLoopResultBuilder]: For program point L298-2(lines 298 308) no Hoare annotation was computed. [2022-11-02 20:44:14,798 INFO L899 garLoopResultBuilder]: For program point L265-2(lines 213 496) no Hoare annotation was computed. [2022-11-02 20:44:14,798 INFO L895 garLoopResultBuilder]: At program point L497(lines 110 550) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0))) (let ((.cse6 (<= 4560 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1|)) (.cse8 (= 3 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse3 (<= |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1| 4560)) (.cse9 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4352)) (.cse10 (<= 4352 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse2 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) (.cse11 (= 4400 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse4 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4560)) (.cse12 (not .cse0)) (.cse5 (<= 4560 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse7 (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|)) (.cse1 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4528))) (or (and (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse4 .cse5 .cse6) (and (= 4384 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 1)) (and .cse0 .cse7 .cse8) (and .cse0 .cse3 .cse9 .cse10 .cse6) (and .cse3 .cse8) (and (= 4368 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 0)) (and .cse0 .cse3 .cse2 .cse11) (and (= 3 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1|) .cse7 .cse9 .cse12 .cse10) (and .cse0 (= 4416 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) .cse2) (and .cse0 .cse7 .cse11) (and .cse7 .cse4 .cse12 .cse5) (and .cse7 (<= 4512 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) .cse1)))) [2022-11-02 20:44:14,798 INFO L899 garLoopResultBuilder]: For program point L332(lines 332 334) no Hoare annotation was computed. [2022-11-02 20:44:14,799 INFO L899 garLoopResultBuilder]: For program point L200(lines 200 502) no Hoare annotation was computed. [2022-11-02 20:44:14,799 INFO L899 garLoopResultBuilder]: For program point L167(lines 167 513) no Hoare annotation was computed. [2022-11-02 20:44:14,799 INFO L899 garLoopResultBuilder]: For program point L134(lines 134 524) no Hoare annotation was computed. [2022-11-02 20:44:14,803 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:44:14,805 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:44:14,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:44:14 BoogieIcfgContainer [2022-11-02 20:44:14,828 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:44:14,828 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:44:14,828 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:44:14,829 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:44:14,829 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:43:50" (3/4) ... [2022-11-02 20:44:14,833 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-02 20:44:14,851 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2022-11-02 20:44:14,852 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-02 20:44:14,852 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-02 20:44:14,853 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-02 20:44:14,956 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69f8b60b-1233-4764-b302-98ae0d411066/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 20:44:14,956 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:44:14,957 INFO L158 Benchmark]: Toolchain (without parser) took 26505.69ms. Allocated memory was 109.1MB in the beginning and 620.8MB in the end (delta: 511.7MB). Free memory was 72.5MB in the beginning and 230.0MB in the end (delta: -157.5MB). Peak memory consumption was 352.6MB. Max. memory is 16.1GB. [2022-11-02 20:44:14,957 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 109.1MB. Free memory is still 89.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:44:14,957 INFO L158 Benchmark]: CACSL2BoogieTranslator took 533.35ms. Allocated memory is still 109.1MB. Free memory was 72.3MB in the beginning and 82.1MB in the end (delta: -9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-02 20:44:14,958 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.79ms. Allocated memory is still 109.1MB. Free memory was 82.1MB in the beginning and 79.2MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-02 20:44:14,958 INFO L158 Benchmark]: Boogie Preprocessor took 34.34ms. Allocated memory is still 109.1MB. Free memory was 79.2MB in the beginning and 77.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:44:14,961 INFO L158 Benchmark]: RCFGBuilder took 1052.70ms. Allocated memory is still 109.1MB. Free memory was 77.1MB in the beginning and 84.4MB in the end (delta: -7.3MB). Peak memory consumption was 35.1MB. Max. memory is 16.1GB. [2022-11-02 20:44:14,962 INFO L158 Benchmark]: TraceAbstraction took 24677.52ms. Allocated memory was 109.1MB in the beginning and 620.8MB in the end (delta: 511.7MB). Free memory was 83.3MB in the beginning and 237.3MB in the end (delta: -154.0MB). Peak memory consumption was 385.3MB. Max. memory is 16.1GB. [2022-11-02 20:44:14,962 INFO L158 Benchmark]: Witness Printer took 127.83ms. Allocated memory is still 620.8MB. Free memory was 237.3MB in the beginning and 230.0MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-02 20:44:14,968 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.38ms. Allocated memory is still 109.1MB. Free memory is still 89.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 533.35ms. Allocated memory is still 109.1MB. Free memory was 72.3MB in the beginning and 82.1MB in the end (delta: -9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.79ms. Allocated memory is still 109.1MB. Free memory was 82.1MB in the beginning and 79.2MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.34ms. Allocated memory is still 109.1MB. Free memory was 79.2MB in the beginning and 77.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1052.70ms. Allocated memory is still 109.1MB. Free memory was 77.1MB in the beginning and 84.4MB in the end (delta: -7.3MB). Peak memory consumption was 35.1MB. Max. memory is 16.1GB. * TraceAbstraction took 24677.52ms. Allocated memory was 109.1MB in the beginning and 620.8MB in the end (delta: 511.7MB). Free memory was 83.3MB in the beginning and 237.3MB in the end (delta: -154.0MB). Peak memory consumption was 385.3MB. Max. memory is 16.1GB. * Witness Printer took 127.83ms. Allocated memory is still 620.8MB. Free memory was 237.3MB in the beginning and 230.0MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 560]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 128 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 24.6s, OverallIterations: 27, TraceHistogramMax: 22, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.2s, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2441 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2441 mSDsluCounter, 8023 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3183 mSDsCounter, 707 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2940 IncrementalHoareTripleChecker+Invalid, 3647 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 707 mSolverCounterUnsat, 4840 mSDtfsCounter, 2940 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3827 GetRequests, 3780 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5789occurred in iteration=23, InterpolantAutomatonStates: 89, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.5s AutomataMinimizationTime, 27 MinimizatonAttempts, 4069 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 23 LocationsWithAnnotation, 23 PreInvPairs, 227 NumberOfFragments, 584 HoareAnnotationTreeSize, 23 FomulaSimplifications, 8108 FormulaSimplificationTreeSizeReduction, 2.2s HoareSimplificationTime, 23 FomulaSimplificationsInter, 9617 FormulaSimplificationTreeSizeReductionInter, 3.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 8796 NumberOfCodeBlocks, 8796 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 10119 ConstructedInterpolants, 0 QuantifiedInterpolants, 13470 SizeOfPredicates, 3 NumberOfNonLiveVariables, 4063 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 35 InterpolantComputations, 24 PerfectInterpolantSequences, 46523/46638 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: ((4432 <= s__state && s__hit == 0) && blastFlag <= 4) && s__state <= 4512 - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 87]: Loop Invariant Derived loop invariant: (((((((((((((((4432 <= s__state && s__hit == 0) && s__state <= 4528) && blastFlag <= 4) || ((((s__hit == 0 && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && 4560 <= s__state) && 4560 <= s__s3__tmp__next_state___0)) || (4384 == s__state && blastFlag == 1)) || ((s__hit == 0 && 2 == blastFlag) && 3 == s__state)) || ((((s__hit == 0 && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4352) && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0)) || (s__s3__tmp__next_state___0 <= 4560 && 3 == s__state)) || (4368 == s__state && blastFlag == 0)) || (((s__hit == 0 && s__s3__tmp__next_state___0 <= 4560) && blastFlag <= 4) && 4400 == s__state)) || (12292 == s__state && blastFlag == 0)) || ((((3 == s__s3__tmp__next_state___0 && 2 == blastFlag) && s__state <= 4352) && !(s__hit == 0)) && 4352 <= s__state)) || ((s__hit == 0 && 4416 == s__state) && blastFlag <= 4)) || ((s__hit == 0 && 2 == blastFlag) && 4400 == s__state)) || (((2 == blastFlag && s__state <= 4560) && !(s__hit == 0)) && 4560 <= s__state)) || ((2 == blastFlag && 4512 <= s__state) && s__state <= 4528) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: 12292 == s__state && blastFlag == 0 - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: ((((((((((((((4432 <= s__state && s__hit == 0) && s__state <= 4528) && blastFlag <= 4) || ((((s__hit == 0 && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && 4560 <= s__state) && 4560 <= s__s3__tmp__next_state___0)) || (4384 == s__state && blastFlag == 1)) || ((s__hit == 0 && 2 == blastFlag) && 3 == s__state)) || ((((s__hit == 0 && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4352) && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0)) || (s__s3__tmp__next_state___0 <= 4560 && 3 == s__state)) || (4368 == s__state && blastFlag == 0)) || (((s__hit == 0 && s__s3__tmp__next_state___0 <= 4560) && blastFlag <= 4) && 4400 == s__state)) || ((((3 == s__s3__tmp__next_state___0 && 2 == blastFlag) && s__state <= 4352) && !(s__hit == 0)) && 4352 <= s__state)) || ((s__hit == 0 && 4416 == s__state) && blastFlag <= 4)) || ((s__hit == 0 && 2 == blastFlag) && 4400 == s__state)) || (((2 == blastFlag && s__state <= 4560) && !(s__hit == 0)) && 4560 <= s__state)) || ((2 == blastFlag && 4512 <= s__state) && s__state <= 4528) - InvariantResult [Line: 194]: Loop Invariant Derived loop invariant: ((((4432 <= s__state && s__hit == 0) && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) || (((4432 <= s__state && s__hit == 0) && s__state <= 4560) && blastFlag <= 4)) || ((2 == blastFlag && 4512 <= s__state) && s__state <= 4560) - InvariantResult [Line: 564]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: ((((s__hit == 0 && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4352) && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0) || ((((3 == s__s3__tmp__next_state___0 && 2 == blastFlag) && s__state <= 4352) && !(s__hit == 0)) && 4352 <= s__state) - InvariantResult [Line: 211]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: s__state <= 4352 && blastFlag == 0 - InvariantResult [Line: 140]: Loop Invariant Derived loop invariant: ((((s__hit == 0 && 4368 < s__state) && s__state <= 4432) && s__s3__tmp__next_state___0 <= 4560) && blastFlag <= 4) || (((s__hit == 0 && 4368 < s__state) && s__state <= 4432) && 2 == blastFlag) - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: ((((s__hit == 0 && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && 4560 <= s__state) && 4560 <= s__s3__tmp__next_state___0) || (((2 == blastFlag && s__state <= 4560) && !(s__hit == 0)) && 4560 <= s__state) - InvariantResult [Line: 209]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 128]: Loop Invariant Derived loop invariant: (s__state < 4400 && 4352 <= s__state) && blastFlag == 0 - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: ((4432 <= s__state && s__hit == 0) && s__state <= 4448) && blastFlag <= 4 - InvariantResult [Line: 188]: Loop Invariant Derived loop invariant: (((4432 <= s__state && s__hit == 0) && s__state <= 4528) && blastFlag <= 4) || ((2 == blastFlag && 4512 <= s__state) && s__state <= 4528) - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: ((4432 <= s__state && s__hit == 0) && s__state <= 4480) && blastFlag <= 4 - InvariantResult [Line: 87]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: (4368 < s__state && !(4400 <= s__state)) && blastFlag == 1 - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: ((s__hit == 0 && 4368 < s__state) && s__state <= 4432) && blastFlag <= 4 - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 182]: Loop Invariant Derived loop invariant: ((4432 <= s__state && s__hit == 0) && blastFlag <= 4) && s__state <= 4512 - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: ((4432 <= s__state && s__hit == 0) && s__state <= 4464) && blastFlag <= 4 RESULT: Ultimate proved your program to be correct! [2022-11-02 20:44:15,057 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69f8b60b-1233-4764-b302-98ae0d411066/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE