./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/pc_sfifo_3.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af816cbd-00a2-4b0e-92b2-d01ca13d4bad/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af816cbd-00a2-4b0e-92b2-d01ca13d4bad/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af816cbd-00a2-4b0e-92b2-d01ca13d4bad/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af816cbd-00a2-4b0e-92b2-d01ca13d4bad/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/pc_sfifo_3.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af816cbd-00a2-4b0e-92b2-d01ca13d4bad/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af816cbd-00a2-4b0e-92b2-d01ca13d4bad/bin/uautomizer-ZsLfNo2U6R --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 677126e8d6773c92cc337bfe0a3ec155f49f784424155f33a8c9c24ee0a42113 --- 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-38b53e6 [2022-11-25 15:44:13,894 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 15:44:13,896 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 15:44:13,924 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 15:44:13,925 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 15:44:13,926 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 15:44:13,927 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 15:44:13,935 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 15:44:13,937 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 15:44:13,943 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 15:44:13,945 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 15:44:13,948 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 15:44:13,948 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 15:44:13,951 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 15:44:13,954 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 15:44:13,955 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 15:44:13,955 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 15:44:13,956 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 15:44:13,958 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 15:44:13,959 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 15:44:13,961 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 15:44:13,967 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 15:44:13,969 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 15:44:13,970 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 15:44:13,983 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 15:44:13,983 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 15:44:13,983 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 15:44:13,984 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 15:44:13,985 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 15:44:13,986 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 15:44:13,986 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 15:44:13,987 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 15:44:13,988 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 15:44:13,988 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 15:44:13,989 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 15:44:13,990 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 15:44:13,990 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 15:44:13,991 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 15:44:13,991 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 15:44:13,992 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 15:44:13,996 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 15:44:13,998 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af816cbd-00a2-4b0e-92b2-d01ca13d4bad/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-25 15:44:14,033 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 15:44:14,034 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 15:44:14,034 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 15:44:14,034 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 15:44:14,035 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 15:44:14,035 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 15:44:14,036 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 15:44:14,036 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 15:44:14,036 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 15:44:14,039 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 15:44:14,040 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 15:44:14,041 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 15:44:14,041 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 15:44:14,041 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 15:44:14,041 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 15:44:14,042 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 15:44:14,042 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 15:44:14,042 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 15:44:14,042 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 15:44:14,043 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 15:44:14,043 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 15:44:14,043 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 15:44:14,043 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 15:44:14,044 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 15:44:14,044 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:44:14,045 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 15:44:14,045 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 15:44:14,045 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 15:44:14,045 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 15:44:14,046 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 15:44:14,046 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 15:44:14,046 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 15:44:14,046 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 15:44:14,047 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 15:44:14,047 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af816cbd-00a2-4b0e-92b2-d01ca13d4bad/bin/uautomizer-ZsLfNo2U6R/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_af816cbd-00a2-4b0e-92b2-d01ca13d4bad/bin/uautomizer-ZsLfNo2U6R 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 -> 677126e8d6773c92cc337bfe0a3ec155f49f784424155f33a8c9c24ee0a42113 [2022-11-25 15:44:14,373 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 15:44:14,414 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 15:44:14,418 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 15:44:14,419 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 15:44:14,420 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 15:44:14,421 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af816cbd-00a2-4b0e-92b2-d01ca13d4bad/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/systemc/pc_sfifo_3.cil.c [2022-11-25 15:44:17,426 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 15:44:17,710 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 15:44:17,711 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af816cbd-00a2-4b0e-92b2-d01ca13d4bad/sv-benchmarks/c/systemc/pc_sfifo_3.cil.c [2022-11-25 15:44:17,724 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af816cbd-00a2-4b0e-92b2-d01ca13d4bad/bin/uautomizer-ZsLfNo2U6R/data/c5bcb07b3/e2f13701a1154d3285b45d2c1130a3b1/FLAG66c3d02c0 [2022-11-25 15:44:17,739 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af816cbd-00a2-4b0e-92b2-d01ca13d4bad/bin/uautomizer-ZsLfNo2U6R/data/c5bcb07b3/e2f13701a1154d3285b45d2c1130a3b1 [2022-11-25 15:44:17,741 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 15:44:17,743 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 15:44:17,744 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 15:44:17,744 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 15:44:17,748 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 15:44:17,749 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:44:17" (1/1) ... [2022-11-25 15:44:17,750 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f4a806 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:44:17, skipping insertion in model container [2022-11-25 15:44:17,750 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:44:17" (1/1) ... [2022-11-25 15:44:17,767 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 15:44:17,806 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 15:44:17,932 WARN L237 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_af816cbd-00a2-4b0e-92b2-d01ca13d4bad/sv-benchmarks/c/systemc/pc_sfifo_3.cil.c[640,653] [2022-11-25 15:44:17,994 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:44:18,005 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 15:44:18,017 WARN L237 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_af816cbd-00a2-4b0e-92b2-d01ca13d4bad/sv-benchmarks/c/systemc/pc_sfifo_3.cil.c[640,653] [2022-11-25 15:44:18,046 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:44:18,061 INFO L208 MainTranslator]: Completed translation [2022-11-25 15:44:18,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:44:18 WrapperNode [2022-11-25 15:44:18,062 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 15:44:18,063 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 15:44:18,063 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 15:44:18,063 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 15:44:18,071 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:44:18" (1/1) ... [2022-11-25 15:44:18,087 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:44:18" (1/1) ... [2022-11-25 15:44:18,109 INFO L138 Inliner]: procedures = 31, calls = 35, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 225 [2022-11-25 15:44:18,109 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 15:44:18,110 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 15:44:18,110 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 15:44:18,110 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 15:44:18,120 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:44:18" (1/1) ... [2022-11-25 15:44:18,120 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:44:18" (1/1) ... [2022-11-25 15:44:18,123 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:44:18" (1/1) ... [2022-11-25 15:44:18,124 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:44:18" (1/1) ... [2022-11-25 15:44:18,129 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:44:18" (1/1) ... [2022-11-25 15:44:18,134 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:44:18" (1/1) ... [2022-11-25 15:44:18,136 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:44:18" (1/1) ... [2022-11-25 15:44:18,138 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:44:18" (1/1) ... [2022-11-25 15:44:18,140 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 15:44:18,141 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 15:44:18,142 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 15:44:18,142 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 15:44:18,143 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:44:18" (1/1) ... [2022-11-25 15:44:18,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:44:18,173 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af816cbd-00a2-4b0e-92b2-d01ca13d4bad/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:44:18,186 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af816cbd-00a2-4b0e-92b2-d01ca13d4bad/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 15:44:18,197 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af816cbd-00a2-4b0e-92b2-d01ca13d4bad/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 15:44:18,232 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 15:44:18,232 INFO L130 BoogieDeclarations]: Found specification of procedure error [2022-11-25 15:44:18,232 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2022-11-25 15:44:18,232 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-11-25 15:44:18,232 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-11-25 15:44:18,233 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-11-25 15:44:18,233 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-11-25 15:44:18,233 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-11-25 15:44:18,233 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-11-25 15:44:18,233 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-11-25 15:44:18,233 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-11-25 15:44:18,234 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-11-25 15:44:18,234 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-11-25 15:44:18,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 15:44:18,234 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-11-25 15:44:18,234 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-11-25 15:44:18,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 15:44:18,234 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 15:44:18,235 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-11-25 15:44:18,235 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-11-25 15:44:18,324 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 15:44:18,327 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 15:44:18,820 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##54: assume !(1 == ~q_free~0); [2022-11-25 15:44:18,821 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##53: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2022-11-25 15:44:18,841 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 15:44:18,850 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 15:44:18,850 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-25 15:44:18,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:44:18 BoogieIcfgContainer [2022-11-25 15:44:18,853 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 15:44:18,856 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 15:44:18,857 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 15:44:18,860 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 15:44:18,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 03:44:17" (1/3) ... [2022-11-25 15:44:18,862 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ef3fb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:44:18, skipping insertion in model container [2022-11-25 15:44:18,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:44:18" (2/3) ... [2022-11-25 15:44:18,863 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ef3fb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:44:18, skipping insertion in model container [2022-11-25 15:44:18,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:44:18" (3/3) ... [2022-11-25 15:44:18,865 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil.c [2022-11-25 15:44:18,886 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 15:44:18,886 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 15:44:18,945 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 15:44:18,953 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;@17425f61, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 15:44:18,953 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-25 15:44:18,958 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 93 states have (on average 1.5268817204301075) internal successors, (142), 97 states have internal predecessors, (142), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-25 15:44:18,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-25 15:44:18,972 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:44:18,972 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 15:44:18,973 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:44:18,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:44:18,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1330697302, now seen corresponding path program 1 times [2022-11-25 15:44:18,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:44:18,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598425322] [2022-11-25 15:44:18,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:44:18,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:44:19,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:19,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 15:44:19,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:19,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 15:44:19,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:19,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 15:44:19,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:19,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:44:19,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:19,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 15:44:19,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:19,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-25 15:44:19,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:19,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-25 15:44:19,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:19,735 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-25 15:44:19,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:44:19,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598425322] [2022-11-25 15:44:19,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598425322] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:44:19,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:44:19,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 15:44:19,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310997545] [2022-11-25 15:44:19,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:44:19,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 15:44:19,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:44:19,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 15:44:19,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-25 15:44:19,813 INFO L87 Difference]: Start difference. First operand has 119 states, 93 states have (on average 1.5268817204301075) internal successors, (142), 97 states have internal predecessors, (142), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 5 states have internal predecessors, (49), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-25 15:44:20,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:44:20,732 INFO L93 Difference]: Finished difference Result 382 states and 574 transitions. [2022-11-25 15:44:20,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 15:44:20,735 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 5 states have internal predecessors, (49), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 64 [2022-11-25 15:44:20,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:44:20,748 INFO L225 Difference]: With dead ends: 382 [2022-11-25 15:44:20,748 INFO L226 Difference]: Without dead ends: 264 [2022-11-25 15:44:20,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-11-25 15:44:20,756 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 379 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 15:44:20,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 544 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 15:44:20,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2022-11-25 15:44:20,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 225. [2022-11-25 15:44:20,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 179 states have (on average 1.4245810055865922) internal successors, (255), 183 states have internal predecessors, (255), 29 states have call successors, (29), 15 states have call predecessors, (29), 16 states have return successors, (32), 28 states have call predecessors, (32), 27 states have call successors, (32) [2022-11-25 15:44:20,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 316 transitions. [2022-11-25 15:44:20,839 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 316 transitions. Word has length 64 [2022-11-25 15:44:20,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:44:20,840 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 316 transitions. [2022-11-25 15:44:20,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 5 states have internal predecessors, (49), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-25 15:44:20,841 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 316 transitions. [2022-11-25 15:44:20,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-25 15:44:20,844 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:44:20,845 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 15:44:20,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 15:44:20,845 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:44:20,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:44:20,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1285381354, now seen corresponding path program 1 times [2022-11-25 15:44:20,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:44:20,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313208672] [2022-11-25 15:44:20,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:44:20,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:44:20,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:20,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 15:44:20,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:21,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 15:44:21,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:21,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 15:44:21,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:21,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:44:21,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:21,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 15:44:21,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:21,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-25 15:44:21,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:21,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-25 15:44:21,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:21,103 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-25 15:44:21,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:44:21,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313208672] [2022-11-25 15:44:21,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313208672] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:44:21,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:44:21,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 15:44:21,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102553735] [2022-11-25 15:44:21,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:44:21,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 15:44:21,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:44:21,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 15:44:21,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-25 15:44:21,114 INFO L87 Difference]: Start difference. First operand 225 states and 316 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-25 15:44:22,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:44:22,126 INFO L93 Difference]: Finished difference Result 622 states and 882 transitions. [2022-11-25 15:44:22,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-25 15:44:22,127 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 64 [2022-11-25 15:44:22,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:44:22,136 INFO L225 Difference]: With dead ends: 622 [2022-11-25 15:44:22,136 INFO L226 Difference]: Without dead ends: 413 [2022-11-25 15:44:22,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-11-25 15:44:22,148 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 457 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 15:44:22,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 750 Invalid, 879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 15:44:22,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2022-11-25 15:44:22,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 337. [2022-11-25 15:44:22,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 269 states have (on average 1.41635687732342) internal successors, (381), 275 states have internal predecessors, (381), 42 states have call successors, (42), 22 states have call predecessors, (42), 25 states have return successors, (53), 42 states have call predecessors, (53), 40 states have call successors, (53) [2022-11-25 15:44:22,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 476 transitions. [2022-11-25 15:44:22,231 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 476 transitions. Word has length 64 [2022-11-25 15:44:22,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:44:22,231 INFO L495 AbstractCegarLoop]: Abstraction has 337 states and 476 transitions. [2022-11-25 15:44:22,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-25 15:44:22,232 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 476 transitions. [2022-11-25 15:44:22,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-25 15:44:22,235 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:44:22,235 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 15:44:22,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 15:44:22,236 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:44:22,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:44:22,236 INFO L85 PathProgramCache]: Analyzing trace with hash 980999832, now seen corresponding path program 1 times [2022-11-25 15:44:22,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:44:22,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284816102] [2022-11-25 15:44:22,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:44:22,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:44:22,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:22,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 15:44:22,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:22,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 15:44:22,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:22,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 15:44:22,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:22,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:44:22,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:22,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 15:44:22,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:22,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-25 15:44:22,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:22,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-25 15:44:22,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:22,410 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-25 15:44:22,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:44:22,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284816102] [2022-11-25 15:44:22,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284816102] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:44:22,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:44:22,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-25 15:44:22,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164901703] [2022-11-25 15:44:22,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:44:22,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 15:44:22,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:44:22,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 15:44:22,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-25 15:44:22,419 INFO L87 Difference]: Start difference. First operand 337 states and 476 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 7 states have internal predecessors, (49), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-11-25 15:44:24,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:44:24,478 INFO L93 Difference]: Finished difference Result 1883 states and 2674 transitions. [2022-11-25 15:44:24,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-25 15:44:24,479 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 7 states have internal predecessors, (49), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 64 [2022-11-25 15:44:24,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:44:24,489 INFO L225 Difference]: With dead ends: 1883 [2022-11-25 15:44:24,489 INFO L226 Difference]: Without dead ends: 1550 [2022-11-25 15:44:24,495 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-11-25 15:44:24,498 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 1663 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 1463 mSolverCounterSat, 444 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1681 SdHoareTripleChecker+Valid, 1049 SdHoareTripleChecker+Invalid, 1907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 444 IncrementalHoareTripleChecker+Valid, 1463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-25 15:44:24,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1681 Valid, 1049 Invalid, 1907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [444 Valid, 1463 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-25 15:44:24,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1550 states. [2022-11-25 15:44:24,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1550 to 1390. [2022-11-25 15:44:24,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1390 states, 1117 states have (on average 1.3652641002685766) internal successors, (1525), 1138 states have internal predecessors, (1525), 152 states have call successors, (152), 105 states have call predecessors, (152), 120 states have return successors, (186), 148 states have call predecessors, (186), 150 states have call successors, (186) [2022-11-25 15:44:24,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1390 states and 1863 transitions. [2022-11-25 15:44:24,751 INFO L78 Accepts]: Start accepts. Automaton has 1390 states and 1863 transitions. Word has length 64 [2022-11-25 15:44:24,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:44:24,751 INFO L495 AbstractCegarLoop]: Abstraction has 1390 states and 1863 transitions. [2022-11-25 15:44:24,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 7 states have internal predecessors, (49), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-11-25 15:44:24,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1390 states and 1863 transitions. [2022-11-25 15:44:24,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-25 15:44:24,754 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:44:24,754 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 15:44:24,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 15:44:24,755 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:44:24,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:44:24,755 INFO L85 PathProgramCache]: Analyzing trace with hash 779831852, now seen corresponding path program 1 times [2022-11-25 15:44:24,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:44:24,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77260736] [2022-11-25 15:44:24,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:44:24,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:44:24,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:24,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 15:44:24,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:24,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 15:44:24,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:24,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 15:44:24,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:24,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:44:24,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:25,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 15:44:25,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:25,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-25 15:44:25,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:25,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-25 15:44:25,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:25,051 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-25 15:44:25,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:44:25,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77260736] [2022-11-25 15:44:25,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77260736] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:44:25,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:44:25,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-25 15:44:25,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452864522] [2022-11-25 15:44:25,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:44:25,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 15:44:25,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:44:25,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 15:44:25,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-25 15:44:25,062 INFO L87 Difference]: Start difference. First operand 1390 states and 1863 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-25 15:44:25,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:44:25,721 INFO L93 Difference]: Finished difference Result 2918 states and 3942 transitions. [2022-11-25 15:44:25,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 15:44:25,722 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2022-11-25 15:44:25,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:44:25,730 INFO L225 Difference]: With dead ends: 2918 [2022-11-25 15:44:25,730 INFO L226 Difference]: Without dead ends: 1538 [2022-11-25 15:44:25,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-11-25 15:44:25,735 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 137 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 15:44:25,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 619 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 15:44:25,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1538 states. [2022-11-25 15:44:25,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1538 to 1430. [2022-11-25 15:44:25,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1430 states, 1149 states have (on average 1.349869451697128) internal successors, (1551), 1170 states have internal predecessors, (1551), 152 states have call successors, (152), 105 states have call predecessors, (152), 128 states have return successors, (194), 156 states have call predecessors, (194), 150 states have call successors, (194) [2022-11-25 15:44:25,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1430 states to 1430 states and 1897 transitions. [2022-11-25 15:44:25,925 INFO L78 Accepts]: Start accepts. Automaton has 1430 states and 1897 transitions. Word has length 65 [2022-11-25 15:44:25,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:44:25,926 INFO L495 AbstractCegarLoop]: Abstraction has 1430 states and 1897 transitions. [2022-11-25 15:44:25,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-25 15:44:25,927 INFO L276 IsEmpty]: Start isEmpty. Operand 1430 states and 1897 transitions. [2022-11-25 15:44:25,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-25 15:44:25,929 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:44:25,929 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 15:44:25,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 15:44:25,929 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:44:25,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:44:25,930 INFO L85 PathProgramCache]: Analyzing trace with hash -249527446, now seen corresponding path program 1 times [2022-11-25 15:44:25,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:44:25,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526724145] [2022-11-25 15:44:25,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:44:25,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:44:25,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:26,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 15:44:26,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:26,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 15:44:26,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:26,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 15:44:26,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:26,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:44:26,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:26,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 15:44:26,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:26,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-25 15:44:26,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:26,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-25 15:44:26,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:26,139 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-25 15:44:26,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:44:26,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526724145] [2022-11-25 15:44:26,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526724145] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:44:26,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:44:26,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-25 15:44:26,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295434186] [2022-11-25 15:44:26,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:44:26,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 15:44:26,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:44:26,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 15:44:26,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-25 15:44:26,143 INFO L87 Difference]: Start difference. First operand 1430 states and 1897 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-25 15:44:28,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:44:28,370 INFO L93 Difference]: Finished difference Result 5002 states and 6771 transitions. [2022-11-25 15:44:28,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-25 15:44:28,370 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2022-11-25 15:44:28,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:44:28,380 INFO L225 Difference]: With dead ends: 5002 [2022-11-25 15:44:28,380 INFO L226 Difference]: Without dead ends: 1821 [2022-11-25 15:44:28,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-11-25 15:44:28,391 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 1565 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 1490 mSolverCounterSat, 397 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1583 SdHoareTripleChecker+Valid, 1231 SdHoareTripleChecker+Invalid, 1887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 397 IncrementalHoareTripleChecker+Valid, 1490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-25 15:44:28,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1583 Valid, 1231 Invalid, 1887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [397 Valid, 1490 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-25 15:44:28,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1821 states. [2022-11-25 15:44:28,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1821 to 1641. [2022-11-25 15:44:28,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1641 states, 1288 states have (on average 1.3020186335403727) internal successors, (1677), 1311 states have internal predecessors, (1677), 192 states have call successors, (192), 133 states have call predecessors, (192), 160 states have return successors, (240), 198 states have call predecessors, (240), 190 states have call successors, (240) [2022-11-25 15:44:28,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1641 states to 1641 states and 2109 transitions. [2022-11-25 15:44:28,555 INFO L78 Accepts]: Start accepts. Automaton has 1641 states and 2109 transitions. Word has length 65 [2022-11-25 15:44:28,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:44:28,556 INFO L495 AbstractCegarLoop]: Abstraction has 1641 states and 2109 transitions. [2022-11-25 15:44:28,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-25 15:44:28,556 INFO L276 IsEmpty]: Start isEmpty. Operand 1641 states and 2109 transitions. [2022-11-25 15:44:28,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-11-25 15:44:28,559 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:44:28,559 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2022-11-25 15:44:28,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 15:44:28,560 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:44:28,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:44:28,561 INFO L85 PathProgramCache]: Analyzing trace with hash -31264562, now seen corresponding path program 1 times [2022-11-25 15:44:28,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:44:28,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408443786] [2022-11-25 15:44:28,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:44:28,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:44:28,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:28,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 15:44:28,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:28,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 15:44:28,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:28,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 15:44:28,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:28,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:44:28,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:28,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 15:44:28,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:28,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-25 15:44:28,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:28,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-25 15:44:28,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:28,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-25 15:44:28,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:28,790 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-25 15:44:28,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:44:28,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408443786] [2022-11-25 15:44:28,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408443786] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:44:28,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:44:28,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-25 15:44:28,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797536377] [2022-11-25 15:44:28,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:44:28,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 15:44:28,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:44:28,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 15:44:28,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-25 15:44:28,794 INFO L87 Difference]: Start difference. First operand 1641 states and 2109 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-25 15:44:29,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:44:29,419 INFO L93 Difference]: Finished difference Result 3466 states and 4511 transitions. [2022-11-25 15:44:29,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 15:44:29,420 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 90 [2022-11-25 15:44:29,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:44:29,429 INFO L225 Difference]: With dead ends: 3466 [2022-11-25 15:44:29,429 INFO L226 Difference]: Without dead ends: 1835 [2022-11-25 15:44:29,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-11-25 15:44:29,435 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 192 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 15:44:29,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 511 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 15:44:29,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1835 states. [2022-11-25 15:44:29,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1835 to 1701. [2022-11-25 15:44:29,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1701 states, 1336 states have (on average 1.2866766467065869) internal successors, (1719), 1359 states have internal predecessors, (1719), 192 states have call successors, (192), 133 states have call predecessors, (192), 172 states have return successors, (252), 210 states have call predecessors, (252), 190 states have call successors, (252) [2022-11-25 15:44:29,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1701 states to 1701 states and 2163 transitions. [2022-11-25 15:44:29,584 INFO L78 Accepts]: Start accepts. Automaton has 1701 states and 2163 transitions. Word has length 90 [2022-11-25 15:44:29,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:44:29,585 INFO L495 AbstractCegarLoop]: Abstraction has 1701 states and 2163 transitions. [2022-11-25 15:44:29,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-25 15:44:29,585 INFO L276 IsEmpty]: Start isEmpty. Operand 1701 states and 2163 transitions. [2022-11-25 15:44:29,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-11-25 15:44:29,587 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:44:29,588 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2022-11-25 15:44:29,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 15:44:29,589 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:44:29,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:44:29,590 INFO L85 PathProgramCache]: Analyzing trace with hash 412636112, now seen corresponding path program 1 times [2022-11-25 15:44:29,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:44:29,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739526216] [2022-11-25 15:44:29,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:44:29,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:44:29,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:29,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 15:44:29,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:29,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 15:44:29,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:29,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 15:44:29,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:29,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:44:29,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:29,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 15:44:29,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:29,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-25 15:44:29,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:29,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-25 15:44:29,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:29,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-25 15:44:29,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:29,838 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-25 15:44:29,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:44:29,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739526216] [2022-11-25 15:44:29,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739526216] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:44:29,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:44:29,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 15:44:29,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779223915] [2022-11-25 15:44:29,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:44:29,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 15:44:29,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:44:29,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 15:44:29,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-25 15:44:29,841 INFO L87 Difference]: Start difference. First operand 1701 states and 2163 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-25 15:44:30,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:44:30,776 INFO L93 Difference]: Finished difference Result 3228 states and 4127 transitions. [2022-11-25 15:44:30,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-25 15:44:30,776 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 90 [2022-11-25 15:44:30,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:44:30,785 INFO L225 Difference]: With dead ends: 3228 [2022-11-25 15:44:30,786 INFO L226 Difference]: Without dead ends: 1775 [2022-11-25 15:44:30,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2022-11-25 15:44:30,791 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 370 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 15:44:30,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 570 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 15:44:30,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1775 states. [2022-11-25 15:44:30,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1775 to 1480. [2022-11-25 15:44:30,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1480 states, 1168 states have (on average 1.2851027397260273) internal successors, (1501), 1186 states have internal predecessors, (1501), 164 states have call successors, (164), 114 states have call predecessors, (164), 147 states have return successors, (212), 180 states have call predecessors, (212), 162 states have call successors, (212) [2022-11-25 15:44:30,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 1877 transitions. [2022-11-25 15:44:30,953 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 1877 transitions. Word has length 90 [2022-11-25 15:44:30,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:44:30,954 INFO L495 AbstractCegarLoop]: Abstraction has 1480 states and 1877 transitions. [2022-11-25 15:44:30,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-25 15:44:30,954 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 1877 transitions. [2022-11-25 15:44:30,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-11-25 15:44:30,961 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:44:30,961 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2022-11-25 15:44:30,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 15:44:30,962 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:44:30,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:44:30,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1943169138, now seen corresponding path program 1 times [2022-11-25 15:44:30,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:44:30,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153424852] [2022-11-25 15:44:30,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:44:30,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:44:30,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:31,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 15:44:31,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:31,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 15:44:31,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:31,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 15:44:31,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:31,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:44:31,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:31,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 15:44:31,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:31,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-25 15:44:31,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:31,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-25 15:44:31,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:31,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-25 15:44:31,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:31,091 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-25 15:44:31,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:44:31,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153424852] [2022-11-25 15:44:31,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153424852] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:44:31,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:44:31,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 15:44:31,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778321844] [2022-11-25 15:44:31,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:44:31,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 15:44:31,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:44:31,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 15:44:31,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-25 15:44:31,094 INFO L87 Difference]: Start difference. First operand 1480 states and 1877 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 4 states have internal predecessors, (69), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-25 15:44:31,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:44:31,804 INFO L93 Difference]: Finished difference Result 4632 states and 5989 transitions. [2022-11-25 15:44:31,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 15:44:31,805 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 4 states have internal predecessors, (69), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 90 [2022-11-25 15:44:31,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:44:31,818 INFO L225 Difference]: With dead ends: 4632 [2022-11-25 15:44:31,819 INFO L226 Difference]: Without dead ends: 3163 [2022-11-25 15:44:31,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-11-25 15:44:31,824 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 371 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 15:44:31,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 449 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 15:44:31,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3163 states. [2022-11-25 15:44:32,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3163 to 2949. [2022-11-25 15:44:32,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2949 states, 2317 states have (on average 1.2641346568839016) internal successors, (2929), 2364 states have internal predecessors, (2929), 325 states have call successors, (325), 227 states have call predecessors, (325), 306 states have return successors, (495), 359 states have call predecessors, (495), 323 states have call successors, (495) [2022-11-25 15:44:32,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2949 states to 2949 states and 3749 transitions. [2022-11-25 15:44:32,120 INFO L78 Accepts]: Start accepts. Automaton has 2949 states and 3749 transitions. Word has length 90 [2022-11-25 15:44:32,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:44:32,122 INFO L495 AbstractCegarLoop]: Abstraction has 2949 states and 3749 transitions. [2022-11-25 15:44:32,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 4 states have internal predecessors, (69), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-25 15:44:32,122 INFO L276 IsEmpty]: Start isEmpty. Operand 2949 states and 3749 transitions. [2022-11-25 15:44:32,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-11-25 15:44:32,125 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:44:32,125 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2022-11-25 15:44:32,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 15:44:32,126 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:44:32,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:44:32,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1293960080, now seen corresponding path program 1 times [2022-11-25 15:44:32,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:44:32,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110745598] [2022-11-25 15:44:32,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:44:32,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:44:32,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:32,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 15:44:32,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:32,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 15:44:32,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:32,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 15:44:32,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:32,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:44:32,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:32,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 15:44:32,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:32,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-25 15:44:32,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:32,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-25 15:44:32,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:32,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-25 15:44:32,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:32,213 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-25 15:44:32,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:44:32,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110745598] [2022-11-25 15:44:32,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110745598] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:44:32,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:44:32,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 15:44:32,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986619180] [2022-11-25 15:44:32,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:44:32,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 15:44:32,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:44:32,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 15:44:32,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 15:44:32,217 INFO L87 Difference]: Start difference. First operand 2949 states and 3749 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-25 15:44:32,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:44:32,591 INFO L93 Difference]: Finished difference Result 4533 states and 5733 transitions. [2022-11-25 15:44:32,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 15:44:32,592 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 90 [2022-11-25 15:44:32,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:44:32,601 INFO L225 Difference]: With dead ends: 4533 [2022-11-25 15:44:32,601 INFO L226 Difference]: Without dead ends: 1595 [2022-11-25 15:44:32,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-25 15:44:32,609 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 294 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 15:44:32,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 195 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 15:44:32,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1595 states. [2022-11-25 15:44:32,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1595 to 1480. [2022-11-25 15:44:32,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1480 states, 1168 states have (on average 1.2534246575342465) internal successors, (1464), 1186 states have internal predecessors, (1464), 164 states have call successors, (164), 114 states have call predecessors, (164), 147 states have return successors, (212), 180 states have call predecessors, (212), 162 states have call successors, (212) [2022-11-25 15:44:32,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 1840 transitions. [2022-11-25 15:44:32,776 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 1840 transitions. Word has length 90 [2022-11-25 15:44:32,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:44:32,776 INFO L495 AbstractCegarLoop]: Abstraction has 1480 states and 1840 transitions. [2022-11-25 15:44:32,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-25 15:44:32,776 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 1840 transitions. [2022-11-25 15:44:32,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-11-25 15:44:32,778 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:44:32,778 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2022-11-25 15:44:32,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 15:44:32,778 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:44:32,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:44:32,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1668589887, now seen corresponding path program 1 times [2022-11-25 15:44:32,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:44:32,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681139553] [2022-11-25 15:44:32,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:44:32,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:44:32,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:32,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 15:44:32,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:32,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 15:44:32,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:32,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 15:44:32,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:32,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:44:32,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:32,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 15:44:32,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:32,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-25 15:44:32,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:32,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-25 15:44:32,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:32,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-25 15:44:32,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:32,931 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 15:44:32,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:44:32,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681139553] [2022-11-25 15:44:32,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681139553] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:44:32,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:44:32,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-25 15:44:32,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541902091] [2022-11-25 15:44:32,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:44:32,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 15:44:32,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:44:32,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 15:44:32,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-25 15:44:32,934 INFO L87 Difference]: Start difference. First operand 1480 states and 1840 transitions. Second operand has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 6 states have internal predecessors, (73), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-25 15:44:34,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:44:34,357 INFO L93 Difference]: Finished difference Result 3898 states and 4923 transitions. [2022-11-25 15:44:34,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-25 15:44:34,357 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 6 states have internal predecessors, (73), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 91 [2022-11-25 15:44:34,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:44:34,372 INFO L225 Difference]: With dead ends: 3898 [2022-11-25 15:44:34,373 INFO L226 Difference]: Without dead ends: 2278 [2022-11-25 15:44:34,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=720, Unknown=0, NotChecked=0, Total=930 [2022-11-25 15:44:34,378 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 1335 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 436 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1353 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 1229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 436 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-25 15:44:34,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1353 Valid, 509 Invalid, 1229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [436 Valid, 793 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-25 15:44:34,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2278 states. [2022-11-25 15:44:34,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2278 to 2101. [2022-11-25 15:44:34,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2101 states, 1635 states have (on average 1.2269113149847095) internal successors, (2006), 1661 states have internal predecessors, (2006), 241 states have call successors, (241), 162 states have call predecessors, (241), 224 states have return successors, (343), 278 states have call predecessors, (343), 239 states have call successors, (343) [2022-11-25 15:44:34,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 2590 transitions. [2022-11-25 15:44:34,591 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 2590 transitions. Word has length 91 [2022-11-25 15:44:34,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:44:34,591 INFO L495 AbstractCegarLoop]: Abstraction has 2101 states and 2590 transitions. [2022-11-25 15:44:34,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 6 states have internal predecessors, (73), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-25 15:44:34,592 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 2590 transitions. [2022-11-25 15:44:34,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-11-25 15:44:34,594 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:44:34,595 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 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, 1, 1, 1] [2022-11-25 15:44:34,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 15:44:34,595 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:44:34,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:44:34,596 INFO L85 PathProgramCache]: Analyzing trace with hash -633049043, now seen corresponding path program 1 times [2022-11-25 15:44:34,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:44:34,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108624771] [2022-11-25 15:44:34,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:44:34,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:44:34,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:34,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 15:44:34,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:34,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 15:44:34,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:34,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 15:44:34,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:34,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:44:34,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:34,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 15:44:34,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:34,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-25 15:44:34,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:34,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-25 15:44:34,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:34,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-25 15:44:34,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:34,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-25 15:44:34,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:34,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-25 15:44:34,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:34,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-25 15:44:34,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:34,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:44:34,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:34,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 15:44:34,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:34,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-25 15:44:34,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:34,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-25 15:44:34,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:34,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-25 15:44:34,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:34,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-11-25 15:44:34,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:34,812 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-11-25 15:44:34,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:44:34,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108624771] [2022-11-25 15:44:34,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108624771] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:44:34,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760976186] [2022-11-25 15:44:34,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:44:34,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:44:34,813 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af816cbd-00a2-4b0e-92b2-d01ca13d4bad/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:44:34,821 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af816cbd-00a2-4b0e-92b2-d01ca13d4bad/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:44:34,860 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af816cbd-00a2-4b0e-92b2-d01ca13d4bad/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 15:44:34,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:34,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-25 15:44:35,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:44:35,226 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-11-25 15:44:35,238 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:44:35,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1760976186] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:44:35,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 15:44:35,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-11-25 15:44:35,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839247720] [2022-11-25 15:44:35,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:44:35,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:44:35,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:44:35,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:44:35,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-11-25 15:44:35,241 INFO L87 Difference]: Start difference. First operand 2101 states and 2590 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-25 15:44:35,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:44:35,641 INFO L93 Difference]: Finished difference Result 6027 states and 7419 transitions. [2022-11-25 15:44:35,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:44:35,642 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 162 [2022-11-25 15:44:35,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:44:35,659 INFO L225 Difference]: With dead ends: 6027 [2022-11-25 15:44:35,660 INFO L226 Difference]: Without dead ends: 4013 [2022-11-25 15:44:35,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-11-25 15:44:35,667 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 61 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:44:35,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 281 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:44:35,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4013 states. [2022-11-25 15:44:36,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4013 to 3971. [2022-11-25 15:44:36,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3971 states, 3092 states have (on average 1.2160413971539457) internal successors, (3760), 3141 states have internal predecessors, (3760), 448 states have call successors, (448), 323 states have call predecessors, (448), 430 states have return successors, (611), 507 states have call predecessors, (611), 446 states have call successors, (611) [2022-11-25 15:44:36,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3971 states to 3971 states and 4819 transitions. [2022-11-25 15:44:36,056 INFO L78 Accepts]: Start accepts. Automaton has 3971 states and 4819 transitions. Word has length 162 [2022-11-25 15:44:36,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:44:36,057 INFO L495 AbstractCegarLoop]: Abstraction has 3971 states and 4819 transitions. [2022-11-25 15:44:36,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-25 15:44:36,057 INFO L276 IsEmpty]: Start isEmpty. Operand 3971 states and 4819 transitions. [2022-11-25 15:44:36,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-11-25 15:44:36,061 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:44:36,061 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1] [2022-11-25 15:44:36,074 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af816cbd-00a2-4b0e-92b2-d01ca13d4bad/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 15:44:36,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af816cbd-00a2-4b0e-92b2-d01ca13d4bad/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-25 15:44:36,268 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:44:36,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:44:36,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1912569076, now seen corresponding path program 1 times [2022-11-25 15:44:36,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:44:36,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413167660] [2022-11-25 15:44:36,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:44:36,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:44:36,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:36,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 15:44:36,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:36,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 15:44:36,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:36,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 15:44:36,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:36,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:44:36,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:36,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 15:44:36,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:36,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-25 15:44:36,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:36,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-25 15:44:36,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:36,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-25 15:44:36,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:36,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-25 15:44:36,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:36,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-25 15:44:36,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:36,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-25 15:44:36,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:36,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:44:36,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:36,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 15:44:36,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:36,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-11-25 15:44:36,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:36,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-25 15:44:36,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:36,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-25 15:44:36,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:36,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:44:36,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:36,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 15:44:36,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:36,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-11-25 15:44:36,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:36,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-11-25 15:44:36,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:36,525 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2022-11-25 15:44:36,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:44:36,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413167660] [2022-11-25 15:44:36,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413167660] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:44:36,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501864704] [2022-11-25 15:44:36,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:44:36,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:44:36,526 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af816cbd-00a2-4b0e-92b2-d01ca13d4bad/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:44:36,527 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af816cbd-00a2-4b0e-92b2-d01ca13d4bad/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:44:36,557 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af816cbd-00a2-4b0e-92b2-d01ca13d4bad/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 15:44:36,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:36,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-25 15:44:36,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:44:36,928 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-11-25 15:44:36,928 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:44:36,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1501864704] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:44:36,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 15:44:36,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-11-25 15:44:36,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044752544] [2022-11-25 15:44:36,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:44:36,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:44:36,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:44:36,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:44:36,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-11-25 15:44:36,931 INFO L87 Difference]: Start difference. First operand 3971 states and 4819 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-25 15:44:37,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:44:37,596 INFO L93 Difference]: Finished difference Result 11891 states and 14427 transitions. [2022-11-25 15:44:37,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:44:37,597 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 194 [2022-11-25 15:44:37,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:44:37,650 INFO L225 Difference]: With dead ends: 11891 [2022-11-25 15:44:37,650 INFO L226 Difference]: Without dead ends: 7931 [2022-11-25 15:44:37,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-11-25 15:44:37,662 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 52 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:44:37,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 281 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:44:37,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7931 states. [2022-11-25 15:44:38,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7931 to 7921. [2022-11-25 15:44:38,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7921 states, 6170 states have (on average 1.2092382495948135) internal successors, (7461), 6266 states have internal predecessors, (7461), 890 states have call successors, (890), 645 states have call predecessors, (890), 860 states have return successors, (1218), 1010 states have call predecessors, (1218), 888 states have call successors, (1218) [2022-11-25 15:44:38,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7921 states to 7921 states and 9569 transitions. [2022-11-25 15:44:38,569 INFO L78 Accepts]: Start accepts. Automaton has 7921 states and 9569 transitions. Word has length 194 [2022-11-25 15:44:38,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:44:38,570 INFO L495 AbstractCegarLoop]: Abstraction has 7921 states and 9569 transitions. [2022-11-25 15:44:38,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-25 15:44:38,571 INFO L276 IsEmpty]: Start isEmpty. Operand 7921 states and 9569 transitions. [2022-11-25 15:44:38,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-11-25 15:44:38,577 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:44:38,577 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1] [2022-11-25 15:44:38,590 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af816cbd-00a2-4b0e-92b2-d01ca13d4bad/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 15:44:38,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af816cbd-00a2-4b0e-92b2-d01ca13d4bad/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-25 15:44:38,785 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:44:38,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:44:38,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1015175798, now seen corresponding path program 1 times [2022-11-25 15:44:38,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:44:38,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986635086] [2022-11-25 15:44:38,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:44:38,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:44:38,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:38,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 15:44:38,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:38,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 15:44:38,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:38,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 15:44:38,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:38,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:44:38,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:38,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 15:44:38,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:38,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-25 15:44:38,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:38,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-25 15:44:38,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:38,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-25 15:44:38,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:39,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-25 15:44:39,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:39,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-25 15:44:39,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:39,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-25 15:44:39,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:39,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:44:39,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:39,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 15:44:39,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:39,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-11-25 15:44:39,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:39,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-25 15:44:39,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:39,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-25 15:44:39,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:39,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:44:39,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:39,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 15:44:39,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:39,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-11-25 15:44:39,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:39,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-11-25 15:44:39,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:39,039 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2022-11-25 15:44:39,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:44:39,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986635086] [2022-11-25 15:44:39,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986635086] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:44:39,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739912135] [2022-11-25 15:44:39,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:44:39,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:44:39,040 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af816cbd-00a2-4b0e-92b2-d01ca13d4bad/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:44:39,041 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af816cbd-00a2-4b0e-92b2-d01ca13d4bad/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:44:39,065 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af816cbd-00a2-4b0e-92b2-d01ca13d4bad/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 15:44:39,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:39,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-25 15:44:39,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:44:39,476 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-11-25 15:44:39,476 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:44:39,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1739912135] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:44:39,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 15:44:39,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-11-25 15:44:39,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408980748] [2022-11-25 15:44:39,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:44:39,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:44:39,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:44:39,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:44:39,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-11-25 15:44:39,482 INFO L87 Difference]: Start difference. First operand 7921 states and 9569 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2022-11-25 15:44:40,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:44:40,131 INFO L93 Difference]: Finished difference Result 14427 states and 17761 transitions. [2022-11-25 15:44:40,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:44:40,132 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 194 [2022-11-25 15:44:40,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:44:40,136 INFO L225 Difference]: With dead ends: 14427 [2022-11-25 15:44:40,136 INFO L226 Difference]: Without dead ends: 0 [2022-11-25 15:44:40,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-11-25 15:44:40,165 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 25 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:44:40,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 129 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:44:40,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-25 15:44:40,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-25 15:44:40,167 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-25 15:44:40,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-25 15:44:40,168 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 194 [2022-11-25 15:44:40,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:44:40,169 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-25 15:44:40,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2022-11-25 15:44:40,169 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-25 15:44:40,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-25 15:44:40,172 INFO L805 garLoopResultBuilder]: Registering result SAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-25 15:44:40,184 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af816cbd-00a2-4b0e-92b2-d01ca13d4bad/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 15:44:40,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af816cbd-00a2-4b0e-92b2-d01ca13d4bad/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-25 15:44:40,381 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-25 15:45:28,392 INFO L895 garLoopResultBuilder]: At program point L385(line 385) the Hoare annotation is: (let ((.cse0 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|)))) (and (or (not (<= ~c_dr_pc~0 0)) (not (= |old(~c_dr_st~0)| 0)) .cse0 (not (= 1 ~c_dr_i~0))) (or .cse0 (not (= ~c_dr_pc~0 1))))) [2022-11-25 15:45:28,393 INFO L895 garLoopResultBuilder]: At program point L387-2(lines 387 391) the Hoare annotation is: (let ((.cse2 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse9 (= ~p_dw_st~0 0)) (.cse6 (not (<= ~c_dr_pc~0 0))) (.cse7 (not (= |old(~c_dr_st~0)| 0))) (.cse0 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse1 (< 0 (+ activate_threads_~tmp~1 1))) (.cse3 (<= activate_threads_~tmp~1 0)) (.cse4 (= ~p_dw_pc~0 1)) (.cse5 (not (= ~q_read_ev~0 2))) (.cse10 (not (= 1 ~c_dr_i~0)))) (and (or (and .cse0 .cse1 .cse2 .cse3) .cse4 (not (= ~c_dr_pc~0 1)) .cse5) (let ((.cse8 (= ~c_dr_st~0 0))) (or .cse6 .cse7 (and .cse0 .cse8 .cse2) (and .cse8 .cse2 .cse9) .cse10)) (or .cse6 (not .cse9) .cse7 (= |old(~p_dw_st~0)| 0) (not (<= 2 ~fast_clk_edge~0)) (not .cse4) .cse10) (or .cse6 .cse7 (and .cse0 .cse1 .cse3) .cse4 .cse5 .cse10))) [2022-11-25 15:45:28,393 INFO L899 garLoopResultBuilder]: For program point L385-1(line 385) no Hoare annotation was computed. [2022-11-25 15:45:28,393 INFO L895 garLoopResultBuilder]: At program point activate_threadsENTRY(lines 379 403) the Hoare annotation is: (let ((.cse0 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|)))) (and (or (not (<= ~c_dr_pc~0 0)) (not (= |old(~c_dr_st~0)| 0)) .cse0 (not (= 1 ~c_dr_i~0))) (or .cse0 (not (= ~c_dr_pc~0 1))))) [2022-11-25 15:45:28,393 INFO L899 garLoopResultBuilder]: For program point L395(lines 395 399) no Hoare annotation was computed. [2022-11-25 15:45:28,394 INFO L899 garLoopResultBuilder]: For program point activate_threadsEXIT(lines 379 403) no Hoare annotation was computed. [2022-11-25 15:45:28,394 INFO L899 garLoopResultBuilder]: For program point L393(line 393) no Hoare annotation was computed. [2022-11-25 15:45:28,394 INFO L899 garLoopResultBuilder]: For program point L395-2(lines 379 403) no Hoare annotation was computed. [2022-11-25 15:45:28,394 INFO L899 garLoopResultBuilder]: For program point L387(lines 387 391) no Hoare annotation was computed. [2022-11-25 15:45:28,394 INFO L899 garLoopResultBuilder]: For program point exists_runnable_threadEXIT(lines 287 306) no Hoare annotation was computed. [2022-11-25 15:45:28,394 INFO L902 garLoopResultBuilder]: At program point exists_runnable_threadENTRY(lines 287 306) the Hoare annotation is: true [2022-11-25 15:45:28,394 INFO L902 garLoopResultBuilder]: At program point L303(lines 290 305) the Hoare annotation is: true [2022-11-25 15:45:28,395 INFO L899 garLoopResultBuilder]: For program point L295(lines 295 300) no Hoare annotation was computed. [2022-11-25 15:45:28,395 INFO L899 garLoopResultBuilder]: For program point L291(lines 291 301) no Hoare annotation was computed. [2022-11-25 15:45:28,395 INFO L899 garLoopResultBuilder]: For program point exists_runnable_threadFINAL(lines 287 306) no Hoare annotation was computed. [2022-11-25 15:45:28,395 INFO L899 garLoopResultBuilder]: For program point L96(lines 96 101) no Hoare annotation was computed. [2022-11-25 15:45:28,395 INFO L899 garLoopResultBuilder]: For program point L95(lines 95 104) no Hoare annotation was computed. [2022-11-25 15:45:28,395 INFO L899 garLoopResultBuilder]: For program point L95-2(lines 94 118) no Hoare annotation was computed. [2022-11-25 15:45:28,396 INFO L902 garLoopResultBuilder]: At program point is_do_read_c_triggeredENTRY(lines 91 119) the Hoare annotation is: true [2022-11-25 15:45:28,396 INFO L895 garLoopResultBuilder]: At program point L116(lines 94 118) the Hoare annotation is: (or (not (<= ~c_dr_pc~0 0)) (not (= ~c_dr_st~0 0)) (and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1)) (not (= 1 ~c_dr_i~0))) [2022-11-25 15:45:28,396 INFO L899 garLoopResultBuilder]: For program point is_do_read_c_triggeredFINAL(lines 91 119) no Hoare annotation was computed. [2022-11-25 15:45:28,396 INFO L899 garLoopResultBuilder]: For program point L106(lines 106 111) no Hoare annotation was computed. [2022-11-25 15:45:28,396 INFO L899 garLoopResultBuilder]: For program point L105-1(lines 105 114) no Hoare annotation was computed. [2022-11-25 15:45:28,396 INFO L899 garLoopResultBuilder]: For program point is_do_read_c_triggeredEXIT(lines 91 119) no Hoare annotation was computed. [2022-11-25 15:45:28,397 INFO L895 garLoopResultBuilder]: At program point fire_delta_eventsENTRY(lines 307 324) the Hoare annotation is: (let ((.cse0 (and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0)))) (and (or .cse0 (not (= ~c_dr_pc~0 1))) (or (not (<= ~c_dr_pc~0 0)) (not (= ~c_dr_st~0 0)) .cse0 (not (= 1 ~c_dr_i~0))))) [2022-11-25 15:45:28,397 INFO L899 garLoopResultBuilder]: For program point L316-1(lines 307 324) no Hoare annotation was computed. [2022-11-25 15:45:28,397 INFO L899 garLoopResultBuilder]: For program point L311-1(lines 310 323) no Hoare annotation was computed. [2022-11-25 15:45:28,397 INFO L899 garLoopResultBuilder]: For program point fire_delta_eventsEXIT(lines 307 324) no Hoare annotation was computed. [2022-11-25 15:45:28,397 INFO L899 garLoopResultBuilder]: For program point L258-1(lines 254 268) no Hoare annotation was computed. [2022-11-25 15:45:28,398 INFO L895 garLoopResultBuilder]: At program point L49(lines 32 51) the Hoare annotation is: (let ((.cse1 (not (= ~c_dr_pc~0 1))) (.cse0 (= ~q_req_up~0 0)) (.cse3 (not (<= ~c_dr_pc~0 0))) (.cse4 (not (= ~c_dr_st~0 0))) (.cse2 (not (= |old(~q_req_up~0)| 0))) (.cse5 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1) (or .cse1 .cse2) (or .cse3 .cse4 .cse0 .cse5) (or .cse3 .cse4 .cse2 .cse5))) [2022-11-25 15:45:28,398 INFO L895 garLoopResultBuilder]: At program point update_channelsENTRY(lines 254 268) the Hoare annotation is: (let ((.cse0 (and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|)))) (and (or .cse0 (not (= ~c_dr_pc~0 1))) (or (not (<= ~c_dr_pc~0 0)) .cse0 (not (= ~c_dr_st~0 0)) (not (= 1 ~c_dr_i~0))))) [2022-11-25 15:45:28,398 INFO L899 garLoopResultBuilder]: For program point update_channelsEXIT(lines 254 268) no Hoare annotation was computed. [2022-11-25 15:45:28,398 INFO L899 garLoopResultBuilder]: For program point L41-1(lines 41 45) no Hoare annotation was computed. [2022-11-25 15:45:28,398 INFO L899 garLoopResultBuilder]: For program point L36(lines 36 40) no Hoare annotation was computed. [2022-11-25 15:45:28,398 INFO L899 garLoopResultBuilder]: For program point L36-2(lines 35 50) no Hoare annotation was computed. [2022-11-25 15:45:28,399 INFO L899 garLoopResultBuilder]: For program point reset_delta_eventsEXIT(lines 325 342) no Hoare annotation was computed. [2022-11-25 15:45:28,399 INFO L899 garLoopResultBuilder]: For program point L334-1(lines 325 342) no Hoare annotation was computed. [2022-11-25 15:45:28,399 INFO L899 garLoopResultBuilder]: For program point L329-1(lines 328 341) no Hoare annotation was computed. [2022-11-25 15:45:28,399 INFO L895 garLoopResultBuilder]: At program point reset_delta_eventsENTRY(lines 325 342) the Hoare annotation is: (let ((.cse0 (and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0)))) (and (or .cse0 (not (= ~c_dr_pc~0 1))) (or (not (<= ~c_dr_pc~0 0)) (not (= ~c_dr_st~0 0)) .cse0 (not (= 1 ~c_dr_i~0))))) [2022-11-25 15:45:28,399 INFO L899 garLoopResultBuilder]: For program point L514-1(line 514) no Hoare annotation was computed. [2022-11-25 15:45:28,400 INFO L899 garLoopResultBuilder]: For program point L415(lines 415 419) no Hoare annotation was computed. [2022-11-25 15:45:28,400 INFO L899 garLoopResultBuilder]: For program point L415-1(lines 410 450) no Hoare annotation was computed. [2022-11-25 15:45:28,400 INFO L899 garLoopResultBuilder]: For program point L349(lines 349 356) no Hoare annotation was computed. [2022-11-25 15:45:28,400 INFO L895 garLoopResultBuilder]: At program point L349-2(lines 345 360) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-11-25 15:45:28,400 INFO L899 garLoopResultBuilder]: For program point L465(lines 465 470) no Hoare annotation was computed. [2022-11-25 15:45:28,400 INFO L899 garLoopResultBuilder]: For program point L234(lines 234 246) no Hoare annotation was computed. [2022-11-25 15:45:28,400 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-25 15:45:28,401 INFO L899 garLoopResultBuilder]: For program point L218-1(lines 218 228) no Hoare annotation was computed. [2022-11-25 15:45:28,401 INFO L899 garLoopResultBuilder]: For program point L152(lines 152 160) no Hoare annotation was computed. [2022-11-25 15:45:28,401 INFO L895 garLoopResultBuilder]: At program point L499(line 499) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-11-25 15:45:28,401 INFO L899 garLoopResultBuilder]: For program point L499-1(line 499) no Hoare annotation was computed. [2022-11-25 15:45:28,401 INFO L899 garLoopResultBuilder]: For program point L235(lines 235 241) no Hoare annotation was computed. [2022-11-25 15:45:28,401 INFO L899 garLoopResultBuilder]: For program point L202(lines 202 206) no Hoare annotation was computed. [2022-11-25 15:45:28,402 INFO L895 garLoopResultBuilder]: At program point L153(lines 148 192) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 1))) (or (and (= ~c_dr_st~0 0) (not (= ~p_dw_st~0 0)) (= 1 ~c_dr_i~0) .cse0 (<= ~c_dr_pc~0 0)) (and (= ~c_dr_pc~0 1) .cse0))) [2022-11-25 15:45:28,402 INFO L895 garLoopResultBuilder]: At program point L203(lines 198 252) the Hoare annotation is: false [2022-11-25 15:45:28,402 INFO L895 garLoopResultBuilder]: At program point L484(line 484) the Hoare annotation is: (and (= ~c_dr_st~0 0) (= ~q_write_ev~0 ~q_read_ev~0) (= 1 ~c_dr_i~0) (= ~q_req_up~0 0) (= ~p_dw_st~0 0) (<= 2 ~slow_clk_edge~0) (= ~q_read_ev~0 2) (<= 2 ~fast_clk_edge~0) (= ~q_req_up~0 ~p_dw_pc~0) (= ~c_dr_pc~0 ~q_req_up~0)) [2022-11-25 15:45:28,402 INFO L899 garLoopResultBuilder]: For program point L484-1(line 484) no Hoare annotation was computed. [2022-11-25 15:45:28,402 INFO L895 garLoopResultBuilder]: At program point L451(lines 404 456) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-11-25 15:45:28,403 INFO L895 garLoopResultBuilder]: At program point L435(lines 410 450) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-11-25 15:45:28,403 INFO L895 garLoopResultBuilder]: At program point L171(lines 148 192) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (not (= ~p_dw_st~0 0)) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-11-25 15:45:28,403 INFO L895 garLoopResultBuilder]: At program point L551(lines 535 553) the Hoare annotation is: (and (= ~c_dr_st~0 0) (= ~q_write_ev~0 ~q_read_ev~0) (= 1 ~c_dr_i~0) (= ~q_req_up~0 0) (= ~p_dw_st~0 0) (<= 2 ~slow_clk_edge~0) (= ~q_read_ev~0 2) (<= 2 ~fast_clk_edge~0) (= ~q_req_up~0 ~p_dw_pc~0) (= ~c_dr_pc~0 ~q_req_up~0)) [2022-11-25 15:45:28,403 INFO L895 garLoopResultBuilder]: At program point L188(lines 145 193) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (not (= ~p_dw_st~0 0)) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-11-25 15:45:28,403 INFO L899 garLoopResultBuilder]: For program point L155(lines 155 159) no Hoare annotation was computed. [2022-11-25 15:45:28,403 INFO L895 garLoopResultBuilder]: At program point L370-1(lines 361 378) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-11-25 15:45:28,404 INFO L895 garLoopResultBuilder]: At program point L486(line 486) the Hoare annotation is: (let ((.cse0 (= ~c_dr_st~0 0)) (.cse1 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse2 (= 1 ~c_dr_i~0)) (.cse3 (= ~q_req_up~0 0)) (.cse4 (= ~q_read_ev~0 2)) (.cse5 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse6 (= ~c_dr_pc~0 ~q_req_up~0))) (or (and .cse0 (not (= ~p_dw_st~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 (<= 2 ~slow_clk_edge~0) .cse4 (<= 2 ~fast_clk_edge~0) .cse5 .cse6))) [2022-11-25 15:45:28,404 INFO L895 garLoopResultBuilder]: At program point L486-1(line 486) the Hoare annotation is: (let ((.cse0 (= ~c_dr_st~0 0)) (.cse1 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse2 (= 1 ~c_dr_i~0)) (.cse3 (= ~q_req_up~0 0)) (.cse4 (= ~q_read_ev~0 2)) (.cse5 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse6 (= ~c_dr_pc~0 ~q_req_up~0))) (or (and .cse0 (not (= ~p_dw_st~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 (<= 2 ~slow_clk_edge~0) .cse4 (<= 2 ~fast_clk_edge~0) .cse5 .cse6))) [2022-11-25 15:45:28,404 INFO L899 garLoopResultBuilder]: For program point L420(lines 410 450) no Hoare annotation was computed. [2022-11-25 15:45:28,404 INFO L895 garLoopResultBuilder]: At program point L503(line 503) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-11-25 15:45:28,404 INFO L895 garLoopResultBuilder]: At program point L503-1(line 503) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-11-25 15:45:28,405 INFO L895 garLoopResultBuilder]: At program point L239(line 239) the Hoare annotation is: false [2022-11-25 15:45:28,405 INFO L895 garLoopResultBuilder]: At program point L487(line 487) the Hoare annotation is: (let ((.cse0 (= ~c_dr_st~0 0)) (.cse1 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse2 (= 1 ~c_dr_i~0)) (.cse3 (= ~q_req_up~0 0)) (.cse4 (= ~q_read_ev~0 2)) (.cse5 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse6 (= ~c_dr_pc~0 ~q_req_up~0))) (or (and .cse0 (not (= ~p_dw_st~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 (<= 2 ~slow_clk_edge~0) .cse4 (<= 2 ~fast_clk_edge~0) .cse5 .cse6))) [2022-11-25 15:45:28,405 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-25 15:45:28,405 INFO L895 garLoopResultBuilder]: At program point L504(line 504) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-11-25 15:45:28,405 INFO L899 garLoopResultBuilder]: For program point L273(lines 273 277) no Hoare annotation was computed. [2022-11-25 15:45:28,405 INFO L899 garLoopResultBuilder]: For program point L273-2(lines 272 285) no Hoare annotation was computed. [2022-11-25 15:45:28,406 INFO L895 garLoopResultBuilder]: At program point L505(line 505) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-11-25 15:45:28,406 INFO L895 garLoopResultBuilder]: At program point L472(lines 461 474) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-11-25 15:45:28,406 INFO L899 garLoopResultBuilder]: For program point L439(lines 439 446) no Hoare annotation was computed. [2022-11-25 15:45:28,406 INFO L895 garLoopResultBuilder]: At program point L473(lines 457 475) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-11-25 15:45:28,406 INFO L899 garLoopResultBuilder]: For program point L523(lines 523 527) no Hoare annotation was computed. [2022-11-25 15:45:28,406 INFO L899 garLoopResultBuilder]: For program point L424(lines 424 431) no Hoare annotation was computed. [2022-11-25 15:45:28,407 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-25 15:45:28,407 INFO L895 garLoopResultBuilder]: At program point L491-1(lines 488 528) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-11-25 15:45:28,407 INFO L899 garLoopResultBuilder]: For program point L508(line 508) no Hoare annotation was computed. [2022-11-25 15:45:28,407 INFO L895 garLoopResultBuilder]: At program point L244(line 244) the Hoare annotation is: false [2022-11-25 15:45:28,407 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2022-11-25 15:45:28,407 INFO L902 garLoopResultBuilder]: At program point L244-1(lines 198 252) the Hoare annotation is: true [2022-11-25 15:45:28,408 INFO L899 garLoopResultBuilder]: For program point L492(line 492) no Hoare annotation was computed. [2022-11-25 15:45:28,408 INFO L895 garLoopResultBuilder]: At program point L278-1(lines 269 286) the Hoare annotation is: (let ((.cse0 (= ~c_dr_st~0 0)) (.cse1 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse2 (= 1 ~c_dr_i~0)) (.cse3 (= ~q_req_up~0 0)) (.cse4 (= ~q_read_ev~0 2)) (.cse5 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse6 (= ~c_dr_pc~0 ~q_req_up~0))) (or (and .cse0 (not (= ~p_dw_st~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 (<= 2 ~slow_clk_edge~0) .cse4 (<= 2 ~fast_clk_edge~0) .cse5 .cse6))) [2022-11-25 15:45:28,408 INFO L899 garLoopResultBuilder]: For program point L510(lines 510 519) no Hoare annotation was computed. [2022-11-25 15:45:28,408 INFO L899 garLoopResultBuilder]: For program point L510-2(lines 510 519) no Hoare annotation was computed. [2022-11-25 15:45:28,408 INFO L895 garLoopResultBuilder]: At program point L411(line 411) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-11-25 15:45:28,409 INFO L895 garLoopResultBuilder]: At program point L164-1(lines 148 192) the Hoare annotation is: (let ((.cse6 (= ~p_dw_pc~0 1))) (let ((.cse1 (= ~c_dr_st~0 0)) (.cse2 (not (= ~p_dw_st~0 0))) (.cse3 (= 1 ~c_dr_i~0)) (.cse0 (not .cse6)) (.cse4 (<= ~c_dr_pc~0 0)) (.cse5 (= ~q_req_up~0 ~p_dw_pc~0))) (or (and (= ~c_dr_pc~0 1) .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse2 .cse3 .cse0 .cse4) (and .cse6 .cse5 (= ~c_dr_pc~0 ~q_req_up~0))))) [2022-11-25 15:45:28,409 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-25 15:45:28,409 INFO L899 garLoopResultBuilder]: For program point L165(line 165) no Hoare annotation was computed. [2022-11-25 15:45:28,409 INFO L899 garLoopResultBuilder]: For program point L413(line 413) no Hoare annotation was computed. [2022-11-25 15:45:28,409 INFO L895 garLoopResultBuilder]: At program point L248(lines 195 253) the Hoare annotation is: (= ~c_dr_pc~0 1) [2022-11-25 15:45:28,409 INFO L899 garLoopResultBuilder]: For program point L149(lines 149 161) no Hoare annotation was computed. [2022-11-25 15:45:28,410 INFO L902 garLoopResultBuilder]: At program point L529(lines 476 534) the Hoare annotation is: true [2022-11-25 15:45:28,410 INFO L895 garLoopResultBuilder]: At program point L463(line 463) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-11-25 15:45:28,410 INFO L899 garLoopResultBuilder]: For program point L463-1(line 463) no Hoare annotation was computed. [2022-11-25 15:45:28,410 INFO L899 garLoopResultBuilder]: For program point L199(lines 199 207) no Hoare annotation was computed. [2022-11-25 15:45:28,410 INFO L902 garLoopResultBuilder]: At program point L563(lines 554 565) the Hoare annotation is: true [2022-11-25 15:45:28,410 INFO L899 garLoopResultBuilder]: For program point L365(lines 365 369) no Hoare annotation was computed. [2022-11-25 15:45:28,411 INFO L899 garLoopResultBuilder]: For program point L365-2(lines 364 377) no Hoare annotation was computed. [2022-11-25 15:45:28,411 INFO L895 garLoopResultBuilder]: At program point L514(line 514) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-11-25 15:45:28,411 INFO L899 garLoopResultBuilder]: For program point L66-2(lines 65 89) no Hoare annotation was computed. [2022-11-25 15:45:28,411 INFO L895 garLoopResultBuilder]: At program point L87(lines 65 89) the Hoare annotation is: (let ((.cse2 (not (= ~q_read_ev~0 2))) (.cse3 (not (<= ~c_dr_pc~0 0))) (.cse4 (not (= ~c_dr_st~0 0))) (.cse0 (and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))) (.cse1 (= ~p_dw_pc~0 1)) (.cse5 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 (not (= ~c_dr_pc~0 1)) .cse2) (or .cse3 .cse4 .cse0 .cse1 .cse2 .cse5) (or .cse3 (not (<= 2 ~fast_clk_edge~0)) .cse4 .cse0 (not .cse1) .cse5))) [2022-11-25 15:45:28,411 INFO L899 garLoopResultBuilder]: For program point is_do_write_p_triggeredFINAL(lines 62 90) no Hoare annotation was computed. [2022-11-25 15:45:28,411 INFO L899 garLoopResultBuilder]: For program point is_do_write_p_triggeredEXIT(lines 62 90) no Hoare annotation was computed. [2022-11-25 15:45:28,412 INFO L899 garLoopResultBuilder]: For program point L77(lines 77 82) no Hoare annotation was computed. [2022-11-25 15:45:28,412 INFO L899 garLoopResultBuilder]: For program point L76-1(lines 76 85) no Hoare annotation was computed. [2022-11-25 15:45:28,412 INFO L902 garLoopResultBuilder]: At program point is_do_write_p_triggeredENTRY(lines 62 90) the Hoare annotation is: true [2022-11-25 15:45:28,412 INFO L899 garLoopResultBuilder]: For program point L67(lines 67 72) no Hoare annotation was computed. [2022-11-25 15:45:28,412 INFO L899 garLoopResultBuilder]: For program point L66(lines 66 75) no Hoare annotation was computed. [2022-11-25 15:45:28,412 INFO L899 garLoopResultBuilder]: For program point errorEXIT(lines 15 22) no Hoare annotation was computed. [2022-11-25 15:45:28,413 INFO L899 garLoopResultBuilder]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-11-25 15:45:28,413 INFO L902 garLoopResultBuilder]: At program point errorENTRY(lines 15 22) the Hoare annotation is: true [2022-11-25 15:45:28,413 INFO L899 garLoopResultBuilder]: For program point errorFINAL(lines 15 22) no Hoare annotation was computed. [2022-11-25 15:45:28,417 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:45:28,419 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 15:45:28,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 03:45:28 BoogieIcfgContainer [2022-11-25 15:45:28,441 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 15:45:28,441 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 15:45:28,441 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 15:45:28,442 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 15:45:28,442 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:44:18" (3/4) ... [2022-11-25 15:45:28,445 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-25 15:45:28,452 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2022-11-25 15:45:28,452 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2022-11-25 15:45:28,453 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2022-11-25 15:45:28,453 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2022-11-25 15:45:28,453 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2022-11-25 15:45:28,453 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2022-11-25 15:45:28,453 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2022-11-25 15:45:28,454 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2022-11-25 15:45:28,461 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2022-11-25 15:45:28,461 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-25 15:45:28,462 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-25 15:45:28,462 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-25 15:45:28,491 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((q_req_up == 0 || !(c_dr_pc == 1)) && (!(c_dr_pc == 1) || !(\old(q_req_up) == 0))) && (((!(c_dr_pc <= 0) || !(c_dr_st == 0)) || q_req_up == 0) || !(1 == c_dr_i))) && (((!(c_dr_pc <= 0) || !(c_dr_st == 0)) || !(\old(q_req_up) == 0)) || !(1 == c_dr_i)) [2022-11-25 15:45:28,519 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af816cbd-00a2-4b0e-92b2-d01ca13d4bad/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 15:45:28,519 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 15:45:28,520 INFO L158 Benchmark]: Toolchain (without parser) took 70777.37ms. Allocated memory was 146.8MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 117.5MB in the beginning and 765.9MB in the end (delta: -648.4MB). Peak memory consumption was 625.1MB. Max. memory is 16.1GB. [2022-11-25 15:45:28,520 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 107.0MB. Free memory is still 61.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 15:45:28,521 INFO L158 Benchmark]: CACSL2BoogieTranslator took 318.25ms. Allocated memory is still 146.8MB. Free memory was 117.5MB in the beginning and 103.9MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-25 15:45:28,521 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.46ms. Allocated memory is still 146.8MB. Free memory was 103.9MB in the beginning and 101.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 15:45:28,521 INFO L158 Benchmark]: Boogie Preprocessor took 30.82ms. Allocated memory is still 146.8MB. Free memory was 101.8MB in the beginning and 100.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 15:45:28,522 INFO L158 Benchmark]: RCFGBuilder took 712.04ms. Allocated memory is still 146.8MB. Free memory was 99.7MB in the beginning and 80.8MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-25 15:45:28,522 INFO L158 Benchmark]: TraceAbstraction took 69584.42ms. Allocated memory was 146.8MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 80.3MB in the beginning and 772.2MB in the end (delta: -691.9MB). Peak memory consumption was 851.6MB. Max. memory is 16.1GB. [2022-11-25 15:45:28,522 INFO L158 Benchmark]: Witness Printer took 78.25ms. Allocated memory is still 1.4GB. Free memory was 772.2MB in the beginning and 765.9MB in the end (delta: 6.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-25 15:45:28,524 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.24ms. Allocated memory is still 107.0MB. Free memory is still 61.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 318.25ms. Allocated memory is still 146.8MB. Free memory was 117.5MB in the beginning and 103.9MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.46ms. Allocated memory is still 146.8MB. Free memory was 103.9MB in the beginning and 101.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.82ms. Allocated memory is still 146.8MB. Free memory was 101.8MB in the beginning and 100.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 712.04ms. Allocated memory is still 146.8MB. Free memory was 99.7MB in the beginning and 80.8MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 69584.42ms. Allocated memory was 146.8MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 80.3MB in the beginning and 772.2MB in the end (delta: -691.9MB). Peak memory consumption was 851.6MB. Max. memory is 16.1GB. * Witness Printer took 78.25ms. Allocated memory is still 1.4GB. Free memory was 772.2MB in the beginning and 765.9MB in the end (delta: 6.3MB). Peak memory consumption was 4.2MB. 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: 19]: 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 9 procedures, 119 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 69.5s, OverallIterations: 13, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 13.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 48.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7005 SdHoareTripleChecker+Valid, 6.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6901 mSDsluCounter, 7118 SdHoareTripleChecker+Invalid, 5.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5299 mSDsCounter, 1817 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7335 IncrementalHoareTripleChecker+Invalid, 9152 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1817 mSolverCounterUnsat, 1819 mSDtfsCounter, 7335 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1096 GetRequests, 870 SyntacticMatches, 0 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1170 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7921occurred in iteration=12, InterpolantAutomatonStates: 186, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 1550 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 46 LocationsWithAnnotation, 7671 PreInvPairs, 10405 NumberOfFragments, 1065 HoareAnnotationTreeSize, 7671 FomulaSimplifications, 10320 FormulaSimplificationTreeSizeReduction, 29.8s HoareSimplificationTime, 46 FomulaSimplificationsInter, 785301 FormulaSimplificationTreeSizeReductionInter, 17.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 1873 NumberOfCodeBlocks, 1873 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1857 ConstructedInterpolants, 0 QuantifiedInterpolants, 3640 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1629 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 16 InterpolantComputations, 13 PerfectInterpolantSequences, 862/889 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: 461]: Loop Invariant Derived loop invariant: ((c_dr_st == 0 && 1 == c_dr_i) && c_dr_pc <= 0) || c_dr_pc == 1 - InvariantResult [Line: 476]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 457]: Loop Invariant Derived loop invariant: ((c_dr_st == 0 && 1 == c_dr_i) && c_dr_pc <= 0) || c_dr_pc == 1 - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: (((((__retres1 <= 0 && 0 <= __retres1) || p_dw_pc == 1) || !(c_dr_pc == 1)) || !(q_read_ev == 2)) && (((((!(c_dr_pc <= 0) || !(c_dr_st == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || p_dw_pc == 1) || !(q_read_ev == 2)) || !(1 == c_dr_i))) && (((((!(c_dr_pc <= 0) || !(2 <= fast_clk_edge)) || !(c_dr_st == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_dw_pc == 1)) || !(1 == c_dr_i)) - InvariantResult [Line: 148]: Loop Invariant Derived loop invariant: ((((c_dr_st == 0 && !(p_dw_st == 0)) && 1 == c_dr_i) && p_dw_pc == 1) && c_dr_pc <= 0) || (c_dr_pc == 1 && p_dw_pc == 1) - InvariantResult [Line: 361]: Loop Invariant Derived loop invariant: ((c_dr_st == 0 && 1 == c_dr_i) && c_dr_pc <= 0) || c_dr_pc == 1 - InvariantResult [Line: 148]: Loop Invariant Derived loop invariant: (((c_dr_st == 0 && !(p_dw_st == 0)) && 1 == c_dr_i) && c_dr_pc <= 0) || c_dr_pc == 1 - InvariantResult [Line: 488]: Loop Invariant Derived loop invariant: ((c_dr_st == 0 && 1 == c_dr_i) && c_dr_pc <= 0) || c_dr_pc == 1 - InvariantResult [Line: 94]: Loop Invariant Derived loop invariant: ((!(c_dr_pc <= 0) || !(c_dr_st == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(1 == c_dr_i) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 410]: Loop Invariant Derived loop invariant: ((c_dr_st == 0 && 1 == c_dr_i) && c_dr_pc <= 0) || c_dr_pc == 1 - InvariantResult [Line: 148]: Loop Invariant Derived loop invariant: (((c_dr_pc == 1 && !(p_dw_pc == 1)) || ((((c_dr_st == 0 && !(p_dw_st == 0)) && 1 == c_dr_i) && c_dr_pc <= 0) && q_req_up == p_dw_pc)) || ((((c_dr_st == 0 && !(p_dw_st == 0)) && 1 == c_dr_i) && !(p_dw_pc == 1)) && c_dr_pc <= 0)) || ((p_dw_pc == 1 && q_req_up == p_dw_pc) && c_dr_pc == q_req_up) - InvariantResult [Line: 269]: Loop Invariant Derived loop invariant: (((((((c_dr_st == 0 && !(p_dw_st == 0)) && q_write_ev == q_read_ev) && 1 == c_dr_i) && q_req_up == 0) && q_read_ev == 2) && q_req_up == p_dw_pc) && c_dr_pc == q_req_up) || ((((((((c_dr_st == 0 && q_write_ev == q_read_ev) && 1 == c_dr_i) && q_req_up == 0) && 2 <= slow_clk_edge) && q_read_ev == 2) && 2 <= fast_clk_edge) && q_req_up == p_dw_pc) && c_dr_pc == q_req_up) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (((q_req_up == 0 || !(c_dr_pc == 1)) && (!(c_dr_pc == 1) || !(\old(q_req_up) == 0))) && (((!(c_dr_pc <= 0) || !(c_dr_st == 0)) || q_req_up == 0) || !(1 == c_dr_i))) && (((!(c_dr_pc <= 0) || !(c_dr_st == 0)) || !(\old(q_req_up) == 0)) || !(1 == c_dr_i)) - InvariantResult [Line: 554]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 535]: Loop Invariant Derived loop invariant: ((((((((c_dr_st == 0 && q_write_ev == q_read_ev) && 1 == c_dr_i) && q_req_up == 0) && p_dw_st == 0) && 2 <= slow_clk_edge) && q_read_ev == 2) && 2 <= fast_clk_edge) && q_req_up == p_dw_pc) && c_dr_pc == q_req_up - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: c_dr_pc == 1 - InvariantResult [Line: 345]: Loop Invariant Derived loop invariant: ((c_dr_st == 0 && 1 == c_dr_i) && c_dr_pc <= 0) || c_dr_pc == 1 - InvariantResult [Line: 404]: Loop Invariant Derived loop invariant: ((c_dr_st == 0 && 1 == c_dr_i) && c_dr_pc <= 0) || c_dr_pc == 1 - InvariantResult [Line: 145]: Loop Invariant Derived loop invariant: (((c_dr_st == 0 && !(p_dw_st == 0)) && 1 == c_dr_i) && c_dr_pc <= 0) || c_dr_pc == 1 RESULT: Ultimate proved your program to be correct! [2022-11-25 15:45:28,559 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af816cbd-00a2-4b0e-92b2-d01ca13d4bad/bin/uautomizer-ZsLfNo2U6R/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