./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 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36820bfc-d3ff-4208-89f5-d3c60aa16187/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36820bfc-d3ff-4208-89f5-d3c60aa16187/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36820bfc-d3ff-4208-89f5-d3c60aa16187/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36820bfc-d3ff-4208-89f5-d3c60aa16187/bin/uautomizer-DrprNOufMa/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/pc_sfifo_3.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36820bfc-d3ff-4208-89f5-d3c60aa16187/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36820bfc-d3ff-4208-89f5-d3c60aa16187/bin/uautomizer-DrprNOufMa --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 --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-06 18:56:29,333 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-06 18:56:29,335 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-06 18:56:29,357 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-06 18:56:29,357 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-06 18:56:29,358 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-06 18:56:29,359 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-06 18:56:29,361 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-06 18:56:29,363 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-06 18:56:29,363 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-06 18:56:29,364 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-06 18:56:29,365 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-06 18:56:29,366 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-06 18:56:29,367 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-06 18:56:29,368 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-06 18:56:29,369 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-06 18:56:29,370 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-06 18:56:29,371 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-06 18:56:29,372 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-06 18:56:29,374 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-06 18:56:29,376 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-06 18:56:29,377 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-06 18:56:29,378 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-06 18:56:29,379 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-06 18:56:29,381 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-06 18:56:29,381 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-06 18:56:29,382 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-06 18:56:29,382 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-06 18:56:29,383 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-06 18:56:29,384 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-06 18:56:29,384 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-06 18:56:29,384 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-06 18:56:29,385 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-06 18:56:29,386 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-06 18:56:29,386 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-06 18:56:29,386 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-06 18:56:29,387 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-06 18:56:29,387 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-06 18:56:29,387 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-06 18:56:29,388 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-06 18:56:29,388 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-06 18:56:29,389 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36820bfc-d3ff-4208-89f5-d3c60aa16187/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-06 18:56:29,406 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-06 18:56:29,406 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-06 18:56:29,406 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-06 18:56:29,406 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-06 18:56:29,407 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-06 18:56:29,407 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-06 18:56:29,407 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-06 18:56:29,407 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-06 18:56:29,407 INFO L138 SettingsManager]: * Use SBE=true [2021-12-06 18:56:29,408 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-06 18:56:29,408 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-06 18:56:29,408 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-06 18:56:29,408 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-06 18:56:29,408 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-06 18:56:29,408 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-06 18:56:29,408 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-06 18:56:29,408 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-06 18:56:29,408 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-06 18:56:29,409 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-06 18:56:29,409 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-06 18:56:29,409 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-06 18:56:29,409 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-06 18:56:29,409 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-06 18:56:29,409 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-06 18:56:29,409 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 18:56:29,409 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-06 18:56:29,409 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-06 18:56:29,410 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-06 18:56:29,410 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-06 18:56:29,410 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-06 18:56:29,410 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-06 18:56:29,410 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-06 18:56:29,410 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-06 18:56:29,410 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-06 18:56:29,410 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36820bfc-d3ff-4208-89f5-d3c60aa16187/bin/uautomizer-DrprNOufMa/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_36820bfc-d3ff-4208-89f5-d3c60aa16187/bin/uautomizer-DrprNOufMa 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 [2021-12-06 18:56:29,626 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-06 18:56:29,641 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-06 18:56:29,643 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-06 18:56:29,644 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-06 18:56:29,645 INFO L275 PluginConnector]: CDTParser initialized [2021-12-06 18:56:29,646 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36820bfc-d3ff-4208-89f5-d3c60aa16187/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/systemc/pc_sfifo_3.cil.c [2021-12-06 18:56:29,689 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36820bfc-d3ff-4208-89f5-d3c60aa16187/bin/uautomizer-DrprNOufMa/data/04af2f6a4/fb84ea488d764d769a73c9911d5e7fd0/FLAG6834ae9bf [2021-12-06 18:56:30,093 INFO L306 CDTParser]: Found 1 translation units. [2021-12-06 18:56:30,094 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36820bfc-d3ff-4208-89f5-d3c60aa16187/sv-benchmarks/c/systemc/pc_sfifo_3.cil.c [2021-12-06 18:56:30,101 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36820bfc-d3ff-4208-89f5-d3c60aa16187/bin/uautomizer-DrprNOufMa/data/04af2f6a4/fb84ea488d764d769a73c9911d5e7fd0/FLAG6834ae9bf [2021-12-06 18:56:30,110 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36820bfc-d3ff-4208-89f5-d3c60aa16187/bin/uautomizer-DrprNOufMa/data/04af2f6a4/fb84ea488d764d769a73c9911d5e7fd0 [2021-12-06 18:56:30,112 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-06 18:56:30,113 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-06 18:56:30,114 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-06 18:56:30,114 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-06 18:56:30,117 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-06 18:56:30,117 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:56:30" (1/1) ... [2021-12-06 18:56:30,118 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c26cdb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:56:30, skipping insertion in model container [2021-12-06 18:56:30,118 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:56:30" (1/1) ... [2021-12-06 18:56:30,123 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-06 18:56:30,143 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-06 18:56:30,252 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36820bfc-d3ff-4208-89f5-d3c60aa16187/sv-benchmarks/c/systemc/pc_sfifo_3.cil.c[640,653] [2021-12-06 18:56:30,288 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 18:56:30,295 INFO L203 MainTranslator]: Completed pre-run [2021-12-06 18:56:30,303 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36820bfc-d3ff-4208-89f5-d3c60aa16187/sv-benchmarks/c/systemc/pc_sfifo_3.cil.c[640,653] [2021-12-06 18:56:30,323 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 18:56:30,334 INFO L208 MainTranslator]: Completed translation [2021-12-06 18:56:30,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:56:30 WrapperNode [2021-12-06 18:56:30,335 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-06 18:56:30,336 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-06 18:56:30,336 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-06 18:56:30,336 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-06 18:56:30,341 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:56:30" (1/1) ... [2021-12-06 18:56:30,347 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:56:30" (1/1) ... [2021-12-06 18:56:30,365 INFO L137 Inliner]: procedures = 31, calls = 35, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 225 [2021-12-06 18:56:30,366 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-06 18:56:30,366 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-06 18:56:30,366 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-06 18:56:30,366 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-06 18:56:30,373 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:56:30" (1/1) ... [2021-12-06 18:56:30,373 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:56:30" (1/1) ... [2021-12-06 18:56:30,376 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:56:30" (1/1) ... [2021-12-06 18:56:30,376 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:56:30" (1/1) ... [2021-12-06 18:56:30,380 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:56:30" (1/1) ... [2021-12-06 18:56:30,386 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:56:30" (1/1) ... [2021-12-06 18:56:30,387 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:56:30" (1/1) ... [2021-12-06 18:56:30,390 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-06 18:56:30,391 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-06 18:56:30,391 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-06 18:56:30,391 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-06 18:56:30,392 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:56:30" (1/1) ... [2021-12-06 18:56:30,398 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 18:56:30,408 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36820bfc-d3ff-4208-89f5-d3c60aa16187/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 18:56:30,420 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36820bfc-d3ff-4208-89f5-d3c60aa16187/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-06 18:56:30,422 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36820bfc-d3ff-4208-89f5-d3c60aa16187/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-06 18:56:30,459 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-06 18:56:30,459 INFO L130 BoogieDeclarations]: Found specification of procedure error [2021-12-06 18:56:30,459 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2021-12-06 18:56:30,459 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2021-12-06 18:56:30,459 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2021-12-06 18:56:30,459 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2021-12-06 18:56:30,460 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2021-12-06 18:56:30,460 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2021-12-06 18:56:30,460 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2021-12-06 18:56:30,460 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2021-12-06 18:56:30,460 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2021-12-06 18:56:30,460 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2021-12-06 18:56:30,460 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2021-12-06 18:56:30,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-06 18:56:30,460 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2021-12-06 18:56:30,461 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2021-12-06 18:56:30,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-06 18:56:30,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-06 18:56:30,461 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2021-12-06 18:56:30,461 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2021-12-06 18:56:30,523 INFO L236 CfgBuilder]: Building ICFG [2021-12-06 18:56:30,525 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-06 18:56:30,743 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##54: assume !(1 == ~q_free~0); [2021-12-06 18:56:30,743 INFO L768 $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; [2021-12-06 18:56:30,754 INFO L277 CfgBuilder]: Performing block encoding [2021-12-06 18:56:30,760 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-06 18:56:30,760 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-12-06 18:56:30,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:56:30 BoogieIcfgContainer [2021-12-06 18:56:30,762 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-06 18:56:30,763 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-06 18:56:30,763 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-06 18:56:30,765 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-06 18:56:30,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:56:30" (1/3) ... [2021-12-06 18:56:30,766 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55dd138b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:56:30, skipping insertion in model container [2021-12-06 18:56:30,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:56:30" (2/3) ... [2021-12-06 18:56:30,766 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55dd138b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:56:30, skipping insertion in model container [2021-12-06 18:56:30,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:56:30" (3/3) ... [2021-12-06 18:56:30,767 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil.c [2021-12-06 18:56:30,771 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-06 18:56:30,771 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-06 18:56:30,806 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-06 18:56:30,810 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-06 18:56:30,810 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-06 18:56:30,825 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) [2021-12-06 18:56:30,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-12-06 18:56:30,832 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:56:30,832 INFO L514 BasicCegarLoop]: 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] [2021-12-06 18:56:30,833 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:56:30,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:56:30,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1330697302, now seen corresponding path program 1 times [2021-12-06 18:56:30,845 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:56:30,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353898279] [2021-12-06 18:56:30,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:56:30,846 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:56:30,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:31,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:56:31,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:31,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 18:56:31,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:31,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-06 18:56:31,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:31,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 18:56:31,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:31,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 18:56:31,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:31,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-06 18:56:31,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:31,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-06 18:56:31,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:31,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 18:56:31,102 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:56:31,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353898279] [2021-12-06 18:56:31,103 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353898279] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:56:31,103 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:56:31,103 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 18:56:31,104 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757380349] [2021-12-06 18:56:31,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:56:31,110 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 18:56:31,110 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:56:31,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 18:56:31,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-06 18:56:31,146 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) [2021-12-06 18:56:31,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:56:31,632 INFO L93 Difference]: Finished difference Result 382 states and 574 transitions. [2021-12-06 18:56:31,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-06 18:56:31,634 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 [2021-12-06 18:56:31,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:56:31,644 INFO L225 Difference]: With dead ends: 382 [2021-12-06 18:56:31,644 INFO L226 Difference]: Without dead ends: 264 [2021-12-06 18:56:31,647 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2021-12-06 18:56:31,649 INFO L933 BasicCegarLoop]: 172 mSDtfsCounter, 366 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 18:56:31,650 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [373 Valid, 638 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 18:56:31,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2021-12-06 18:56:31,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 225. [2021-12-06 18:56:31,703 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) [2021-12-06 18:56:31,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 316 transitions. [2021-12-06 18:56:31,707 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 316 transitions. Word has length 64 [2021-12-06 18:56:31,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:56:31,707 INFO L470 AbstractCegarLoop]: Abstraction has 225 states and 316 transitions. [2021-12-06 18:56:31,707 INFO L471 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) [2021-12-06 18:56:31,707 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 316 transitions. [2021-12-06 18:56:31,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-12-06 18:56:31,710 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:56:31,710 INFO L514 BasicCegarLoop]: 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] [2021-12-06 18:56:31,710 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-06 18:56:31,711 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:56:31,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:56:31,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1285381354, now seen corresponding path program 1 times [2021-12-06 18:56:31,711 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:56:31,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823075209] [2021-12-06 18:56:31,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:56:31,712 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:56:31,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:31,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:56:31,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:31,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 18:56:31,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:31,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-06 18:56:31,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:31,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 18:56:31,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:31,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 18:56:31,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:31,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-06 18:56:31,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:31,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-06 18:56:31,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:31,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 18:56:31,807 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:56:31,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823075209] [2021-12-06 18:56:31,807 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823075209] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:56:31,807 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:56:31,807 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 18:56:31,808 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688415879] [2021-12-06 18:56:31,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:56:31,809 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 18:56:31,809 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:56:31,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 18:56:31,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-06 18:56:31,809 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) [2021-12-06 18:56:32,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:56:32,208 INFO L93 Difference]: Finished difference Result 622 states and 882 transitions. [2021-12-06 18:56:32,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-06 18:56:32,208 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 [2021-12-06 18:56:32,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:56:32,212 INFO L225 Difference]: With dead ends: 622 [2021-12-06 18:56:32,212 INFO L226 Difference]: Without dead ends: 413 [2021-12-06 18:56:32,214 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2021-12-06 18:56:32,215 INFO L933 BasicCegarLoop]: 267 mSDtfsCounter, 451 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 893 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 18:56:32,216 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [460 Valid, 893 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 640 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 18:56:32,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2021-12-06 18:56:32,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 337. [2021-12-06 18:56:32,249 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) [2021-12-06 18:56:32,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 476 transitions. [2021-12-06 18:56:32,252 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 476 transitions. Word has length 64 [2021-12-06 18:56:32,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:56:32,252 INFO L470 AbstractCegarLoop]: Abstraction has 337 states and 476 transitions. [2021-12-06 18:56:32,252 INFO L471 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) [2021-12-06 18:56:32,252 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 476 transitions. [2021-12-06 18:56:32,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-12-06 18:56:32,255 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:56:32,255 INFO L514 BasicCegarLoop]: 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] [2021-12-06 18:56:32,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-06 18:56:32,255 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:56:32,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:56:32,256 INFO L85 PathProgramCache]: Analyzing trace with hash 980999832, now seen corresponding path program 1 times [2021-12-06 18:56:32,256 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:56:32,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885302305] [2021-12-06 18:56:32,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:56:32,256 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:56:32,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:32,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:56:32,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:32,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 18:56:32,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:32,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-06 18:56:32,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:32,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 18:56:32,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:32,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 18:56:32,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:32,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-06 18:56:32,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:32,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-06 18:56:32,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:32,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 18:56:32,363 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:56:32,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885302305] [2021-12-06 18:56:32,363 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885302305] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:56:32,363 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:56:32,363 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-06 18:56:32,363 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94296339] [2021-12-06 18:56:32,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:56:32,364 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-06 18:56:32,364 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:56:32,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-06 18:56:32,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-06 18:56:32,365 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) [2021-12-06 18:56:33,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:56:33,320 INFO L93 Difference]: Finished difference Result 1883 states and 2674 transitions. [2021-12-06 18:56:33,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-12-06 18:56:33,320 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 [2021-12-06 18:56:33,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:56:33,333 INFO L225 Difference]: With dead ends: 1883 [2021-12-06 18:56:33,333 INFO L226 Difference]: Without dead ends: 1550 [2021-12-06 18:56:33,336 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2021-12-06 18:56:33,338 INFO L933 BasicCegarLoop]: 314 mSDtfsCounter, 1613 mSDsluCounter, 874 mSDsCounter, 0 mSdLazyCounter, 1324 mSolverCounterSat, 495 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1631 SdHoareTripleChecker+Valid, 1188 SdHoareTripleChecker+Invalid, 1819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 495 IncrementalHoareTripleChecker+Valid, 1324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-06 18:56:33,338 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1631 Valid, 1188 Invalid, 1819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [495 Valid, 1324 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-06 18:56:33,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1550 states. [2021-12-06 18:56:33,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1550 to 1390. [2021-12-06 18:56:33,448 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) [2021-12-06 18:56:33,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1390 states and 1863 transitions. [2021-12-06 18:56:33,459 INFO L78 Accepts]: Start accepts. Automaton has 1390 states and 1863 transitions. Word has length 64 [2021-12-06 18:56:33,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:56:33,459 INFO L470 AbstractCegarLoop]: Abstraction has 1390 states and 1863 transitions. [2021-12-06 18:56:33,459 INFO L471 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) [2021-12-06 18:56:33,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1390 states and 1863 transitions. [2021-12-06 18:56:33,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-06 18:56:33,461 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:56:33,461 INFO L514 BasicCegarLoop]: 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] [2021-12-06 18:56:33,461 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-06 18:56:33,462 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:56:33,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:56:33,462 INFO L85 PathProgramCache]: Analyzing trace with hash 779831852, now seen corresponding path program 1 times [2021-12-06 18:56:33,462 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:56:33,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986750460] [2021-12-06 18:56:33,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:56:33,463 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:56:33,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:33,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:56:33,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:33,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 18:56:33,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:33,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-06 18:56:33,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:33,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 18:56:33,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:33,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 18:56:33,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:33,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 18:56:33,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:33,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 18:56:33,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:33,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 18:56:33,575 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:56:33,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986750460] [2021-12-06 18:56:33,576 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986750460] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:56:33,576 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:56:33,576 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-06 18:56:33,576 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293473057] [2021-12-06 18:56:33,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:56:33,577 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 18:56:33,577 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:56:33,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 18:56:33,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-06 18:56:33,578 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) [2021-12-06 18:56:33,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:56:33,910 INFO L93 Difference]: Finished difference Result 2918 states and 3942 transitions. [2021-12-06 18:56:33,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 18:56:33,910 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 [2021-12-06 18:56:33,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:56:33,921 INFO L225 Difference]: With dead ends: 2918 [2021-12-06 18:56:33,921 INFO L226 Difference]: Without dead ends: 1538 [2021-12-06 18:56:33,925 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2021-12-06 18:56:33,927 INFO L933 BasicCegarLoop]: 147 mSDtfsCounter, 130 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 18:56:33,927 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 754 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 18:56:33,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1538 states. [2021-12-06 18:56:34,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1538 to 1430. [2021-12-06 18:56:34,004 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) [2021-12-06 18:56:34,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1430 states to 1430 states and 1897 transitions. [2021-12-06 18:56:34,011 INFO L78 Accepts]: Start accepts. Automaton has 1430 states and 1897 transitions. Word has length 65 [2021-12-06 18:56:34,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:56:34,012 INFO L470 AbstractCegarLoop]: Abstraction has 1430 states and 1897 transitions. [2021-12-06 18:56:34,012 INFO L471 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) [2021-12-06 18:56:34,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1430 states and 1897 transitions. [2021-12-06 18:56:34,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-06 18:56:34,013 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:56:34,013 INFO L514 BasicCegarLoop]: 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] [2021-12-06 18:56:34,013 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-06 18:56:34,013 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:56:34,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:56:34,014 INFO L85 PathProgramCache]: Analyzing trace with hash -249527446, now seen corresponding path program 1 times [2021-12-06 18:56:34,014 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:56:34,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645137990] [2021-12-06 18:56:34,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:56:34,014 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:56:34,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:34,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:56:34,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:34,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 18:56:34,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:34,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-06 18:56:34,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:34,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 18:56:34,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:34,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 18:56:34,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:34,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 18:56:34,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:34,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 18:56:34,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:34,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 18:56:34,088 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:56:34,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645137990] [2021-12-06 18:56:34,089 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645137990] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:56:34,089 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:56:34,089 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-06 18:56:34,089 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029399220] [2021-12-06 18:56:34,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:56:34,089 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-06 18:56:34,089 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:56:34,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-06 18:56:34,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-06 18:56:34,090 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) [2021-12-06 18:56:35,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:56:35,070 INFO L93 Difference]: Finished difference Result 5002 states and 6771 transitions. [2021-12-06 18:56:35,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-12-06 18:56:35,070 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 [2021-12-06 18:56:35,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:56:35,079 INFO L225 Difference]: With dead ends: 5002 [2021-12-06 18:56:35,079 INFO L226 Difference]: Without dead ends: 1821 [2021-12-06 18:56:35,085 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2021-12-06 18:56:35,086 INFO L933 BasicCegarLoop]: 308 mSDtfsCounter, 1515 mSDsluCounter, 1060 mSDsCounter, 0 mSdLazyCounter, 1353 mSolverCounterSat, 448 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1533 SdHoareTripleChecker+Valid, 1368 SdHoareTripleChecker+Invalid, 1801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 448 IncrementalHoareTripleChecker+Valid, 1353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-06 18:56:35,087 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1533 Valid, 1368 Invalid, 1801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [448 Valid, 1353 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-06 18:56:35,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1821 states. [2021-12-06 18:56:35,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1821 to 1641. [2021-12-06 18:56:35,154 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) [2021-12-06 18:56:35,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1641 states to 1641 states and 2109 transitions. [2021-12-06 18:56:35,161 INFO L78 Accepts]: Start accepts. Automaton has 1641 states and 2109 transitions. Word has length 65 [2021-12-06 18:56:35,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:56:35,161 INFO L470 AbstractCegarLoop]: Abstraction has 1641 states and 2109 transitions. [2021-12-06 18:56:35,161 INFO L471 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) [2021-12-06 18:56:35,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1641 states and 2109 transitions. [2021-12-06 18:56:35,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-12-06 18:56:35,163 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:56:35,163 INFO L514 BasicCegarLoop]: 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] [2021-12-06 18:56:35,163 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-06 18:56:35,164 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:56:35,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:56:35,164 INFO L85 PathProgramCache]: Analyzing trace with hash -31264562, now seen corresponding path program 1 times [2021-12-06 18:56:35,164 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:56:35,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277495978] [2021-12-06 18:56:35,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:56:35,164 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:56:35,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:35,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:56:35,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:35,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 18:56:35,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:35,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-06 18:56:35,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:35,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 18:56:35,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:35,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 18:56:35,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:35,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-06 18:56:35,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:35,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-06 18:56:35,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:35,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-06 18:56:35,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:35,266 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-06 18:56:35,266 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:56:35,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277495978] [2021-12-06 18:56:35,266 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277495978] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:56:35,266 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:56:35,266 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-06 18:56:35,267 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798320461] [2021-12-06 18:56:35,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:56:35,267 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 18:56:35,267 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:56:35,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 18:56:35,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-06 18:56:35,268 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) [2021-12-06 18:56:35,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:56:35,561 INFO L93 Difference]: Finished difference Result 3466 states and 4511 transitions. [2021-12-06 18:56:35,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-06 18:56:35,561 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 [2021-12-06 18:56:35,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:56:35,569 INFO L225 Difference]: With dead ends: 3466 [2021-12-06 18:56:35,570 INFO L226 Difference]: Without dead ends: 1835 [2021-12-06 18:56:35,573 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2021-12-06 18:56:35,574 INFO L933 BasicCegarLoop]: 135 mSDtfsCounter, 182 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 18:56:35,575 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [184 Valid, 630 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 18:56:35,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1835 states. [2021-12-06 18:56:35,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1835 to 1701. [2021-12-06 18:56:35,638 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) [2021-12-06 18:56:35,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1701 states to 1701 states and 2163 transitions. [2021-12-06 18:56:35,644 INFO L78 Accepts]: Start accepts. Automaton has 1701 states and 2163 transitions. Word has length 90 [2021-12-06 18:56:35,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:56:35,645 INFO L470 AbstractCegarLoop]: Abstraction has 1701 states and 2163 transitions. [2021-12-06 18:56:35,645 INFO L471 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) [2021-12-06 18:56:35,645 INFO L276 IsEmpty]: Start isEmpty. Operand 1701 states and 2163 transitions. [2021-12-06 18:56:35,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-12-06 18:56:35,646 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:56:35,646 INFO L514 BasicCegarLoop]: 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] [2021-12-06 18:56:35,647 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-06 18:56:35,647 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:56:35,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:56:35,647 INFO L85 PathProgramCache]: Analyzing trace with hash 412636112, now seen corresponding path program 1 times [2021-12-06 18:56:35,647 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:56:35,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661803630] [2021-12-06 18:56:35,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:56:35,647 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:56:35,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:35,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:56:35,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:35,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 18:56:35,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:35,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-06 18:56:35,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:35,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 18:56:35,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:35,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 18:56:35,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:35,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-06 18:56:35,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:35,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-06 18:56:35,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:35,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-06 18:56:35,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:35,723 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-06 18:56:35,723 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:56:35,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661803630] [2021-12-06 18:56:35,723 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661803630] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:56:35,723 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:56:35,723 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 18:56:35,724 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405070212] [2021-12-06 18:56:35,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:56:35,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 18:56:35,724 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:56:35,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 18:56:35,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-06 18:56:35,725 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) [2021-12-06 18:56:36,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:56:36,141 INFO L93 Difference]: Finished difference Result 3228 states and 4127 transitions. [2021-12-06 18:56:36,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-06 18:56:36,142 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 [2021-12-06 18:56:36,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:56:36,154 INFO L225 Difference]: With dead ends: 3228 [2021-12-06 18:56:36,154 INFO L226 Difference]: Without dead ends: 1775 [2021-12-06 18:56:36,158 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2021-12-06 18:56:36,159 INFO L933 BasicCegarLoop]: 190 mSDtfsCounter, 365 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 18:56:36,160 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [372 Valid, 678 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 18:56:36,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1775 states. [2021-12-06 18:56:36,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1775 to 1480. [2021-12-06 18:56:36,243 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) [2021-12-06 18:56:36,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 1877 transitions. [2021-12-06 18:56:36,248 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 1877 transitions. Word has length 90 [2021-12-06 18:56:36,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:56:36,249 INFO L470 AbstractCegarLoop]: Abstraction has 1480 states and 1877 transitions. [2021-12-06 18:56:36,249 INFO L471 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) [2021-12-06 18:56:36,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 1877 transitions. [2021-12-06 18:56:36,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-12-06 18:56:36,250 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:56:36,250 INFO L514 BasicCegarLoop]: 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] [2021-12-06 18:56:36,250 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-06 18:56:36,250 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:56:36,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:56:36,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1943169138, now seen corresponding path program 1 times [2021-12-06 18:56:36,251 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:56:36,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258234286] [2021-12-06 18:56:36,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:56:36,251 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:56:36,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:36,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:56:36,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:36,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 18:56:36,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:36,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-06 18:56:36,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:36,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 18:56:36,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:36,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 18:56:36,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:36,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-06 18:56:36,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:36,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-06 18:56:36,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:36,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-06 18:56:36,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:36,318 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-06 18:56:36,318 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:56:36,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258234286] [2021-12-06 18:56:36,318 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258234286] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:56:36,318 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:56:36,318 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 18:56:36,319 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475068465] [2021-12-06 18:56:36,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:56:36,319 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 18:56:36,319 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:56:36,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 18:56:36,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-06 18:56:36,319 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) [2021-12-06 18:56:36,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:56:36,608 INFO L93 Difference]: Finished difference Result 4632 states and 5989 transitions. [2021-12-06 18:56:36,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-06 18:56:36,609 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 [2021-12-06 18:56:36,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:56:36,627 INFO L225 Difference]: With dead ends: 4632 [2021-12-06 18:56:36,627 INFO L226 Difference]: Without dead ends: 3163 [2021-12-06 18:56:36,632 INFO L932 BasicCegarLoop]: 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 [2021-12-06 18:56:36,633 INFO L933 BasicCegarLoop]: 192 mSDtfsCounter, 365 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 18:56:36,633 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [374 Valid, 514 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 18:56:36,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3163 states. [2021-12-06 18:56:36,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3163 to 2949. [2021-12-06 18:56:36,767 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) [2021-12-06 18:56:36,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2949 states to 2949 states and 3749 transitions. [2021-12-06 18:56:36,774 INFO L78 Accepts]: Start accepts. Automaton has 2949 states and 3749 transitions. Word has length 90 [2021-12-06 18:56:36,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:56:36,774 INFO L470 AbstractCegarLoop]: Abstraction has 2949 states and 3749 transitions. [2021-12-06 18:56:36,775 INFO L471 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) [2021-12-06 18:56:36,775 INFO L276 IsEmpty]: Start isEmpty. Operand 2949 states and 3749 transitions. [2021-12-06 18:56:36,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-12-06 18:56:36,776 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:56:36,776 INFO L514 BasicCegarLoop]: 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] [2021-12-06 18:56:36,776 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-06 18:56:36,776 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:56:36,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:56:36,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1293960080, now seen corresponding path program 1 times [2021-12-06 18:56:36,777 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:56:36,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588661850] [2021-12-06 18:56:36,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:56:36,777 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:56:36,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:36,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:56:36,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:36,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 18:56:36,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:36,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-06 18:56:36,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:36,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 18:56:36,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:36,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 18:56:36,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:36,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-06 18:56:36,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:36,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-06 18:56:36,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:36,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-06 18:56:36,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:36,820 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-06 18:56:36,820 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:56:36,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588661850] [2021-12-06 18:56:36,820 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588661850] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:56:36,820 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:56:36,820 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 18:56:36,820 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707842061] [2021-12-06 18:56:36,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:56:36,821 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 18:56:36,821 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:56:36,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 18:56:36,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-06 18:56:36,821 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) [2021-12-06 18:56:36,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:56:36,958 INFO L93 Difference]: Finished difference Result 4533 states and 5733 transitions. [2021-12-06 18:56:36,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 18:56:36,958 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 [2021-12-06 18:56:36,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:56:36,965 INFO L225 Difference]: With dead ends: 4533 [2021-12-06 18:56:36,965 INFO L226 Difference]: Without dead ends: 1595 [2021-12-06 18:56:36,971 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-12-06 18:56:36,971 INFO L933 BasicCegarLoop]: 133 mSDtfsCounter, 290 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 18:56:36,971 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [306 Valid, 241 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 18:56:36,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1595 states. [2021-12-06 18:56:37,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1595 to 1480. [2021-12-06 18:56:37,034 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) [2021-12-06 18:56:37,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 1840 transitions. [2021-12-06 18:56:37,038 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 1840 transitions. Word has length 90 [2021-12-06 18:56:37,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:56:37,038 INFO L470 AbstractCegarLoop]: Abstraction has 1480 states and 1840 transitions. [2021-12-06 18:56:37,038 INFO L471 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) [2021-12-06 18:56:37,038 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 1840 transitions. [2021-12-06 18:56:37,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-12-06 18:56:37,039 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:56:37,039 INFO L514 BasicCegarLoop]: 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] [2021-12-06 18:56:37,039 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-06 18:56:37,039 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:56:37,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:56:37,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1668589887, now seen corresponding path program 1 times [2021-12-06 18:56:37,040 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:56:37,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781186241] [2021-12-06 18:56:37,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:56:37,040 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:56:37,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:37,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:56:37,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:37,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 18:56:37,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:37,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-06 18:56:37,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:37,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 18:56:37,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:37,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 18:56:37,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:37,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-06 18:56:37,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:37,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-06 18:56:37,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:37,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 18:56:37,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:37,105 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-06 18:56:37,105 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:56:37,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781186241] [2021-12-06 18:56:37,105 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781186241] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:56:37,105 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:56:37,105 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-06 18:56:37,105 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746607859] [2021-12-06 18:56:37,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:56:37,106 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 18:56:37,106 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:56:37,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 18:56:37,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-12-06 18:56:37,106 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) [2021-12-06 18:56:37,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:56:37,685 INFO L93 Difference]: Finished difference Result 3898 states and 4923 transitions. [2021-12-06 18:56:37,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-06 18:56:37,685 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 [2021-12-06 18:56:37,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:56:37,694 INFO L225 Difference]: With dead ends: 3898 [2021-12-06 18:56:37,694 INFO L226 Difference]: Without dead ends: 2278 [2021-12-06 18:56:37,698 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=720, Unknown=0, NotChecked=0, Total=930 [2021-12-06 18:56:37,698 INFO L933 BasicCegarLoop]: 228 mSDtfsCounter, 1314 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 462 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1332 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 1159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 462 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 18:56:37,698 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1332 Valid, 610 Invalid, 1159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [462 Valid, 697 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-06 18:56:37,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2278 states. [2021-12-06 18:56:37,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2278 to 2101. [2021-12-06 18:56:37,772 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) [2021-12-06 18:56:37,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 2590 transitions. [2021-12-06 18:56:37,777 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 2590 transitions. Word has length 91 [2021-12-06 18:56:37,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:56:37,778 INFO L470 AbstractCegarLoop]: Abstraction has 2101 states and 2590 transitions. [2021-12-06 18:56:37,778 INFO L471 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) [2021-12-06 18:56:37,778 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 2590 transitions. [2021-12-06 18:56:37,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2021-12-06 18:56:37,780 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:56:37,780 INFO L514 BasicCegarLoop]: 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] [2021-12-06 18:56:37,780 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-06 18:56:37,780 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:56:37,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:56:37,780 INFO L85 PathProgramCache]: Analyzing trace with hash -633049043, now seen corresponding path program 1 times [2021-12-06 18:56:37,780 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:56:37,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635052439] [2021-12-06 18:56:37,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:56:37,781 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:56:37,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:37,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:56:37,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:37,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 18:56:37,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:37,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-06 18:56:37,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:37,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 18:56:37,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:37,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 18:56:37,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:37,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-06 18:56:37,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:37,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-06 18:56:37,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:37,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 18:56:37,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:37,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2021-12-06 18:56:37,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:37,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-06 18:56:37,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:37,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-06 18:56:37,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:37,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 18:56:37,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:37,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 18:56:37,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:37,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-12-06 18:56:37,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:37,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2021-12-06 18:56:37,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:37,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-06 18:56:37,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:37,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2021-12-06 18:56:37,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:37,882 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2021-12-06 18:56:37,882 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:56:37,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635052439] [2021-12-06 18:56:37,882 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635052439] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 18:56:37,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938192769] [2021-12-06 18:56:37,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:56:37,883 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:56:37,883 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36820bfc-d3ff-4208-89f5-d3c60aa16187/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 18:56:37,884 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36820bfc-d3ff-4208-89f5-d3c60aa16187/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 18:56:37,884 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36820bfc-d3ff-4208-89f5-d3c60aa16187/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-06 18:56:37,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:37,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 18:56:37,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 18:56:38,159 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-12-06 18:56:38,160 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 18:56:38,160 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938192769] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:56:38,160 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 18:56:38,160 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2021-12-06 18:56:38,160 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377327717] [2021-12-06 18:56:38,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:56:38,161 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 18:56:38,161 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:56:38,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 18:56:38,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-12-06 18:56:38,161 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) [2021-12-06 18:56:38,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:56:38,304 INFO L93 Difference]: Finished difference Result 6027 states and 7419 transitions. [2021-12-06 18:56:38,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 18:56:38,305 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 [2021-12-06 18:56:38,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:56:38,322 INFO L225 Difference]: With dead ends: 6027 [2021-12-06 18:56:38,322 INFO L226 Difference]: Without dead ends: 4013 [2021-12-06 18:56:38,327 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-12-06 18:56:38,328 INFO L933 BasicCegarLoop]: 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 [2021-12-06 18:56:38,328 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 281 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 18:56:38,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4013 states. [2021-12-06 18:56:38,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4013 to 3971. [2021-12-06 18:56:38,481 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) [2021-12-06 18:56:38,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3971 states to 3971 states and 4819 transitions. [2021-12-06 18:56:38,493 INFO L78 Accepts]: Start accepts. Automaton has 3971 states and 4819 transitions. Word has length 162 [2021-12-06 18:56:38,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:56:38,494 INFO L470 AbstractCegarLoop]: Abstraction has 3971 states and 4819 transitions. [2021-12-06 18:56:38,494 INFO L471 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) [2021-12-06 18:56:38,494 INFO L276 IsEmpty]: Start isEmpty. Operand 3971 states and 4819 transitions. [2021-12-06 18:56:38,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2021-12-06 18:56:38,498 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:56:38,498 INFO L514 BasicCegarLoop]: 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] [2021-12-06 18:56:38,532 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36820bfc-d3ff-4208-89f5-d3c60aa16187/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-06 18:56:38,698 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36820bfc-d3ff-4208-89f5-d3c60aa16187/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:56:38,699 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:56:38,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:56:38,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1912569076, now seen corresponding path program 1 times [2021-12-06 18:56:38,699 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:56:38,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636314737] [2021-12-06 18:56:38,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:56:38,700 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:56:38,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:38,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:56:38,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:38,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 18:56:38,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:38,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-06 18:56:38,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:38,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 18:56:38,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:38,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 18:56:38,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:38,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-06 18:56:38,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:38,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-06 18:56:38,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:38,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 18:56:38,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:38,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2021-12-06 18:56:38,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:38,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-06 18:56:38,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:38,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-06 18:56:38,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:38,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 18:56:38,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:38,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 18:56:38,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:38,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-12-06 18:56:38,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:38,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2021-12-06 18:56:38,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:38,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-12-06 18:56:38,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:38,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 18:56:38,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:38,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 18:56:38,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:38,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2021-12-06 18:56:38,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:38,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2021-12-06 18:56:38,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:38,819 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2021-12-06 18:56:38,819 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:56:38,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636314737] [2021-12-06 18:56:38,819 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636314737] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 18:56:38,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592726360] [2021-12-06 18:56:38,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:56:38,819 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:56:38,819 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36820bfc-d3ff-4208-89f5-d3c60aa16187/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 18:56:38,820 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36820bfc-d3ff-4208-89f5-d3c60aa16187/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 18:56:38,820 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36820bfc-d3ff-4208-89f5-d3c60aa16187/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-06 18:56:38,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:38,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 18:56:38,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 18:56:39,114 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2021-12-06 18:56:39,114 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 18:56:39,114 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1592726360] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:56:39,114 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 18:56:39,115 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2021-12-06 18:56:39,115 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293808954] [2021-12-06 18:56:39,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:56:39,115 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 18:56:39,116 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:56:39,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 18:56:39,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-12-06 18:56:39,116 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) [2021-12-06 18:56:39,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:56:39,338 INFO L93 Difference]: Finished difference Result 11891 states and 14427 transitions. [2021-12-06 18:56:39,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 18:56:39,338 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 [2021-12-06 18:56:39,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:56:39,367 INFO L225 Difference]: With dead ends: 11891 [2021-12-06 18:56:39,367 INFO L226 Difference]: Without dead ends: 7931 [2021-12-06 18:56:39,374 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-12-06 18:56:39,374 INFO L933 BasicCegarLoop]: 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 [2021-12-06 18:56:39,375 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 281 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 18:56:39,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7931 states. [2021-12-06 18:56:39,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7931 to 7921. [2021-12-06 18:56:39,638 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) [2021-12-06 18:56:39,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7921 states to 7921 states and 9569 transitions. [2021-12-06 18:56:39,654 INFO L78 Accepts]: Start accepts. Automaton has 7921 states and 9569 transitions. Word has length 194 [2021-12-06 18:56:39,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:56:39,654 INFO L470 AbstractCegarLoop]: Abstraction has 7921 states and 9569 transitions. [2021-12-06 18:56:39,654 INFO L471 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) [2021-12-06 18:56:39,655 INFO L276 IsEmpty]: Start isEmpty. Operand 7921 states and 9569 transitions. [2021-12-06 18:56:39,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2021-12-06 18:56:39,658 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:56:39,658 INFO L514 BasicCegarLoop]: 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] [2021-12-06 18:56:39,678 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36820bfc-d3ff-4208-89f5-d3c60aa16187/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-06 18:56:39,858 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36820bfc-d3ff-4208-89f5-d3c60aa16187/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-12-06 18:56:39,860 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:56:39,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:56:39,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1015175798, now seen corresponding path program 1 times [2021-12-06 18:56:39,861 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:56:39,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95599870] [2021-12-06 18:56:39,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:56:39,863 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:56:39,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:40,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:56:40,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:40,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 18:56:40,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:40,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-06 18:56:40,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:40,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 18:56:40,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:40,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 18:56:40,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:40,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-06 18:56:40,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:40,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-06 18:56:40,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:40,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 18:56:40,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:40,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2021-12-06 18:56:40,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:40,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-06 18:56:40,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:40,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-06 18:56:40,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:40,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 18:56:40,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:40,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 18:56:40,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:40,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-12-06 18:56:40,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:40,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2021-12-06 18:56:40,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:40,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-12-06 18:56:40,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:40,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 18:56:40,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:40,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 18:56:40,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:40,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2021-12-06 18:56:40,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:40,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2021-12-06 18:56:40,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:40,081 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2021-12-06 18:56:40,081 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:56:40,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95599870] [2021-12-06 18:56:40,081 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95599870] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 18:56:40,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979453690] [2021-12-06 18:56:40,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:56:40,082 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:56:40,082 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36820bfc-d3ff-4208-89f5-d3c60aa16187/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 18:56:40,083 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36820bfc-d3ff-4208-89f5-d3c60aa16187/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 18:56:40,083 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36820bfc-d3ff-4208-89f5-d3c60aa16187/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-06 18:56:40,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:56:40,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 18:56:40,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 18:56:40,395 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2021-12-06 18:56:40,395 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 18:56:40,395 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1979453690] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:56:40,395 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 18:56:40,395 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2021-12-06 18:56:40,396 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047611432] [2021-12-06 18:56:40,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:56:40,396 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 18:56:40,396 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:56:40,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 18:56:40,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-12-06 18:56:40,397 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) [2021-12-06 18:56:40,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:56:40,628 INFO L93 Difference]: Finished difference Result 14427 states and 17761 transitions. [2021-12-06 18:56:40,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 18:56:40,629 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 [2021-12-06 18:56:40,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:56:40,632 INFO L225 Difference]: With dead ends: 14427 [2021-12-06 18:56:40,632 INFO L226 Difference]: Without dead ends: 0 [2021-12-06 18:56:40,651 INFO L932 BasicCegarLoop]: 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 [2021-12-06 18:56:40,651 INFO L933 BasicCegarLoop]: 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 [2021-12-06 18:56:40,651 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 129 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 18:56:40,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-06 18:56:40,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-06 18:56:40,652 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) [2021-12-06 18:56:40,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-06 18:56:40,653 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 194 [2021-12-06 18:56:40,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:56:40,654 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-06 18:56:40,654 INFO L471 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) [2021-12-06 18:56:40,654 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-06 18:56:40,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-06 18:56:40,656 INFO L764 garLoopResultBuilder]: Registering result SAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-06 18:56:40,688 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36820bfc-d3ff-4208-89f5-d3c60aa16187/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-06 18:56:40,856 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36820bfc-d3ff-4208-89f5-d3c60aa16187/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-12-06 18:56:40,858 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-06 18:57:15,209 INFO L854 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))))) [2021-12-06 18:57:15,210 INFO L854 garLoopResultBuilder]: At program point L387-2(lines 387 391) the Hoare annotation is: (let ((.cse6 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse7 (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (let ((.cse0 (and .cse6 (< 0 (+ activate_threads_~tmp~1 1)) .cse7 (<= activate_threads_~tmp~1 0))) (.cse2 (not (= ~q_read_ev~0 2))) (.cse3 (not (<= ~c_dr_pc~0 0))) (.cse8 (= ~p_dw_st~0 0)) (.cse4 (not (= |old(~c_dr_st~0)| 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 .cse4 (and .cse6 .cse7) (and .cse7 .cse8) .cse5) (or .cse3 (not .cse8) .cse4 (= |old(~p_dw_st~0)| 0) (not (<= 2 ~fast_clk_edge~0)) (not .cse1) .cse5)))) [2021-12-06 18:57:15,210 INFO L858 garLoopResultBuilder]: For program point L385-1(line 385) no Hoare annotation was computed. [2021-12-06 18:57:15,210 INFO L854 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))))) [2021-12-06 18:57:15,210 INFO L858 garLoopResultBuilder]: For program point L395(lines 395 399) no Hoare annotation was computed. [2021-12-06 18:57:15,210 INFO L858 garLoopResultBuilder]: For program point activate_threadsEXIT(lines 379 403) no Hoare annotation was computed. [2021-12-06 18:57:15,210 INFO L858 garLoopResultBuilder]: For program point L393(line 393) no Hoare annotation was computed. [2021-12-06 18:57:15,210 INFO L858 garLoopResultBuilder]: For program point L395-2(lines 379 403) no Hoare annotation was computed. [2021-12-06 18:57:15,210 INFO L858 garLoopResultBuilder]: For program point L387(lines 387 391) no Hoare annotation was computed. [2021-12-06 18:57:15,211 INFO L858 garLoopResultBuilder]: For program point exists_runnable_threadEXIT(lines 287 306) no Hoare annotation was computed. [2021-12-06 18:57:15,211 INFO L861 garLoopResultBuilder]: At program point exists_runnable_threadENTRY(lines 287 306) the Hoare annotation is: true [2021-12-06 18:57:15,211 INFO L861 garLoopResultBuilder]: At program point L303(lines 290 305) the Hoare annotation is: true [2021-12-06 18:57:15,211 INFO L858 garLoopResultBuilder]: For program point L295(lines 295 300) no Hoare annotation was computed. [2021-12-06 18:57:15,211 INFO L858 garLoopResultBuilder]: For program point L291(lines 291 301) no Hoare annotation was computed. [2021-12-06 18:57:15,211 INFO L858 garLoopResultBuilder]: For program point exists_runnable_threadFINAL(lines 287 306) no Hoare annotation was computed. [2021-12-06 18:57:15,211 INFO L858 garLoopResultBuilder]: For program point L96(lines 96 101) no Hoare annotation was computed. [2021-12-06 18:57:15,211 INFO L858 garLoopResultBuilder]: For program point L95(lines 95 104) no Hoare annotation was computed. [2021-12-06 18:57:15,211 INFO L858 garLoopResultBuilder]: For program point L95-2(lines 94 118) no Hoare annotation was computed. [2021-12-06 18:57:15,212 INFO L861 garLoopResultBuilder]: At program point is_do_read_c_triggeredENTRY(lines 91 119) the Hoare annotation is: true [2021-12-06 18:57:15,212 INFO L854 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))) [2021-12-06 18:57:15,212 INFO L858 garLoopResultBuilder]: For program point is_do_read_c_triggeredFINAL(lines 91 119) no Hoare annotation was computed. [2021-12-06 18:57:15,212 INFO L858 garLoopResultBuilder]: For program point L106(lines 106 111) no Hoare annotation was computed. [2021-12-06 18:57:15,212 INFO L858 garLoopResultBuilder]: For program point L105-1(lines 105 114) no Hoare annotation was computed. [2021-12-06 18:57:15,212 INFO L858 garLoopResultBuilder]: For program point is_do_read_c_triggeredEXIT(lines 91 119) no Hoare annotation was computed. [2021-12-06 18:57:15,212 INFO L854 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))))) [2021-12-06 18:57:15,212 INFO L858 garLoopResultBuilder]: For program point L316-1(lines 307 324) no Hoare annotation was computed. [2021-12-06 18:57:15,212 INFO L858 garLoopResultBuilder]: For program point L311-1(lines 310 323) no Hoare annotation was computed. [2021-12-06 18:57:15,212 INFO L858 garLoopResultBuilder]: For program point fire_delta_eventsEXIT(lines 307 324) no Hoare annotation was computed. [2021-12-06 18:57:15,213 INFO L858 garLoopResultBuilder]: For program point L258-1(lines 254 268) no Hoare annotation was computed. [2021-12-06 18:57:15,213 INFO L854 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))) [2021-12-06 18:57:15,213 INFO L854 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))))) [2021-12-06 18:57:15,213 INFO L858 garLoopResultBuilder]: For program point update_channelsEXIT(lines 254 268) no Hoare annotation was computed. [2021-12-06 18:57:15,213 INFO L858 garLoopResultBuilder]: For program point L41-1(lines 41 45) no Hoare annotation was computed. [2021-12-06 18:57:15,213 INFO L858 garLoopResultBuilder]: For program point L36(lines 36 40) no Hoare annotation was computed. [2021-12-06 18:57:15,213 INFO L858 garLoopResultBuilder]: For program point L36-2(lines 35 50) no Hoare annotation was computed. [2021-12-06 18:57:15,213 INFO L858 garLoopResultBuilder]: For program point reset_delta_eventsEXIT(lines 325 342) no Hoare annotation was computed. [2021-12-06 18:57:15,213 INFO L858 garLoopResultBuilder]: For program point L334-1(lines 325 342) no Hoare annotation was computed. [2021-12-06 18:57:15,213 INFO L858 garLoopResultBuilder]: For program point L329-1(lines 328 341) no Hoare annotation was computed. [2021-12-06 18:57:15,214 INFO L854 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))))) [2021-12-06 18:57:15,214 INFO L858 garLoopResultBuilder]: For program point L514-1(line 514) no Hoare annotation was computed. [2021-12-06 18:57:15,214 INFO L858 garLoopResultBuilder]: For program point L415(lines 415 419) no Hoare annotation was computed. [2021-12-06 18:57:15,214 INFO L858 garLoopResultBuilder]: For program point L415-1(lines 410 450) no Hoare annotation was computed. [2021-12-06 18:57:15,214 INFO L858 garLoopResultBuilder]: For program point L349(lines 349 356) no Hoare annotation was computed. [2021-12-06 18:57:15,214 INFO L854 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)) [2021-12-06 18:57:15,214 INFO L858 garLoopResultBuilder]: For program point L465(lines 465 470) no Hoare annotation was computed. [2021-12-06 18:57:15,214 INFO L858 garLoopResultBuilder]: For program point L234(lines 234 246) no Hoare annotation was computed. [2021-12-06 18:57:15,214 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-06 18:57:15,214 INFO L858 garLoopResultBuilder]: For program point L218-1(lines 218 228) no Hoare annotation was computed. [2021-12-06 18:57:15,214 INFO L858 garLoopResultBuilder]: For program point L152(lines 152 160) no Hoare annotation was computed. [2021-12-06 18:57:15,214 INFO L854 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)) [2021-12-06 18:57:15,215 INFO L858 garLoopResultBuilder]: For program point L499-1(line 499) no Hoare annotation was computed. [2021-12-06 18:57:15,215 INFO L858 garLoopResultBuilder]: For program point L235(lines 235 241) no Hoare annotation was computed. [2021-12-06 18:57:15,215 INFO L858 garLoopResultBuilder]: For program point L202(lines 202 206) no Hoare annotation was computed. [2021-12-06 18:57:15,215 INFO L854 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))) [2021-12-06 18:57:15,215 INFO L854 garLoopResultBuilder]: At program point L203(lines 198 252) the Hoare annotation is: false [2021-12-06 18:57:15,215 INFO L854 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)) [2021-12-06 18:57:15,215 INFO L858 garLoopResultBuilder]: For program point L484-1(line 484) no Hoare annotation was computed. [2021-12-06 18:57:15,215 INFO L854 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)) [2021-12-06 18:57:15,215 INFO L854 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)) [2021-12-06 18:57:15,216 INFO L854 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)) [2021-12-06 18:57:15,216 INFO L854 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)) [2021-12-06 18:57:15,216 INFO L854 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)) [2021-12-06 18:57:15,216 INFO L858 garLoopResultBuilder]: For program point L155(lines 155 159) no Hoare annotation was computed. [2021-12-06 18:57:15,216 INFO L854 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)) [2021-12-06 18:57:15,216 INFO L854 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))) [2021-12-06 18:57:15,216 INFO L854 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))) [2021-12-06 18:57:15,216 INFO L858 garLoopResultBuilder]: For program point L420(lines 410 450) no Hoare annotation was computed. [2021-12-06 18:57:15,216 INFO L854 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)) [2021-12-06 18:57:15,216 INFO L854 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)) [2021-12-06 18:57:15,216 INFO L854 garLoopResultBuilder]: At program point L239(line 239) the Hoare annotation is: false [2021-12-06 18:57:15,217 INFO L854 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))) [2021-12-06 18:57:15,217 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-06 18:57:15,217 INFO L854 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)) [2021-12-06 18:57:15,217 INFO L858 garLoopResultBuilder]: For program point L273(lines 273 277) no Hoare annotation was computed. [2021-12-06 18:57:15,217 INFO L858 garLoopResultBuilder]: For program point L273-2(lines 272 285) no Hoare annotation was computed. [2021-12-06 18:57:15,217 INFO L854 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)) [2021-12-06 18:57:15,217 INFO L854 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)) [2021-12-06 18:57:15,217 INFO L858 garLoopResultBuilder]: For program point L439(lines 439 446) no Hoare annotation was computed. [2021-12-06 18:57:15,217 INFO L854 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)) [2021-12-06 18:57:15,218 INFO L858 garLoopResultBuilder]: For program point L523(lines 523 527) no Hoare annotation was computed. [2021-12-06 18:57:15,218 INFO L858 garLoopResultBuilder]: For program point L424(lines 424 431) no Hoare annotation was computed. [2021-12-06 18:57:15,218 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-06 18:57:15,218 INFO L854 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)) [2021-12-06 18:57:15,218 INFO L858 garLoopResultBuilder]: For program point L508(line 508) no Hoare annotation was computed. [2021-12-06 18:57:15,218 INFO L854 garLoopResultBuilder]: At program point L244(line 244) the Hoare annotation is: false [2021-12-06 18:57:15,218 INFO L858 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2021-12-06 18:57:15,218 INFO L861 garLoopResultBuilder]: At program point L244-1(lines 198 252) the Hoare annotation is: true [2021-12-06 18:57:15,218 INFO L858 garLoopResultBuilder]: For program point L492(line 492) no Hoare annotation was computed. [2021-12-06 18:57:15,218 INFO L854 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))) [2021-12-06 18:57:15,218 INFO L858 garLoopResultBuilder]: For program point L510(lines 510 519) no Hoare annotation was computed. [2021-12-06 18:57:15,218 INFO L858 garLoopResultBuilder]: For program point L510-2(lines 510 519) no Hoare annotation was computed. [2021-12-06 18:57:15,219 INFO L854 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)) [2021-12-06 18:57:15,219 INFO L854 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))))) [2021-12-06 18:57:15,219 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-06 18:57:15,219 INFO L858 garLoopResultBuilder]: For program point L165(line 165) no Hoare annotation was computed. [2021-12-06 18:57:15,219 INFO L858 garLoopResultBuilder]: For program point L413(line 413) no Hoare annotation was computed. [2021-12-06 18:57:15,219 INFO L854 garLoopResultBuilder]: At program point L248(lines 195 253) the Hoare annotation is: (= ~c_dr_pc~0 1) [2021-12-06 18:57:15,219 INFO L858 garLoopResultBuilder]: For program point L149(lines 149 161) no Hoare annotation was computed. [2021-12-06 18:57:15,219 INFO L861 garLoopResultBuilder]: At program point L529(lines 476 534) the Hoare annotation is: true [2021-12-06 18:57:15,219 INFO L854 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)) [2021-12-06 18:57:15,219 INFO L858 garLoopResultBuilder]: For program point L463-1(line 463) no Hoare annotation was computed. [2021-12-06 18:57:15,219 INFO L858 garLoopResultBuilder]: For program point L199(lines 199 207) no Hoare annotation was computed. [2021-12-06 18:57:15,219 INFO L861 garLoopResultBuilder]: At program point L563(lines 554 565) the Hoare annotation is: true [2021-12-06 18:57:15,219 INFO L858 garLoopResultBuilder]: For program point L365(lines 365 369) no Hoare annotation was computed. [2021-12-06 18:57:15,219 INFO L858 garLoopResultBuilder]: For program point L365-2(lines 364 377) no Hoare annotation was computed. [2021-12-06 18:57:15,219 INFO L854 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)) [2021-12-06 18:57:15,219 INFO L858 garLoopResultBuilder]: For program point L66-2(lines 65 89) no Hoare annotation was computed. [2021-12-06 18:57:15,219 INFO L854 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))) [2021-12-06 18:57:15,220 INFO L858 garLoopResultBuilder]: For program point is_do_write_p_triggeredFINAL(lines 62 90) no Hoare annotation was computed. [2021-12-06 18:57:15,220 INFO L858 garLoopResultBuilder]: For program point is_do_write_p_triggeredEXIT(lines 62 90) no Hoare annotation was computed. [2021-12-06 18:57:15,220 INFO L858 garLoopResultBuilder]: For program point L77(lines 77 82) no Hoare annotation was computed. [2021-12-06 18:57:15,220 INFO L858 garLoopResultBuilder]: For program point L76-1(lines 76 85) no Hoare annotation was computed. [2021-12-06 18:57:15,220 INFO L861 garLoopResultBuilder]: At program point is_do_write_p_triggeredENTRY(lines 62 90) the Hoare annotation is: true [2021-12-06 18:57:15,220 INFO L858 garLoopResultBuilder]: For program point L67(lines 67 72) no Hoare annotation was computed. [2021-12-06 18:57:15,220 INFO L858 garLoopResultBuilder]: For program point L66(lines 66 75) no Hoare annotation was computed. [2021-12-06 18:57:15,220 INFO L858 garLoopResultBuilder]: For program point errorEXIT(lines 15 22) no Hoare annotation was computed. [2021-12-06 18:57:15,220 INFO L858 garLoopResultBuilder]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2021-12-06 18:57:15,220 INFO L861 garLoopResultBuilder]: At program point errorENTRY(lines 15 22) the Hoare annotation is: true [2021-12-06 18:57:15,220 INFO L858 garLoopResultBuilder]: For program point errorFINAL(lines 15 22) no Hoare annotation was computed. [2021-12-06 18:57:15,223 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:57:15,224 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-06 18:57:15,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:57:15 BoogieIcfgContainer [2021-12-06 18:57:15,245 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-06 18:57:15,245 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-06 18:57:15,245 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-06 18:57:15,245 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-06 18:57:15,246 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:56:30" (3/4) ... [2021-12-06 18:57:15,248 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-06 18:57:15,254 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2021-12-06 18:57:15,254 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2021-12-06 18:57:15,254 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2021-12-06 18:57:15,254 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2021-12-06 18:57:15,254 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2021-12-06 18:57:15,254 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2021-12-06 18:57:15,255 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2021-12-06 18:57:15,255 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2021-12-06 18:57:15,261 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2021-12-06 18:57:15,262 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-12-06 18:57:15,263 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-12-06 18:57:15,263 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-06 18:57:15,281 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)) [2021-12-06 18:57:15,310 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36820bfc-d3ff-4208-89f5-d3c60aa16187/bin/uautomizer-DrprNOufMa/witness.graphml [2021-12-06 18:57:15,310 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-06 18:57:15,310 INFO L158 Benchmark]: Toolchain (without parser) took 45197.37ms. Allocated memory was 123.7MB in the beginning and 629.1MB in the end (delta: 505.4MB). Free memory was 87.2MB in the beginning and 406.7MB in the end (delta: -319.5MB). Peak memory consumption was 185.2MB. Max. memory is 16.1GB. [2021-12-06 18:57:15,311 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 123.7MB. Free memory is still 103.7MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-06 18:57:15,311 INFO L158 Benchmark]: CACSL2BoogieTranslator took 220.82ms. Allocated memory is still 123.7MB. Free memory was 87.0MB in the beginning and 96.5MB in the end (delta: -9.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-06 18:57:15,311 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.11ms. Allocated memory is still 123.7MB. Free memory was 96.5MB in the beginning and 94.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-06 18:57:15,311 INFO L158 Benchmark]: Boogie Preprocessor took 24.02ms. Allocated memory is still 123.7MB. Free memory was 94.4MB in the beginning and 92.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-06 18:57:15,312 INFO L158 Benchmark]: RCFGBuilder took 370.94ms. Allocated memory is still 123.7MB. Free memory was 92.8MB in the beginning and 76.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2021-12-06 18:57:15,312 INFO L158 Benchmark]: TraceAbstraction took 44481.82ms. Allocated memory was 123.7MB in the beginning and 629.1MB in the end (delta: 505.4MB). Free memory was 75.5MB in the beginning and 414.0MB in the end (delta: -338.5MB). Peak memory consumption was 416.7MB. Max. memory is 16.1GB. [2021-12-06 18:57:15,312 INFO L158 Benchmark]: Witness Printer took 64.86ms. Allocated memory is still 629.1MB. Free memory was 414.0MB in the beginning and 406.7MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-12-06 18:57:15,314 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.20ms. Allocated memory is still 123.7MB. Free memory is still 103.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 220.82ms. Allocated memory is still 123.7MB. Free memory was 87.0MB in the beginning and 96.5MB in the end (delta: -9.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.11ms. Allocated memory is still 123.7MB. Free memory was 96.5MB in the beginning and 94.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.02ms. Allocated memory is still 123.7MB. Free memory was 94.4MB in the beginning and 92.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 370.94ms. Allocated memory is still 123.7MB. Free memory was 92.8MB in the beginning and 76.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 44481.82ms. Allocated memory was 123.7MB in the beginning and 629.1MB in the end (delta: 505.4MB). Free memory was 75.5MB in the beginning and 414.0MB in the end (delta: -338.5MB). Peak memory consumption was 416.7MB. Max. memory is 16.1GB. * Witness Printer took 64.86ms. Allocated memory is still 629.1MB. Free memory was 414.0MB in the beginning and 406.7MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 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: 44.4s, OverallIterations: 13, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 34.4s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6834 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6729 mSDsluCounter, 8205 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5679 mSDsCounter, 2003 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6275 IncrementalHoareTripleChecker+Invalid, 8278 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2003 mSolverCounterUnsat, 2526 mSDtfsCounter, 6275 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1096 GetRequests, 870 SyntacticMatches, 0 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1170 ImplicationChecksByTransitivity, 1.3s 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: 1.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 1550 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 46 LocationsWithAnnotation, 7671 PreInvPairs, 10405 NumberOfFragments, 1062 HoareAnnotationTreeSize, 7671 FomulaSimplifications, 10320 FormulaSimplificationTreeSizeReduction, 25.4s HoareSimplificationTime, 46 FomulaSimplificationsInter, 3267840 FormulaSimplificationTreeSizeReductionInter, 8.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s 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! [2021-12-06 18:57:15,360 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36820bfc-d3ff-4208-89f5-d3c60aa16187/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE