./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.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_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/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_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/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_103e4f0e-7916-4209-892c-528c3b8d19dd/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 77d80771821c1cd45088b62d9d16474928a377618be5caefce4c7c3ebfdda084 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-06 18:57:24,350 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-06 18:57:24,351 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-06 18:57:24,374 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-06 18:57:24,374 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-06 18:57:24,375 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-06 18:57:24,377 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-06 18:57:24,379 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-06 18:57:24,380 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-06 18:57:24,381 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-06 18:57:24,392 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-06 18:57:24,394 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-06 18:57:24,394 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-06 18:57:24,395 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-06 18:57:24,397 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-06 18:57:24,398 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-06 18:57:24,399 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-06 18:57:24,401 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-06 18:57:24,403 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-06 18:57:24,405 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-06 18:57:24,407 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-06 18:57:24,408 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-06 18:57:24,409 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-06 18:57:24,410 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-06 18:57:24,420 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-06 18:57:24,420 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-06 18:57:24,421 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-06 18:57:24,422 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-06 18:57:24,422 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-06 18:57:24,423 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-06 18:57:24,424 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-06 18:57:24,425 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-06 18:57:24,425 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-06 18:57:24,426 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-06 18:57:24,427 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-06 18:57:24,427 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-06 18:57:24,428 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-06 18:57:24,428 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-06 18:57:24,428 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-06 18:57:24,429 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-06 18:57:24,430 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-06 18:57:24,431 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-06 18:57:24,456 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-06 18:57:24,456 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-06 18:57:24,456 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-06 18:57:24,456 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-06 18:57:24,457 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-06 18:57:24,457 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-06 18:57:24,458 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-06 18:57:24,458 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-06 18:57:24,458 INFO L138 SettingsManager]: * Use SBE=true [2021-12-06 18:57:24,459 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-06 18:57:24,459 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-06 18:57:24,459 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-06 18:57:24,459 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-06 18:57:24,459 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-06 18:57:24,459 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-06 18:57:24,460 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-06 18:57:24,460 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-06 18:57:24,460 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-06 18:57:24,460 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-06 18:57:24,460 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-06 18:57:24,460 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-06 18:57:24,461 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-06 18:57:24,461 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-06 18:57:24,461 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-06 18:57:24,461 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 18:57:24,461 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-06 18:57:24,462 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-06 18:57:24,462 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-06 18:57:24,462 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-06 18:57:24,462 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-06 18:57:24,462 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-06 18:57:24,462 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-06 18:57:24,463 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-06 18:57:24,463 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-06 18:57:24,463 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_103e4f0e-7916-4209-892c-528c3b8d19dd/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_103e4f0e-7916-4209-892c-528c3b8d19dd/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 -> 77d80771821c1cd45088b62d9d16474928a377618be5caefce4c7c3ebfdda084 [2021-12-06 18:57:24,651 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-06 18:57:24,668 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-06 18:57:24,670 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-06 18:57:24,671 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-06 18:57:24,671 INFO L275 PluginConnector]: CDTParser initialized [2021-12-06 18:57:24,672 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c [2021-12-06 18:57:24,716 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/data/889dc7321/ff93900904da46dd81b82bbd598978d7/FLAG7fe7d8251 [2021-12-06 18:57:25,162 INFO L306 CDTParser]: Found 1 translation units. [2021-12-06 18:57:25,162 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c [2021-12-06 18:57:25,169 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/data/889dc7321/ff93900904da46dd81b82bbd598978d7/FLAG7fe7d8251 [2021-12-06 18:57:25,179 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/data/889dc7321/ff93900904da46dd81b82bbd598978d7 [2021-12-06 18:57:25,181 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-06 18:57:25,182 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-06 18:57:25,183 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-06 18:57:25,183 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-06 18:57:25,186 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-06 18:57:25,186 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:57:25" (1/1) ... [2021-12-06 18:57:25,187 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b4bfa9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:57:25, skipping insertion in model container [2021-12-06 18:57:25,187 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:57:25" (1/1) ... [2021-12-06 18:57:25,192 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-06 18:57:25,214 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-06 18:57:25,354 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_103e4f0e-7916-4209-892c-528c3b8d19dd/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c[11857,11870] [2021-12-06 18:57:25,356 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 18:57:25,363 INFO L203 MainTranslator]: Completed pre-run [2021-12-06 18:57:25,402 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_103e4f0e-7916-4209-892c-528c3b8d19dd/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c[11857,11870] [2021-12-06 18:57:25,402 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 18:57:25,413 INFO L208 MainTranslator]: Completed translation [2021-12-06 18:57:25,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:57:25 WrapperNode [2021-12-06 18:57:25,414 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-06 18:57:25,414 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-06 18:57:25,414 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-06 18:57:25,415 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-06 18:57:25,420 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:57:25" (1/1) ... [2021-12-06 18:57:25,428 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:57:25" (1/1) ... [2021-12-06 18:57:25,453 INFO L137 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 410 [2021-12-06 18:57:25,454 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-06 18:57:25,454 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-06 18:57:25,454 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-06 18:57:25,454 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-06 18:57:25,461 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:57:25" (1/1) ... [2021-12-06 18:57:25,461 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:57:25" (1/1) ... [2021-12-06 18:57:25,464 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:57:25" (1/1) ... [2021-12-06 18:57:25,464 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:57:25" (1/1) ... [2021-12-06 18:57:25,472 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:57:25" (1/1) ... [2021-12-06 18:57:25,478 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:57:25" (1/1) ... [2021-12-06 18:57:25,481 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:57:25" (1/1) ... [2021-12-06 18:57:25,485 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-06 18:57:25,485 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-06 18:57:25,486 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-06 18:57:25,486 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-06 18:57:25,486 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:57:25" (1/1) ... [2021-12-06 18:57:25,492 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 18:57:25,503 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 18:57:25,512 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-06 18:57:25,514 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-06 18:57:25,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-06 18:57:25,542 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2021-12-06 18:57:25,542 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2021-12-06 18:57:25,542 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2021-12-06 18:57:25,542 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2021-12-06 18:57:25,542 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2021-12-06 18:57:25,542 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2021-12-06 18:57:25,542 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2021-12-06 18:57:25,543 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2021-12-06 18:57:25,543 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2021-12-06 18:57:25,543 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2021-12-06 18:57:25,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-06 18:57:25,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-06 18:57:25,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-06 18:57:25,619 INFO L236 CfgBuilder]: Building ICFG [2021-12-06 18:57:25,620 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-06 18:57:25,946 INFO L277 CfgBuilder]: Performing block encoding [2021-12-06 18:57:25,952 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-06 18:57:25,953 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-06 18:57:25,954 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:57:25 BoogieIcfgContainer [2021-12-06 18:57:25,954 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-06 18:57:25,955 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-06 18:57:25,955 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-06 18:57:25,958 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-06 18:57:25,958 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:57:25" (1/3) ... [2021-12-06 18:57:25,959 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47ee31a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:57:25, skipping insertion in model container [2021-12-06 18:57:25,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:57:25" (2/3) ... [2021-12-06 18:57:25,959 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47ee31a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:57:25, skipping insertion in model container [2021-12-06 18:57:25,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:57:25" (3/3) ... [2021-12-06 18:57:25,960 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c [2021-12-06 18:57:25,965 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-06 18:57:25,965 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-06 18:57:26,001 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-06 18:57:26,006 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:57:26,006 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-06 18:57:26,021 INFO L276 IsEmpty]: Start isEmpty. Operand has 183 states, 144 states have (on average 1.6041666666666667) internal successors, (231), 148 states have internal predecessors, (231), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2021-12-06 18:57:26,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-06 18:57:26,027 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:57:26,027 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:57:26,027 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:57:26,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:57:26,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1040694260, now seen corresponding path program 1 times [2021-12-06 18:57:26,038 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:57:26,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528732831] [2021-12-06 18:57:26,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:57:26,039 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:57:26,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:26,182 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:57:26,182 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:57:26,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528732831] [2021-12-06 18:57:26,183 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528732831] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:57:26,183 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:57:26,184 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 18:57:26,185 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695527846] [2021-12-06 18:57:26,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:57:26,190 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 18:57:26,190 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:57:26,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 18:57:26,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 18:57:26,219 INFO L87 Difference]: Start difference. First operand has 183 states, 144 states have (on average 1.6041666666666667) internal successors, (231), 148 states have internal predecessors, (231), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:57:26,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:57:26,316 INFO L93 Difference]: Finished difference Result 371 states and 633 transitions. [2021-12-06 18:57:26,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 18:57:26,318 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-06 18:57:26,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:57:26,328 INFO L225 Difference]: With dead ends: 371 [2021-12-06 18:57:26,328 INFO L226 Difference]: Without dead ends: 187 [2021-12-06 18:57:26,334 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-06 18:57:26,337 INFO L933 BasicCegarLoop]: 279 mSDtfsCounter, 18 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 18:57:26,338 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 820 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 18:57:26,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2021-12-06 18:57:26,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2021-12-06 18:57:26,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 146 states have (on average 1.5273972602739727) internal successors, (223), 149 states have internal predecessors, (223), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2021-12-06 18:57:26,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 287 transitions. [2021-12-06 18:57:26,396 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 287 transitions. Word has length 15 [2021-12-06 18:57:26,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:57:26,396 INFO L470 AbstractCegarLoop]: Abstraction has 185 states and 287 transitions. [2021-12-06 18:57:26,397 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:57:26,397 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 287 transitions. [2021-12-06 18:57:26,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-06 18:57:26,398 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:57:26,399 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:57:26,399 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-06 18:57:26,399 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:57:26,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:57:26,400 INFO L85 PathProgramCache]: Analyzing trace with hash 899781387, now seen corresponding path program 1 times [2021-12-06 18:57:26,400 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:57:26,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924752426] [2021-12-06 18:57:26,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:57:26,400 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:57:26,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:26,437 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:57:26,438 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:57:26,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924752426] [2021-12-06 18:57:26,438 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924752426] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:57:26,438 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:57:26,438 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 18:57:26,438 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734434268] [2021-12-06 18:57:26,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:57:26,439 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 18:57:26,439 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:57:26,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 18:57:26,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 18:57:26,440 INFO L87 Difference]: Start difference. First operand 185 states and 287 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:57:26,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:57:26,475 INFO L93 Difference]: Finished difference Result 383 states and 597 transitions. [2021-12-06 18:57:26,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 18:57:26,476 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-06 18:57:26,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:57:26,478 INFO L225 Difference]: With dead ends: 383 [2021-12-06 18:57:26,478 INFO L226 Difference]: Without dead ends: 201 [2021-12-06 18:57:26,479 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-06 18:57:26,480 INFO L933 BasicCegarLoop]: 280 mSDtfsCounter, 25 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 829 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 18:57:26,481 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 829 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 18:57:26,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2021-12-06 18:57:26,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 198. [2021-12-06 18:57:26,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 157 states have (on average 1.5095541401273886) internal successors, (237), 160 states have internal predecessors, (237), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2021-12-06 18:57:26,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 303 transitions. [2021-12-06 18:57:26,497 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 303 transitions. Word has length 16 [2021-12-06 18:57:26,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:57:26,497 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 303 transitions. [2021-12-06 18:57:26,497 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:57:26,497 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 303 transitions. [2021-12-06 18:57:26,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-06 18:57:26,499 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:57:26,499 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] [2021-12-06 18:57:26,499 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-06 18:57:26,499 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:57:26,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:57:26,500 INFO L85 PathProgramCache]: Analyzing trace with hash 977089285, now seen corresponding path program 1 times [2021-12-06 18:57:26,500 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:57:26,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122220681] [2021-12-06 18:57:26,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:57:26,500 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:57:26,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:26,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:57:26,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:26,538 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:57:26,538 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:57:26,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122220681] [2021-12-06 18:57:26,538 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122220681] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:57:26,538 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:57:26,538 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 18:57:26,538 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28105363] [2021-12-06 18:57:26,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:57:26,539 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 18:57:26,539 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:57:26,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 18:57:26,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 18:57:26,539 INFO L87 Difference]: Start difference. First operand 198 states and 303 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-06 18:57:26,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:57:26,556 INFO L93 Difference]: Finished difference Result 415 states and 643 transitions. [2021-12-06 18:57:26,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 18:57:26,557 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2021-12-06 18:57:26,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:57:26,559 INFO L225 Difference]: With dead ends: 415 [2021-12-06 18:57:26,559 INFO L226 Difference]: Without dead ends: 227 [2021-12-06 18:57:26,560 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 18:57:26,561 INFO L933 BasicCegarLoop]: 286 mSDtfsCounter, 22 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 18:57:26,561 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 563 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 18:57:26,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2021-12-06 18:57:26,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 200. [2021-12-06 18:57:26,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 159 states have (on average 1.5031446540880504) internal successors, (239), 162 states have internal predecessors, (239), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2021-12-06 18:57:26,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 305 transitions. [2021-12-06 18:57:26,576 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 305 transitions. Word has length 23 [2021-12-06 18:57:26,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:57:26,576 INFO L470 AbstractCegarLoop]: Abstraction has 200 states and 305 transitions. [2021-12-06 18:57:26,577 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-06 18:57:26,577 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 305 transitions. [2021-12-06 18:57:26,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-06 18:57:26,578 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:57:26,578 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] [2021-12-06 18:57:26,578 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-06 18:57:26,578 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:57:26,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:57:26,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1386108362, now seen corresponding path program 1 times [2021-12-06 18:57:26,579 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:57:26,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445749866] [2021-12-06 18:57:26,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:57:26,580 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:57:26,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:26,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:57:26,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:26,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:57:26,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:26,631 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:57:26,631 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:57:26,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445749866] [2021-12-06 18:57:26,631 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445749866] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:57:26,631 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:57:26,632 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 18:57:26,632 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840203419] [2021-12-06 18:57:26,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:57:26,632 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 18:57:26,632 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:57:26,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 18:57:26,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 18:57:26,633 INFO L87 Difference]: Start difference. First operand 200 states and 305 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 18:57:26,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:57:26,664 INFO L93 Difference]: Finished difference Result 454 states and 708 transitions. [2021-12-06 18:57:26,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 18:57:26,665 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2021-12-06 18:57:26,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:57:26,668 INFO L225 Difference]: With dead ends: 454 [2021-12-06 18:57:26,668 INFO L226 Difference]: Without dead ends: 305 [2021-12-06 18:57:26,668 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-06 18:57:26,669 INFO L933 BasicCegarLoop]: 298 mSDtfsCounter, 130 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 18:57:26,670 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 864 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 18:57:26,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2021-12-06 18:57:26,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 200. [2021-12-06 18:57:26,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 159 states have (on average 1.4779874213836477) internal successors, (235), 162 states have internal predecessors, (235), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2021-12-06 18:57:26,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 301 transitions. [2021-12-06 18:57:26,684 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 301 transitions. Word has length 31 [2021-12-06 18:57:26,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:57:26,684 INFO L470 AbstractCegarLoop]: Abstraction has 200 states and 301 transitions. [2021-12-06 18:57:26,684 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 18:57:26,684 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 301 transitions. [2021-12-06 18:57:26,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-06 18:57:26,685 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:57:26,685 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:57:26,685 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-06 18:57:26,686 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:57:26,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:57:26,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1610752054, now seen corresponding path program 1 times [2021-12-06 18:57:26,689 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:57:26,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674797038] [2021-12-06 18:57:26,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:57:26,689 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:57:26,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:26,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:57:26,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:26,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:57:26,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:26,740 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 18:57:26,740 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:57:26,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674797038] [2021-12-06 18:57:26,740 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674797038] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:57:26,740 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:57:26,740 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 18:57:26,741 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104332778] [2021-12-06 18:57:26,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:57:26,741 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 18:57:26,741 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:57:26,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 18:57:26,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 18:57:26,742 INFO L87 Difference]: Start difference. First operand 200 states and 301 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 18:57:26,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:57:26,761 INFO L93 Difference]: Finished difference Result 390 states and 591 transitions. [2021-12-06 18:57:26,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 18:57:26,762 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2021-12-06 18:57:26,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:57:26,764 INFO L225 Difference]: With dead ends: 390 [2021-12-06 18:57:26,764 INFO L226 Difference]: Without dead ends: 202 [2021-12-06 18:57:26,765 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 18:57:26,765 INFO L933 BasicCegarLoop]: 276 mSDtfsCounter, 0 mSDsluCounter, 820 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1096 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 18:57:26,766 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1096 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 18:57:26,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-12-06 18:57:26,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 200. [2021-12-06 18:57:26,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 159 states have (on average 1.471698113207547) internal successors, (234), 162 states have internal predecessors, (234), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2021-12-06 18:57:26,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 300 transitions. [2021-12-06 18:57:26,776 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 300 transitions. Word has length 32 [2021-12-06 18:57:26,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:57:26,776 INFO L470 AbstractCegarLoop]: Abstraction has 200 states and 300 transitions. [2021-12-06 18:57:26,776 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 18:57:26,776 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 300 transitions. [2021-12-06 18:57:26,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-06 18:57:26,777 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:57:26,777 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:57:26,778 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-06 18:57:26,778 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:57:26,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:57:26,778 INFO L85 PathProgramCache]: Analyzing trace with hash 839076892, now seen corresponding path program 1 times [2021-12-06 18:57:26,778 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:57:26,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154917911] [2021-12-06 18:57:26,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:57:26,779 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:57:26,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:26,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:57:26,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:26,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:57:26,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:26,821 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 18:57:26,821 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:57:26,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154917911] [2021-12-06 18:57:26,821 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154917911] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 18:57:26,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589963451] [2021-12-06 18:57:26,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:57:26,821 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:57:26,822 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 18:57:26,822 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 18:57:26,823 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-06 18:57:26,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:26,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 18:57:26,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 18:57:26,954 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 18:57:26,955 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 18:57:27,016 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 18:57:27,016 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [589963451] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 18:57:27,016 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 18:57:27,016 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2021-12-06 18:57:27,016 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33593489] [2021-12-06 18:57:27,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 18:57:27,017 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 18:57:27,017 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:57:27,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 18:57:27,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-12-06 18:57:27,018 INFO L87 Difference]: Start difference. First operand 200 states and 300 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-06 18:57:27,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:57:27,051 INFO L93 Difference]: Finished difference Result 448 states and 687 transitions. [2021-12-06 18:57:27,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 18:57:27,052 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 35 [2021-12-06 18:57:27,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:57:27,058 INFO L225 Difference]: With dead ends: 448 [2021-12-06 18:57:27,058 INFO L226 Difference]: Without dead ends: 259 [2021-12-06 18:57:27,059 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-12-06 18:57:27,060 INFO L933 BasicCegarLoop]: 291 mSDtfsCounter, 66 mSDsluCounter, 791 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 1082 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 18:57:27,060 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 1082 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 18:57:27,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2021-12-06 18:57:27,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 253. [2021-12-06 18:57:27,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 202 states have (on average 1.4504950495049505) internal successors, (293), 205 states have internal predecessors, (293), 43 states have call successors, (43), 7 states have call predecessors, (43), 7 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2021-12-06 18:57:27,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 379 transitions. [2021-12-06 18:57:27,072 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 379 transitions. Word has length 35 [2021-12-06 18:57:27,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:57:27,073 INFO L470 AbstractCegarLoop]: Abstraction has 253 states and 379 transitions. [2021-12-06 18:57:27,073 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-06 18:57:27,073 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 379 transitions. [2021-12-06 18:57:27,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-06 18:57:27,074 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:57:27,075 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:57:27,105 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-06 18:57:27,275 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:57:27,276 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:57:27,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:57:27,276 INFO L85 PathProgramCache]: Analyzing trace with hash 346203964, now seen corresponding path program 2 times [2021-12-06 18:57:27,276 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:57:27,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814187987] [2021-12-06 18:57:27,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:57:27,277 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:57:27,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:27,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:57:27,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:27,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:57:27,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:27,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:57:27,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:27,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:57:27,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:27,344 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2021-12-06 18:57:27,344 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:57:27,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814187987] [2021-12-06 18:57:27,344 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814187987] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:57:27,344 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:57:27,344 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 18:57:27,345 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327914603] [2021-12-06 18:57:27,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:57:27,345 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 18:57:27,345 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:57:27,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 18:57:27,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 18:57:27,346 INFO L87 Difference]: Start difference. First operand 253 states and 379 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 18:57:27,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:57:27,378 INFO L93 Difference]: Finished difference Result 486 states and 748 transitions. [2021-12-06 18:57:27,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 18:57:27,379 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 57 [2021-12-06 18:57:27,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:57:27,381 INFO L225 Difference]: With dead ends: 486 [2021-12-06 18:57:27,381 INFO L226 Difference]: Without dead ends: 262 [2021-12-06 18:57:27,382 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-06 18:57:27,382 INFO L933 BasicCegarLoop]: 275 mSDtfsCounter, 19 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 18:57:27,383 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 807 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 18:57:27,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2021-12-06 18:57:27,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2021-12-06 18:57:27,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 208 states have (on average 1.4471153846153846) internal successors, (301), 211 states have internal predecessors, (301), 43 states have call successors, (43), 8 states have call predecessors, (43), 8 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2021-12-06 18:57:27,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 387 transitions. [2021-12-06 18:57:27,394 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 387 transitions. Word has length 57 [2021-12-06 18:57:27,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:57:27,395 INFO L470 AbstractCegarLoop]: Abstraction has 260 states and 387 transitions. [2021-12-06 18:57:27,395 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 18:57:27,395 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 387 transitions. [2021-12-06 18:57:27,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-06 18:57:27,396 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:57:27,396 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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:57:27,397 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-06 18:57:27,397 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:57:27,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:57:27,397 INFO L85 PathProgramCache]: Analyzing trace with hash -562676277, now seen corresponding path program 1 times [2021-12-06 18:57:27,397 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:57:27,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919768480] [2021-12-06 18:57:27,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:57:27,397 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:57:27,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:27,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:57:27,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:27,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:57:27,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:27,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:57:27,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:27,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:57:27,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:27,441 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-12-06 18:57:27,441 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:57:27,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919768480] [2021-12-06 18:57:27,442 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919768480] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:57:27,442 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:57:27,442 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 18:57:27,442 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456044534] [2021-12-06 18:57:27,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:57:27,442 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 18:57:27,443 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:57:27,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 18:57:27,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 18:57:27,443 INFO L87 Difference]: Start difference. First operand 260 states and 387 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 18:57:27,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:57:27,472 INFO L93 Difference]: Finished difference Result 530 states and 800 transitions. [2021-12-06 18:57:27,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 18:57:27,473 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 57 [2021-12-06 18:57:27,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:57:27,475 INFO L225 Difference]: With dead ends: 530 [2021-12-06 18:57:27,475 INFO L226 Difference]: Without dead ends: 299 [2021-12-06 18:57:27,476 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-06 18:57:27,477 INFO L933 BasicCegarLoop]: 282 mSDtfsCounter, 24 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 18:57:27,477 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 821 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 18:57:27,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2021-12-06 18:57:27,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 296. [2021-12-06 18:57:27,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 240 states have (on average 1.4083333333333334) internal successors, (338), 243 states have internal predecessors, (338), 46 states have call successors, (46), 9 states have call predecessors, (46), 9 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2021-12-06 18:57:27,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 430 transitions. [2021-12-06 18:57:27,489 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 430 transitions. Word has length 57 [2021-12-06 18:57:27,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:57:27,489 INFO L470 AbstractCegarLoop]: Abstraction has 296 states and 430 transitions. [2021-12-06 18:57:27,489 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 18:57:27,489 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 430 transitions. [2021-12-06 18:57:27,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-12-06 18:57:27,490 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:57:27,490 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:57:27,490 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-06 18:57:27,491 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:57:27,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:57:27,491 INFO L85 PathProgramCache]: Analyzing trace with hash 747834355, now seen corresponding path program 1 times [2021-12-06 18:57:27,491 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:57:27,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595621704] [2021-12-06 18:57:27,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:57:27,491 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:57:27,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:27,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:57:27,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:27,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:57:27,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:27,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:57:27,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:27,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:57:27,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:27,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:57:27,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:27,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:57:27,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:27,561 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-12-06 18:57:27,561 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:57:27,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595621704] [2021-12-06 18:57:27,561 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595621704] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:57:27,561 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:57:27,561 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 18:57:27,561 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118564994] [2021-12-06 18:57:27,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:57:27,562 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 18:57:27,562 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:57:27,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 18:57:27,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 18:57:27,563 INFO L87 Difference]: Start difference. First operand 296 states and 430 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-06 18:57:27,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:57:27,583 INFO L93 Difference]: Finished difference Result 541 states and 799 transitions. [2021-12-06 18:57:27,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 18:57:27,584 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 75 [2021-12-06 18:57:27,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:57:27,586 INFO L225 Difference]: With dead ends: 541 [2021-12-06 18:57:27,586 INFO L226 Difference]: Without dead ends: 298 [2021-12-06 18:57:27,587 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 18:57:27,588 INFO L933 BasicCegarLoop]: 276 mSDtfsCounter, 0 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1095 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 18:57:27,588 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1095 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 18:57:27,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2021-12-06 18:57:27,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 296. [2021-12-06 18:57:27,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 240 states have (on average 1.3958333333333333) internal successors, (335), 243 states have internal predecessors, (335), 46 states have call successors, (46), 9 states have call predecessors, (46), 9 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2021-12-06 18:57:27,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 427 transitions. [2021-12-06 18:57:27,601 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 427 transitions. Word has length 75 [2021-12-06 18:57:27,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:57:27,602 INFO L470 AbstractCegarLoop]: Abstraction has 296 states and 427 transitions. [2021-12-06 18:57:27,602 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-06 18:57:27,602 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 427 transitions. [2021-12-06 18:57:27,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-12-06 18:57:27,603 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:57:27,603 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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:57:27,603 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-06 18:57:27,604 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:57:27,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:57:27,604 INFO L85 PathProgramCache]: Analyzing trace with hash -951154883, now seen corresponding path program 1 times [2021-12-06 18:57:27,604 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:57:27,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693742397] [2021-12-06 18:57:27,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:57:27,604 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:57:27,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:27,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:57:27,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:27,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:57:27,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:27,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:57:27,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:27,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:57:27,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:27,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:57:27,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:27,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:57:27,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:27,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:57:27,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:27,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:57:27,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:27,673 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2021-12-06 18:57:27,673 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:57:27,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693742397] [2021-12-06 18:57:27,674 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693742397] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:57:27,674 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:57:27,674 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 18:57:27,674 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792344678] [2021-12-06 18:57:27,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:57:27,674 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 18:57:27,674 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:57:27,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 18:57:27,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 18:57:27,675 INFO L87 Difference]: Start difference. First operand 296 states and 427 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-06 18:57:27,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:57:27,714 INFO L93 Difference]: Finished difference Result 578 states and 855 transitions. [2021-12-06 18:57:27,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 18:57:27,715 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 104 [2021-12-06 18:57:27,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:57:27,718 INFO L225 Difference]: With dead ends: 578 [2021-12-06 18:57:27,718 INFO L226 Difference]: Without dead ends: 340 [2021-12-06 18:57:27,719 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-06 18:57:27,720 INFO L933 BasicCegarLoop]: 282 mSDtfsCounter, 25 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 18:57:27,720 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 821 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 18:57:27,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2021-12-06 18:57:27,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 337. [2021-12-06 18:57:27,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 277 states have (on average 1.3610108303249098) internal successors, (377), 280 states have internal predecessors, (377), 49 states have call successors, (49), 10 states have call predecessors, (49), 10 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2021-12-06 18:57:27,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 475 transitions. [2021-12-06 18:57:27,738 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 475 transitions. Word has length 104 [2021-12-06 18:57:27,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:57:27,739 INFO L470 AbstractCegarLoop]: Abstraction has 337 states and 475 transitions. [2021-12-06 18:57:27,739 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-06 18:57:27,739 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 475 transitions. [2021-12-06 18:57:27,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-12-06 18:57:27,741 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:57:27,741 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:57:27,741 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-06 18:57:27,741 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:57:27,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:57:27,742 INFO L85 PathProgramCache]: Analyzing trace with hash 598920618, now seen corresponding path program 1 times [2021-12-06 18:57:27,742 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:57:27,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970951213] [2021-12-06 18:57:27,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:57:27,742 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:57:27,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:27,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:57:27,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:27,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:57:27,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:27,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:57:27,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:27,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:57:27,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:27,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:57:27,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:27,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:57:27,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:27,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:57:27,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:27,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:57:27,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:27,804 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-12-06 18:57:27,805 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:57:27,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970951213] [2021-12-06 18:57:27,805 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970951213] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:57:27,805 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:57:27,805 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 18:57:27,805 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776553469] [2021-12-06 18:57:27,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:57:27,806 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 18:57:27,806 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:57:27,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 18:57:27,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 18:57:27,807 INFO L87 Difference]: Start difference. First operand 337 states and 475 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-06 18:57:27,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:57:27,844 INFO L93 Difference]: Finished difference Result 604 states and 875 transitions. [2021-12-06 18:57:27,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 18:57:27,845 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 105 [2021-12-06 18:57:27,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:57:27,847 INFO L225 Difference]: With dead ends: 604 [2021-12-06 18:57:27,847 INFO L226 Difference]: Without dead ends: 331 [2021-12-06 18:57:27,848 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-06 18:57:27,848 INFO L933 BasicCegarLoop]: 268 mSDtfsCounter, 15 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 18:57:27,849 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 780 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 18:57:27,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2021-12-06 18:57:27,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 331. [2021-12-06 18:57:27,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 272 states have (on average 1.3419117647058822) internal successors, (365), 275 states have internal predecessors, (365), 48 states have call successors, (48), 10 states have call predecessors, (48), 10 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2021-12-06 18:57:27,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 461 transitions. [2021-12-06 18:57:27,860 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 461 transitions. Word has length 105 [2021-12-06 18:57:27,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:57:27,861 INFO L470 AbstractCegarLoop]: Abstraction has 331 states and 461 transitions. [2021-12-06 18:57:27,861 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-06 18:57:27,861 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 461 transitions. [2021-12-06 18:57:27,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2021-12-06 18:57:27,862 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:57:27,862 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-12-06 18:57:27,862 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-06 18:57:27,862 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:57:27,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:57:27,863 INFO L85 PathProgramCache]: Analyzing trace with hash -590102049, now seen corresponding path program 1 times [2021-12-06 18:57:27,863 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:57:27,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224044685] [2021-12-06 18:57:27,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:57:27,863 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:57:27,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:27,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:57:27,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:27,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:57:27,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:27,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:57:27,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:27,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:57:27,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:27,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:57:27,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:27,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:57:27,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:27,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:57:27,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:27,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:57:27,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:27,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:57:27,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:27,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:57:27,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:27,932 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2021-12-06 18:57:27,932 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:57:27,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224044685] [2021-12-06 18:57:27,933 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224044685] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:57:27,933 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:57:27,933 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 18:57:27,933 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633960430] [2021-12-06 18:57:27,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:57:27,933 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 18:57:27,933 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:57:27,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 18:57:27,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 18:57:27,934 INFO L87 Difference]: Start difference. First operand 331 states and 461 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-06 18:57:27,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:57:27,951 INFO L93 Difference]: Finished difference Result 579 states and 824 transitions. [2021-12-06 18:57:27,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 18:57:27,952 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 124 [2021-12-06 18:57:27,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:57:27,954 INFO L225 Difference]: With dead ends: 579 [2021-12-06 18:57:27,954 INFO L226 Difference]: Without dead ends: 333 [2021-12-06 18:57:27,955 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 18:57:27,955 INFO L933 BasicCegarLoop]: 272 mSDtfsCounter, 0 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 18:57:27,955 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1079 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 18:57:27,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2021-12-06 18:57:27,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 331. [2021-12-06 18:57:27,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 272 states have (on average 1.3308823529411764) internal successors, (362), 275 states have internal predecessors, (362), 48 states have call successors, (48), 10 states have call predecessors, (48), 10 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2021-12-06 18:57:27,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 458 transitions. [2021-12-06 18:57:27,966 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 458 transitions. Word has length 124 [2021-12-06 18:57:27,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:57:27,967 INFO L470 AbstractCegarLoop]: Abstraction has 331 states and 458 transitions. [2021-12-06 18:57:27,967 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-06 18:57:27,967 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 458 transitions. [2021-12-06 18:57:27,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-12-06 18:57:27,968 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:57:27,969 INFO L514 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 7, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:57:27,969 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-06 18:57:27,969 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:57:27,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:57:27,969 INFO L85 PathProgramCache]: Analyzing trace with hash -717601583, now seen corresponding path program 1 times [2021-12-06 18:57:27,969 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:57:27,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262792207] [2021-12-06 18:57:27,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:57:27,970 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:57:27,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:28,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:57:28,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:28,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:57:28,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:28,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:57:28,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:28,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:57:28,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:28,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:57:28,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:28,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:57:28,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:28,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:57:28,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:28,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:57:28,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:28,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:57:28,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:28,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:57:28,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:28,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:57:28,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:28,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:57:28,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:28,045 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 399 trivial. 0 not checked. [2021-12-06 18:57:28,045 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:57:28,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262792207] [2021-12-06 18:57:28,045 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262792207] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:57:28,046 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:57:28,046 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 18:57:28,046 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134395229] [2021-12-06 18:57:28,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:57:28,046 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 18:57:28,047 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:57:28,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 18:57:28,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 18:57:28,047 INFO L87 Difference]: Start difference. First operand 331 states and 458 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-06 18:57:28,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:57:28,092 INFO L93 Difference]: Finished difference Result 542 states and 784 transitions. [2021-12-06 18:57:28,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 18:57:28,093 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 157 [2021-12-06 18:57:28,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:57:28,096 INFO L225 Difference]: With dead ends: 542 [2021-12-06 18:57:28,096 INFO L226 Difference]: Without dead ends: 329 [2021-12-06 18:57:28,097 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-06 18:57:28,097 INFO L933 BasicCegarLoop]: 256 mSDtfsCounter, 13 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 18:57:28,098 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 748 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 18:57:28,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2021-12-06 18:57:28,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 329. [2021-12-06 18:57:28,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 271 states have (on average 1.3284132841328413) internal successors, (360), 274 states have internal predecessors, (360), 47 states have call successors, (47), 10 states have call predecessors, (47), 10 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2021-12-06 18:57:28,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 454 transitions. [2021-12-06 18:57:28,113 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 454 transitions. Word has length 157 [2021-12-06 18:57:28,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:57:28,114 INFO L470 AbstractCegarLoop]: Abstraction has 329 states and 454 transitions. [2021-12-06 18:57:28,114 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-06 18:57:28,114 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 454 transitions. [2021-12-06 18:57:28,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2021-12-06 18:57:28,117 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:57:28,117 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:28,117 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-06 18:57:28,117 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:57:28,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:57:28,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1055792649, now seen corresponding path program 1 times [2021-12-06 18:57:28,118 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:57:28,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711070500] [2021-12-06 18:57:28,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:57:28,118 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:57:28,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:28,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:57:28,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:28,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:57:28,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:28,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:57:28,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:28,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:57:28,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:28,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:57:28,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:28,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:57:28,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:28,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:57:28,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:28,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:57:28,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:28,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:57:28,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:28,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:57:28,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:28,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:57:28,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:28,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:57:28,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:28,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:57:28,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:28,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:57:28,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:28,211 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2021-12-06 18:57:28,211 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:57:28,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711070500] [2021-12-06 18:57:28,212 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711070500] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:57:28,212 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:57:28,212 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 18:57:28,212 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092855022] [2021-12-06 18:57:28,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:57:28,212 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 18:57:28,212 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:57:28,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 18:57:28,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 18:57:28,213 INFO L87 Difference]: Start difference. First operand 329 states and 454 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-06 18:57:28,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:57:28,250 INFO L93 Difference]: Finished difference Result 482 states and 680 transitions. [2021-12-06 18:57:28,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 18:57:28,251 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 172 [2021-12-06 18:57:28,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:57:28,253 INFO L225 Difference]: With dead ends: 482 [2021-12-06 18:57:28,253 INFO L226 Difference]: Without dead ends: 312 [2021-12-06 18:57:28,254 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-06 18:57:28,255 INFO L933 BasicCegarLoop]: 255 mSDtfsCounter, 35 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 18:57:28,255 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 729 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 18:57:28,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2021-12-06 18:57:28,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2021-12-06 18:57:28,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 257 states have (on average 1.3190661478599222) internal successors, (339), 260 states have internal predecessors, (339), 44 states have call successors, (44), 10 states have call predecessors, (44), 10 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2021-12-06 18:57:28,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 427 transitions. [2021-12-06 18:57:28,270 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 427 transitions. Word has length 172 [2021-12-06 18:57:28,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:57:28,270 INFO L470 AbstractCegarLoop]: Abstraction has 312 states and 427 transitions. [2021-12-06 18:57:28,270 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-06 18:57:28,271 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 427 transitions. [2021-12-06 18:57:28,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2021-12-06 18:57:28,273 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:57:28,273 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:28,273 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-06 18:57:28,274 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:57:28,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:57:28,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1214123782, now seen corresponding path program 1 times [2021-12-06 18:57:28,274 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:57:28,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099011709] [2021-12-06 18:57:28,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:57:28,275 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:57:28,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:28,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:57:28,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:28,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:57:28,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:28,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:57:28,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:28,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:57:28,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:28,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:57:28,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:28,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:57:28,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:28,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:57:28,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:28,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:57:28,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:28,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:57:28,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:28,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:57:28,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:28,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:57:28,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:28,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:57:28,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:28,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:57:28,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:28,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:57:28,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:28,378 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2021-12-06 18:57:28,378 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:57:28,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099011709] [2021-12-06 18:57:28,378 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099011709] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:57:28,378 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:57:28,378 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 18:57:28,379 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552885687] [2021-12-06 18:57:28,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:57:28,379 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 18:57:28,379 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:57:28,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 18:57:28,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 18:57:28,380 INFO L87 Difference]: Start difference. First operand 312 states and 427 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-06 18:57:28,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:57:28,424 INFO L93 Difference]: Finished difference Result 465 states and 653 transitions. [2021-12-06 18:57:28,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 18:57:28,424 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 174 [2021-12-06 18:57:28,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:57:28,427 INFO L225 Difference]: With dead ends: 465 [2021-12-06 18:57:28,427 INFO L226 Difference]: Without dead ends: 293 [2021-12-06 18:57:28,428 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-06 18:57:28,429 INFO L933 BasicCegarLoop]: 260 mSDtfsCounter, 30 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 18:57:28,429 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 733 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 18:57:28,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2021-12-06 18:57:28,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2021-12-06 18:57:28,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 241 states have (on average 1.3112033195020747) internal successors, (316), 244 states have internal predecessors, (316), 41 states have call successors, (41), 10 states have call predecessors, (41), 10 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2021-12-06 18:57:28,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 398 transitions. [2021-12-06 18:57:28,442 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 398 transitions. Word has length 174 [2021-12-06 18:57:28,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:57:28,443 INFO L470 AbstractCegarLoop]: Abstraction has 293 states and 398 transitions. [2021-12-06 18:57:28,443 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-06 18:57:28,443 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 398 transitions. [2021-12-06 18:57:28,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2021-12-06 18:57:28,445 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:57:28,446 INFO L514 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 7, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:28,446 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-06 18:57:28,446 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:57:28,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:57:28,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1416861431, now seen corresponding path program 1 times [2021-12-06 18:57:28,447 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:57:28,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484317046] [2021-12-06 18:57:28,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:57:28,447 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:57:28,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:28,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:57:28,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:28,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:57:28,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:28,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:57:28,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:28,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:57:28,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:28,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:57:28,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:28,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:57:28,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:28,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:57:28,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:28,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:57:28,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:28,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:57:28,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:28,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:57:28,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:28,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:57:28,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:28,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:57:28,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:28,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:57:28,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:28,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:57:28,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:28,540 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 399 trivial. 0 not checked. [2021-12-06 18:57:28,540 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:57:28,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484317046] [2021-12-06 18:57:28,540 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484317046] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:57:28,540 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:57:28,540 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 18:57:28,540 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392361599] [2021-12-06 18:57:28,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:57:28,541 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 18:57:28,541 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:57:28,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 18:57:28,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 18:57:28,541 INFO L87 Difference]: Start difference. First operand 293 states and 398 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2021-12-06 18:57:28,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:57:28,555 INFO L93 Difference]: Finished difference Result 445 states and 623 transitions. [2021-12-06 18:57:28,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 18:57:28,555 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 175 [2021-12-06 18:57:28,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:57:28,557 INFO L225 Difference]: With dead ends: 445 [2021-12-06 18:57:28,557 INFO L226 Difference]: Without dead ends: 293 [2021-12-06 18:57:28,558 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 18:57:28,558 INFO L933 BasicCegarLoop]: 266 mSDtfsCounter, 0 mSDsluCounter, 791 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1057 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 18:57:28,559 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1057 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 18:57:28,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2021-12-06 18:57:28,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2021-12-06 18:57:28,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 241 states have (on average 1.2863070539419088) internal successors, (310), 244 states have internal predecessors, (310), 41 states have call successors, (41), 10 states have call predecessors, (41), 10 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2021-12-06 18:57:28,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 392 transitions. [2021-12-06 18:57:28,568 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 392 transitions. Word has length 175 [2021-12-06 18:57:28,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:57:28,568 INFO L470 AbstractCegarLoop]: Abstraction has 293 states and 392 transitions. [2021-12-06 18:57:28,568 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2021-12-06 18:57:28,568 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 392 transitions. [2021-12-06 18:57:28,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2021-12-06 18:57:28,570 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:57:28,570 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 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:57:28,570 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-06 18:57:28,570 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:57:28,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:57:28,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1467403298, now seen corresponding path program 1 times [2021-12-06 18:57:28,571 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:57:28,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462673951] [2021-12-06 18:57:28,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:57:28,571 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:57:28,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:28,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:57:28,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:28,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:57:28,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:28,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:57:28,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:28,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:57:28,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:28,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:57:28,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:28,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:57:28,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:28,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:57:28,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:28,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:57:28,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:28,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:57:28,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:28,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:57:28,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:28,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:57:28,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:28,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:57:28,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:28,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:57:28,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:28,645 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 138 proven. 11 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2021-12-06 18:57:28,646 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:57:28,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462673951] [2021-12-06 18:57:28,646 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462673951] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 18:57:28,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [965711783] [2021-12-06 18:57:28,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:57:28,646 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:57:28,646 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 18:57:28,647 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 18:57:28,653 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-06 18:57:28,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:28,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-06 18:57:28,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 18:57:28,920 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 138 proven. 11 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2021-12-06 18:57:28,920 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 18:57:29,110 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2021-12-06 18:57:29,111 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [965711783] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-06 18:57:29,111 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-12-06 18:57:29,111 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 5 [2021-12-06 18:57:29,111 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564730831] [2021-12-06 18:57:29,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:57:29,112 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 18:57:29,112 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:57:29,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 18:57:29,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-06 18:57:29,112 INFO L87 Difference]: Start difference. First operand 293 states and 392 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2021-12-06 18:57:29,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:57:29,142 INFO L93 Difference]: Finished difference Result 466 states and 645 transitions. [2021-12-06 18:57:29,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 18:57:29,143 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 182 [2021-12-06 18:57:29,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:57:29,145 INFO L225 Difference]: With dead ends: 466 [2021-12-06 18:57:29,145 INFO L226 Difference]: Without dead ends: 272 [2021-12-06 18:57:29,146 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 388 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-06 18:57:29,147 INFO L933 BasicCegarLoop]: 263 mSDtfsCounter, 35 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 18:57:29,147 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 501 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 18:57:29,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2021-12-06 18:57:29,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2021-12-06 18:57:29,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 223 states have (on average 1.2780269058295963) internal successors, (285), 226 states have internal predecessors, (285), 38 states have call successors, (38), 10 states have call predecessors, (38), 10 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2021-12-06 18:57:29,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 361 transitions. [2021-12-06 18:57:29,161 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 361 transitions. Word has length 182 [2021-12-06 18:57:29,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:57:29,161 INFO L470 AbstractCegarLoop]: Abstraction has 272 states and 361 transitions. [2021-12-06 18:57:29,161 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2021-12-06 18:57:29,162 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 361 transitions. [2021-12-06 18:57:29,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2021-12-06 18:57:29,164 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:57:29,164 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 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:57:29,198 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-06 18:57:29,365 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-12-06 18:57:29,366 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:57:29,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:57:29,368 INFO L85 PathProgramCache]: Analyzing trace with hash 347787473, now seen corresponding path program 1 times [2021-12-06 18:57:29,368 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:57:29,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900143909] [2021-12-06 18:57:29,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:57:29,369 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:57:29,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:29,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:57:29,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:29,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:57:29,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:29,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:57:29,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:29,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:57:29,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:29,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:57:29,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:29,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:57:29,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:29,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:57:29,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:29,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:57:29,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:29,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:57:29,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:29,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:57:29,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:29,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:57:29,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:29,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:57:29,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:29,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:57:29,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:29,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:57:29,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:29,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:57:29,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:29,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:57:29,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:29,586 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2021-12-06 18:57:29,586 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:57:29,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900143909] [2021-12-06 18:57:29,586 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900143909] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:57:29,586 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:57:29,587 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 18:57:29,587 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149325867] [2021-12-06 18:57:29,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:57:29,587 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 18:57:29,587 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:57:29,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 18:57:29,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 18:57:29,588 INFO L87 Difference]: Start difference. First operand 272 states and 361 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2021-12-06 18:57:29,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:57:29,608 INFO L93 Difference]: Finished difference Result 423 states and 587 transitions. [2021-12-06 18:57:29,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 18:57:29,608 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 206 [2021-12-06 18:57:29,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:57:29,611 INFO L225 Difference]: With dead ends: 423 [2021-12-06 18:57:29,611 INFO L226 Difference]: Without dead ends: 278 [2021-12-06 18:57:29,612 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-06 18:57:29,613 INFO L933 BasicCegarLoop]: 260 mSDtfsCounter, 6 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 18:57:29,613 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 773 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 18:57:29,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2021-12-06 18:57:29,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 276. [2021-12-06 18:57:29,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 226 states have (on average 1.2743362831858407) internal successors, (288), 229 states have internal predecessors, (288), 38 states have call successors, (38), 11 states have call predecessors, (38), 11 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2021-12-06 18:57:29,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 364 transitions. [2021-12-06 18:57:29,626 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 364 transitions. Word has length 206 [2021-12-06 18:57:29,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:57:29,627 INFO L470 AbstractCegarLoop]: Abstraction has 276 states and 364 transitions. [2021-12-06 18:57:29,627 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2021-12-06 18:57:29,627 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 364 transitions. [2021-12-06 18:57:29,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2021-12-06 18:57:29,630 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:57:29,630 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-12-06 18:57:29,630 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-06 18:57:29,630 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:57:29,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:57:29,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1054391106, now seen corresponding path program 1 times [2021-12-06 18:57:29,631 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:57:29,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060891293] [2021-12-06 18:57:29,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:57:29,631 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:57:29,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:29,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:57:29,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:29,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:57:29,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:29,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:57:29,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:29,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:57:29,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:29,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:57:29,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:29,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:57:29,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:29,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:57:29,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:29,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:57:29,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:29,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:57:29,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:29,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:57:29,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:29,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:57:29,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:29,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:57:29,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:29,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:57:29,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:29,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:57:29,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:29,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:57:29,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:29,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:57:29,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:29,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-06 18:57:29,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:29,749 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2021-12-06 18:57:29,749 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:57:29,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060891293] [2021-12-06 18:57:29,749 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060891293] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 18:57:29,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421114599] [2021-12-06 18:57:29,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:57:29,749 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:57:29,750 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 18:57:29,752 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 18:57:29,753 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-06 18:57:29,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:29,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 694 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-06 18:57:29,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 18:57:30,022 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2021-12-06 18:57:30,022 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 18:57:30,022 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [421114599] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:57:30,022 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 18:57:30,022 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2021-12-06 18:57:30,023 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467396493] [2021-12-06 18:57:30,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:57:30,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 18:57:30,023 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:57:30,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 18:57:30,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 18:57:30,024 INFO L87 Difference]: Start difference. First operand 276 states and 364 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2021-12-06 18:57:30,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:57:30,044 INFO L93 Difference]: Finished difference Result 432 states and 594 transitions. [2021-12-06 18:57:30,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 18:57:30,044 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 215 [2021-12-06 18:57:30,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:57:30,046 INFO L225 Difference]: With dead ends: 432 [2021-12-06 18:57:30,046 INFO L226 Difference]: Without dead ends: 283 [2021-12-06 18:57:30,047 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-06 18:57:30,047 INFO L933 BasicCegarLoop]: 262 mSDtfsCounter, 7 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 18:57:30,047 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 778 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 18:57:30,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2021-12-06 18:57:30,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 281. [2021-12-06 18:57:30,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 230 states have (on average 1.2695652173913043) internal successors, (292), 233 states have internal predecessors, (292), 38 states have call successors, (38), 12 states have call predecessors, (38), 12 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2021-12-06 18:57:30,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 368 transitions. [2021-12-06 18:57:30,056 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 368 transitions. Word has length 215 [2021-12-06 18:57:30,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:57:30,056 INFO L470 AbstractCegarLoop]: Abstraction has 281 states and 368 transitions. [2021-12-06 18:57:30,056 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2021-12-06 18:57:30,056 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 368 transitions. [2021-12-06 18:57:30,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2021-12-06 18:57:30,057 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:57:30,058 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:30,090 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-06 18:57:30,258 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:57:30,258 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:57:30,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:57:30,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1477420628, now seen corresponding path program 1 times [2021-12-06 18:57:30,259 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:57:30,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914419226] [2021-12-06 18:57:30,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:57:30,259 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:57:30,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:30,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:57:30,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:30,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:57:30,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:30,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:57:30,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:30,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:57:30,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:30,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:57:30,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:30,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:57:30,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:30,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:57:30,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:30,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:57:30,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:30,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:57:30,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:30,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:57:30,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:30,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:57:30,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:30,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:57:30,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:30,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:57:30,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:30,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:57:30,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:30,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:57:30,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:30,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:57:30,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:30,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-06 18:57:30,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:30,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-12-06 18:57:30,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:30,355 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2021-12-06 18:57:30,355 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:57:30,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914419226] [2021-12-06 18:57:30,356 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914419226] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 18:57:30,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978998874] [2021-12-06 18:57:30,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:57:30,356 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:57:30,356 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 18:57:30,357 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 18:57:30,357 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-06 18:57:30,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:30,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 755 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-06 18:57:30,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 18:57:30,634 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2021-12-06 18:57:30,634 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 18:57:30,635 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [978998874] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:57:30,635 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 18:57:30,635 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2021-12-06 18:57:30,635 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546709610] [2021-12-06 18:57:30,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:57:30,636 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 18:57:30,636 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:57:30,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 18:57:30,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 18:57:30,637 INFO L87 Difference]: Start difference. First operand 281 states and 368 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2021-12-06 18:57:30,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:57:30,667 INFO L93 Difference]: Finished difference Result 434 states and 592 transitions. [2021-12-06 18:57:30,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 18:57:30,668 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 225 [2021-12-06 18:57:30,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:57:30,670 INFO L225 Difference]: With dead ends: 434 [2021-12-06 18:57:30,670 INFO L226 Difference]: Without dead ends: 280 [2021-12-06 18:57:30,671 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-06 18:57:30,672 INFO L933 BasicCegarLoop]: 258 mSDtfsCounter, 7 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 18:57:30,672 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 764 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 18:57:30,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2021-12-06 18:57:30,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2021-12-06 18:57:30,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 230 states have (on average 1.2565217391304349) internal successors, (289), 232 states have internal predecessors, (289), 37 states have call successors, (37), 12 states have call predecessors, (37), 12 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2021-12-06 18:57:30,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 363 transitions. [2021-12-06 18:57:30,685 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 363 transitions. Word has length 225 [2021-12-06 18:57:30,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:57:30,685 INFO L470 AbstractCegarLoop]: Abstraction has 280 states and 363 transitions. [2021-12-06 18:57:30,686 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2021-12-06 18:57:30,686 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 363 transitions. [2021-12-06 18:57:30,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2021-12-06 18:57:30,687 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:57:30,688 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-12-06 18:57:30,722 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-12-06 18:57:30,888 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:57:30,889 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:57:30,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:57:30,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1684487284, now seen corresponding path program 1 times [2021-12-06 18:57:30,889 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:57:30,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061740572] [2021-12-06 18:57:30,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:57:30,890 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:57:30,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:30,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:57:30,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:30,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:57:30,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:30,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:57:30,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:30,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:57:30,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:30,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:57:30,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:30,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:57:30,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:30,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:57:30,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:30,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:57:30,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:30,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:57:30,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:30,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:57:30,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:30,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:57:31,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:31,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:57:31,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:31,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:57:31,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:31,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:57:31,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:31,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:57:31,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:31,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:57:31,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:31,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-06 18:57:31,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:31,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-12-06 18:57:31,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:31,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2021-12-06 18:57:31,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:31,035 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 565 trivial. 0 not checked. [2021-12-06 18:57:31,035 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:57:31,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061740572] [2021-12-06 18:57:31,035 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061740572] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:57:31,036 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:57:31,036 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 18:57:31,036 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178395742] [2021-12-06 18:57:31,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:57:31,036 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 18:57:31,036 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:57:31,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 18:57:31,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 18:57:31,037 INFO L87 Difference]: Start difference. First operand 280 states and 363 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2021-12-06 18:57:31,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:57:31,190 INFO L93 Difference]: Finished difference Result 475 states and 650 transitions. [2021-12-06 18:57:31,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 18:57:31,190 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 235 [2021-12-06 18:57:31,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:57:31,193 INFO L225 Difference]: With dead ends: 475 [2021-12-06 18:57:31,193 INFO L226 Difference]: Without dead ends: 322 [2021-12-06 18:57:31,193 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 18:57:31,194 INFO L933 BasicCegarLoop]: 309 mSDtfsCounter, 183 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 18:57:31,194 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [207 Valid, 633 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 18:57:31,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2021-12-06 18:57:31,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 279. [2021-12-06 18:57:31,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 230 states have (on average 1.2521739130434784) internal successors, (288), 231 states have internal predecessors, (288), 36 states have call successors, (36), 12 states have call predecessors, (36), 12 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2021-12-06 18:57:31,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 360 transitions. [2021-12-06 18:57:31,206 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 360 transitions. Word has length 235 [2021-12-06 18:57:31,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:57:31,206 INFO L470 AbstractCegarLoop]: Abstraction has 279 states and 360 transitions. [2021-12-06 18:57:31,207 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2021-12-06 18:57:31,207 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 360 transitions. [2021-12-06 18:57:31,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2021-12-06 18:57:31,208 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:57:31,209 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-12-06 18:57:31,209 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-06 18:57:31,209 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:57:31,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:57:31,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1937286894, now seen corresponding path program 1 times [2021-12-06 18:57:31,209 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:57:31,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309972143] [2021-12-06 18:57:31,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:57:31,210 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:57:31,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:31,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:57:31,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:31,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:57:31,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:31,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:57:31,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:31,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:57:31,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:31,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:57:31,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:31,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:57:31,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:31,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:57:31,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:31,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:57:31,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:31,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:57:31,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:31,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:57:31,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:31,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:57:31,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:31,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:57:31,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:31,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:57:31,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:31,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:57:31,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:31,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:57:31,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:31,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:57:31,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:31,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-06 18:57:31,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:31,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-12-06 18:57:31,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:31,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2021-12-06 18:57:31,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:31,361 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 565 trivial. 0 not checked. [2021-12-06 18:57:31,361 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:57:31,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309972143] [2021-12-06 18:57:31,361 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309972143] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:57:31,361 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:57:31,361 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 18:57:31,362 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924604682] [2021-12-06 18:57:31,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:57:31,362 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 18:57:31,362 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:57:31,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 18:57:31,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 18:57:31,363 INFO L87 Difference]: Start difference. First operand 279 states and 360 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 3 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2021-12-06 18:57:31,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:57:31,689 INFO L93 Difference]: Finished difference Result 655 states and 874 transitions. [2021-12-06 18:57:31,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-06 18:57:31,690 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 3 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 236 [2021-12-06 18:57:31,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:57:31,693 INFO L225 Difference]: With dead ends: 655 [2021-12-06 18:57:31,694 INFO L226 Difference]: Without dead ends: 503 [2021-12-06 18:57:31,694 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-12-06 18:57:31,695 INFO L933 BasicCegarLoop]: 325 mSDtfsCounter, 419 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 18:57:31,695 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [440 Valid, 843 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 18:57:31,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2021-12-06 18:57:31,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 440. [2021-12-06 18:57:31,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 361 states have (on average 1.299168975069252) internal successors, (469), 363 states have internal predecessors, (469), 54 states have call successors, (54), 24 states have call predecessors, (54), 24 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2021-12-06 18:57:31,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 577 transitions. [2021-12-06 18:57:31,723 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 577 transitions. Word has length 236 [2021-12-06 18:57:31,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:57:31,724 INFO L470 AbstractCegarLoop]: Abstraction has 440 states and 577 transitions. [2021-12-06 18:57:31,724 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 3 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2021-12-06 18:57:31,724 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 577 transitions. [2021-12-06 18:57:31,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2021-12-06 18:57:31,726 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:57:31,726 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2021-12-06 18:57:31,726 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-06 18:57:31,727 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:57:31,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:57:31,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1634448199, now seen corresponding path program 1 times [2021-12-06 18:57:31,727 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:57:31,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10184497] [2021-12-06 18:57:31,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:57:31,728 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:57:31,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:31,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:57:31,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:31,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:57:31,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:31,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:57:31,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:31,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:57:31,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:31,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:57:31,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:31,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:57:31,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:31,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:57:31,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:31,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:57:31,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:31,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:57:31,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:31,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:57:31,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:31,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:57:31,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:31,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:57:31,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:31,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:57:31,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:31,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:57:31,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:31,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:57:31,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:31,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:57:31,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:31,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-06 18:57:31,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:31,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-12-06 18:57:31,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:31,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2021-12-06 18:57:31,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:31,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2021-12-06 18:57:31,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:31,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2021-12-06 18:57:31,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:31,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2021-12-06 18:57:31,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:31,854 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2021-12-06 18:57:31,854 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:57:31,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10184497] [2021-12-06 18:57:31,854 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10184497] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:57:31,854 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:57:31,854 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 18:57:31,854 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088097699] [2021-12-06 18:57:31,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:57:31,855 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 18:57:31,855 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:57:31,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 18:57:31,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 18:57:31,856 INFO L87 Difference]: Start difference. First operand 440 states and 577 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 3 states have internal predecessors, (87), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2021-12-06 18:57:32,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:57:32,106 INFO L93 Difference]: Finished difference Result 929 states and 1271 transitions. [2021-12-06 18:57:32,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 18:57:32,106 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 3 states have internal predecessors, (87), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 265 [2021-12-06 18:57:32,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:57:32,110 INFO L225 Difference]: With dead ends: 929 [2021-12-06 18:57:32,110 INFO L226 Difference]: Without dead ends: 693 [2021-12-06 18:57:32,111 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-06 18:57:32,112 INFO L933 BasicCegarLoop]: 279 mSDtfsCounter, 214 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 18:57:32,112 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [235 Valid, 611 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 18:57:32,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2021-12-06 18:57:32,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 531. [2021-12-06 18:57:32,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 442 states have (on average 1.3076923076923077) internal successors, (578), 445 states have internal predecessors, (578), 59 states have call successors, (59), 29 states have call predecessors, (59), 29 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2021-12-06 18:57:32,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 696 transitions. [2021-12-06 18:57:32,135 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 696 transitions. Word has length 265 [2021-12-06 18:57:32,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:57:32,136 INFO L470 AbstractCegarLoop]: Abstraction has 531 states and 696 transitions. [2021-12-06 18:57:32,136 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 3 states have internal predecessors, (87), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2021-12-06 18:57:32,136 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 696 transitions. [2021-12-06 18:57:32,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2021-12-06 18:57:32,137 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:57:32,138 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:57:32,138 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-06 18:57:32,138 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:57:32,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:57:32,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1733084103, now seen corresponding path program 1 times [2021-12-06 18:57:32,138 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:57:32,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457086198] [2021-12-06 18:57:32,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:57:32,138 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:57:32,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:32,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:57:32,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:32,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:57:32,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:32,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:57:32,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:32,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:57:32,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:32,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:57:32,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:32,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:57:32,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:32,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:57:32,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:32,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:57:32,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:32,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:57:32,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:32,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:57:32,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:32,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:57:32,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:32,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:57:32,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:32,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:57:32,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:32,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:57:32,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:32,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:57:32,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:32,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:57:32,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:32,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-06 18:57:32,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:32,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-12-06 18:57:32,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:32,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2021-12-06 18:57:32,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:32,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2021-12-06 18:57:32,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:32,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2021-12-06 18:57:32,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:32,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2021-12-06 18:57:32,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:32,250 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2021-12-06 18:57:32,250 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:57:32,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457086198] [2021-12-06 18:57:32,250 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457086198] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:57:32,250 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:57:32,250 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 18:57:32,250 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592197507] [2021-12-06 18:57:32,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:57:32,251 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 18:57:32,251 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:57:32,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 18:57:32,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 18:57:32,251 INFO L87 Difference]: Start difference. First operand 531 states and 696 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 3 states have internal predecessors, (88), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2021-12-06 18:57:32,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:57:32,505 INFO L93 Difference]: Finished difference Result 1121 states and 1524 transitions. [2021-12-06 18:57:32,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 18:57:32,506 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 3 states have internal predecessors, (88), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 266 [2021-12-06 18:57:32,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:57:32,510 INFO L225 Difference]: With dead ends: 1121 [2021-12-06 18:57:32,510 INFO L226 Difference]: Without dead ends: 829 [2021-12-06 18:57:32,511 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-06 18:57:32,511 INFO L933 BasicCegarLoop]: 296 mSDtfsCounter, 217 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 18:57:32,511 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [238 Valid, 645 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 18:57:32,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2021-12-06 18:57:32,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 651. [2021-12-06 18:57:32,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 550 states have (on average 1.3163636363636364) internal successors, (724), 555 states have internal predecessors, (724), 65 states have call successors, (65), 35 states have call predecessors, (65), 35 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2021-12-06 18:57:32,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 854 transitions. [2021-12-06 18:57:32,545 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 854 transitions. Word has length 266 [2021-12-06 18:57:32,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:57:32,546 INFO L470 AbstractCegarLoop]: Abstraction has 651 states and 854 transitions. [2021-12-06 18:57:32,546 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 3 states have internal predecessors, (88), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2021-12-06 18:57:32,546 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 854 transitions. [2021-12-06 18:57:32,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2021-12-06 18:57:32,547 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:57:32,547 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:57:32,548 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-06 18:57:32,548 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:57:32,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:57:32,548 INFO L85 PathProgramCache]: Analyzing trace with hash 2100471702, now seen corresponding path program 1 times [2021-12-06 18:57:32,548 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:57:32,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230057475] [2021-12-06 18:57:32,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:57:32,549 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:57:32,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:32,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:57:32,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:32,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:57:32,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:32,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:57:32,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:32,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:57:32,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:32,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:57:32,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:32,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:57:32,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:32,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:57:32,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:32,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:57:32,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:32,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:57:32,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:32,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:57:32,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:32,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:57:32,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:32,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:57:32,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:32,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:57:32,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:32,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:57:32,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:32,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:57:32,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:32,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:57:32,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:32,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-06 18:57:32,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:32,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-12-06 18:57:32,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:32,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-12-06 18:57:32,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:32,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2021-12-06 18:57:32,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:32,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2021-12-06 18:57:32,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:32,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2021-12-06 18:57:32,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:32,666 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 30 proven. 6 refuted. 0 times theorem prover too weak. 603 trivial. 0 not checked. [2021-12-06 18:57:32,666 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:57:32,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230057475] [2021-12-06 18:57:32,666 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230057475] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 18:57:32,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110835370] [2021-12-06 18:57:32,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:57:32,666 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:57:32,667 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 18:57:32,667 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 18:57:32,668 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-06 18:57:32,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:32,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 915 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 18:57:32,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 18:57:32,994 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked. [2021-12-06 18:57:32,994 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 18:57:32,994 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [110835370] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:57:32,994 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 18:57:32,995 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2021-12-06 18:57:32,995 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176572344] [2021-12-06 18:57:32,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:57:32,995 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 18:57:32,995 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:57:32,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 18:57:32,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-12-06 18:57:32,996 INFO L87 Difference]: Start difference. First operand 651 states and 854 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-12-06 18:57:33,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:57:33,060 INFO L93 Difference]: Finished difference Result 1037 states and 1394 transitions. [2021-12-06 18:57:33,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 18:57:33,060 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 267 [2021-12-06 18:57:33,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:57:33,063 INFO L225 Difference]: With dead ends: 1037 [2021-12-06 18:57:33,063 INFO L226 Difference]: Without dead ends: 651 [2021-12-06 18:57:33,064 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-12-06 18:57:33,064 INFO L933 BasicCegarLoop]: 235 mSDtfsCounter, 51 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 18:57:33,065 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 681 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 18:57:33,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2021-12-06 18:57:33,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 651. [2021-12-06 18:57:33,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 550 states have (on average 1.3054545454545454) internal successors, (718), 555 states have internal predecessors, (718), 65 states have call successors, (65), 35 states have call predecessors, (65), 35 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2021-12-06 18:57:33,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 848 transitions. [2021-12-06 18:57:33,087 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 848 transitions. Word has length 267 [2021-12-06 18:57:33,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:57:33,087 INFO L470 AbstractCegarLoop]: Abstraction has 651 states and 848 transitions. [2021-12-06 18:57:33,088 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-12-06 18:57:33,088 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 848 transitions. [2021-12-06 18:57:33,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2021-12-06 18:57:33,089 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:57:33,089 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:57:33,123 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-12-06 18:57:33,289 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-12-06 18:57:33,290 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:57:33,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:57:33,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1830281755, now seen corresponding path program 1 times [2021-12-06 18:57:33,290 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:57:33,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536590496] [2021-12-06 18:57:33,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:57:33,291 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:57:33,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:33,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:57:33,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:33,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:57:33,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:33,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:57:33,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:33,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:57:33,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:33,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:57:33,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:33,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:57:33,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:33,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:57:33,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:33,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:57:33,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:33,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:57:33,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:33,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:57:33,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:33,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:57:33,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:33,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:57:33,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:33,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:57:33,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:33,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:57:33,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:33,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:57:33,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:33,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:57:33,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:33,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-06 18:57:33,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:33,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-12-06 18:57:33,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:33,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-12-06 18:57:33,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:33,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2021-12-06 18:57:33,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:33,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2021-12-06 18:57:33,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:33,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2021-12-06 18:57:33,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:33,406 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 617 trivial. 0 not checked. [2021-12-06 18:57:33,407 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:57:33,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536590496] [2021-12-06 18:57:33,407 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536590496] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 18:57:33,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1966300728] [2021-12-06 18:57:33,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:57:33,407 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:57:33,407 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 18:57:33,408 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 18:57:33,409 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-06 18:57:33,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:33,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 916 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 18:57:33,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 18:57:33,688 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 607 trivial. 0 not checked. [2021-12-06 18:57:33,688 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 18:57:33,688 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1966300728] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:57:33,689 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 18:57:33,689 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2021-12-06 18:57:33,689 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235784593] [2021-12-06 18:57:33,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:57:33,689 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 18:57:33,689 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:57:33,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 18:57:33,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-12-06 18:57:33,691 INFO L87 Difference]: Start difference. First operand 651 states and 848 transitions. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-12-06 18:57:33,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:57:33,756 INFO L93 Difference]: Finished difference Result 1037 states and 1380 transitions. [2021-12-06 18:57:33,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 18:57:33,757 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 268 [2021-12-06 18:57:33,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:57:33,760 INFO L225 Difference]: With dead ends: 1037 [2021-12-06 18:57:33,760 INFO L226 Difference]: Without dead ends: 663 [2021-12-06 18:57:33,761 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 311 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-12-06 18:57:33,762 INFO L933 BasicCegarLoop]: 242 mSDtfsCounter, 15 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 18:57:33,762 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 704 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 18:57:33,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2021-12-06 18:57:33,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 663. [2021-12-06 18:57:33,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 560 states have (on average 1.3071428571428572) internal successors, (732), 565 states have internal predecessors, (732), 65 states have call successors, (65), 37 states have call predecessors, (65), 37 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2021-12-06 18:57:33,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 862 transitions. [2021-12-06 18:57:33,791 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 862 transitions. Word has length 268 [2021-12-06 18:57:33,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:57:33,791 INFO L470 AbstractCegarLoop]: Abstraction has 663 states and 862 transitions. [2021-12-06 18:57:33,791 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-12-06 18:57:33,792 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 862 transitions. [2021-12-06 18:57:33,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2021-12-06 18:57:33,793 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:57:33,794 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:57:33,828 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-12-06 18:57:33,994 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-12-06 18:57:33,994 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:57:33,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:57:33,995 INFO L85 PathProgramCache]: Analyzing trace with hash 632640880, now seen corresponding path program 1 times [2021-12-06 18:57:33,995 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:57:33,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201490137] [2021-12-06 18:57:33,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:57:33,995 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:57:34,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:34,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:57:34,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:34,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:57:34,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:34,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:57:34,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:34,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:57:34,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:34,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:57:34,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:34,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:57:34,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:34,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:57:34,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:34,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:57:34,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:34,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:57:34,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:34,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:57:34,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:34,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:57:34,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:34,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:57:34,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:34,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:57:34,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:34,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:57:34,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:34,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:57:34,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:34,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:57:34,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:34,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-06 18:57:34,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:34,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-12-06 18:57:34,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:34,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-12-06 18:57:34,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:34,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2021-12-06 18:57:34,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:34,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2021-12-06 18:57:34,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:34,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2021-12-06 18:57:34,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:34,162 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2021-12-06 18:57:34,163 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:57:34,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201490137] [2021-12-06 18:57:34,163 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201490137] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 18:57:34,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893669391] [2021-12-06 18:57:34,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:57:34,163 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:57:34,163 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 18:57:34,164 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 18:57:34,165 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-06 18:57:34,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:34,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 917 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-06 18:57:34,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 18:57:34,492 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2021-12-06 18:57:34,492 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 18:57:34,492 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893669391] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:57:34,492 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 18:57:34,492 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 14 [2021-12-06 18:57:34,492 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250909457] [2021-12-06 18:57:34,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:57:34,493 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 18:57:34,493 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:57:34,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 18:57:34,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2021-12-06 18:57:34,493 INFO L87 Difference]: Start difference. First operand 663 states and 862 transitions. Second operand has 7 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 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:57:34,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:57:34,658 INFO L93 Difference]: Finished difference Result 1425 states and 2051 transitions. [2021-12-06 18:57:34,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 18:57:34,659 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 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 269 [2021-12-06 18:57:34,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:57:34,668 INFO L225 Difference]: With dead ends: 1425 [2021-12-06 18:57:34,668 INFO L226 Difference]: Without dead ends: 1423 [2021-12-06 18:57:34,669 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 312 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2021-12-06 18:57:34,670 INFO L933 BasicCegarLoop]: 535 mSDtfsCounter, 511 mSDsluCounter, 2349 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 2884 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 18:57:34,670 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [546 Valid, 2884 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 18:57:34,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423 states. [2021-12-06 18:57:34,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423 to 669. [2021-12-06 18:57:34,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 669 states, 564 states have (on average 1.3049645390070923) internal successors, (736), 570 states have internal predecessors, (736), 66 states have call successors, (66), 38 states have call predecessors, (66), 38 states have return successors, (66), 64 states have call predecessors, (66), 66 states have call successors, (66) [2021-12-06 18:57:34,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 868 transitions. [2021-12-06 18:57:34,722 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 868 transitions. Word has length 269 [2021-12-06 18:57:34,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:57:34,722 INFO L470 AbstractCegarLoop]: Abstraction has 669 states and 868 transitions. [2021-12-06 18:57:34,723 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 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:57:34,723 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 868 transitions. [2021-12-06 18:57:34,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2021-12-06 18:57:34,725 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:57:34,725 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:34,747 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-12-06 18:57:34,925 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:57:34,926 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:57:34,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:57:34,926 INFO L85 PathProgramCache]: Analyzing trace with hash -2002921446, now seen corresponding path program 1 times [2021-12-06 18:57:34,926 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:57:34,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528863949] [2021-12-06 18:57:34,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:57:34,927 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:57:34,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:34,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:57:35,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:35,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:57:35,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:35,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:57:35,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:35,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:57:35,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:35,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:57:35,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:35,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:57:35,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:35,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:57:35,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:35,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:57:35,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:35,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:57:35,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:35,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:57:35,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:35,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:57:35,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:35,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:57:35,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:35,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:57:35,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:35,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:57:35,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:35,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:57:35,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:35,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:57:35,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:35,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-06 18:57:35,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:35,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-12-06 18:57:35,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:35,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-12-06 18:57:35,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:35,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2021-12-06 18:57:35,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:35,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2021-12-06 18:57:35,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:35,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2021-12-06 18:57:35,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:35,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2021-12-06 18:57:35,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:35,114 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 142 proven. 27 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2021-12-06 18:57:35,114 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:57:35,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528863949] [2021-12-06 18:57:35,114 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528863949] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 18:57:35,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365731634] [2021-12-06 18:57:35,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:57:35,115 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:57:35,115 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 18:57:35,118 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 18:57:35,118 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-06 18:57:35,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:35,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 941 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-06 18:57:35,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 18:57:35,495 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 251 proven. 33 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2021-12-06 18:57:35,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 18:57:35,795 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 146 proven. 23 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2021-12-06 18:57:35,795 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [365731634] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 18:57:35,795 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 18:57:35,795 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 19 [2021-12-06 18:57:35,795 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444181922] [2021-12-06 18:57:35,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 18:57:35,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-06 18:57:35,796 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:57:35,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-06 18:57:35,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2021-12-06 18:57:35,797 INFO L87 Difference]: Start difference. First operand 669 states and 868 transitions. Second operand has 19 states, 19 states have (on average 7.947368421052632) internal successors, (151), 14 states have internal predecessors, (151), 5 states have call successors, (28), 5 states have call predecessors, (28), 9 states have return successors, (27), 8 states have call predecessors, (27), 5 states have call successors, (27) [2021-12-06 18:57:36,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:57:36,718 INFO L93 Difference]: Finished difference Result 1897 states and 2639 transitions. [2021-12-06 18:57:36,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-06 18:57:36,719 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 7.947368421052632) internal successors, (151), 14 states have internal predecessors, (151), 5 states have call successors, (28), 5 states have call predecessors, (28), 9 states have return successors, (27), 8 states have call predecessors, (27), 5 states have call successors, (27) Word has length 277 [2021-12-06 18:57:36,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:57:36,726 INFO L225 Difference]: With dead ends: 1897 [2021-12-06 18:57:36,726 INFO L226 Difference]: Without dead ends: 1505 [2021-12-06 18:57:36,727 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 635 GetRequests, 600 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=211, Invalid=1121, Unknown=0, NotChecked=0, Total=1332 [2021-12-06 18:57:36,728 INFO L933 BasicCegarLoop]: 382 mSDtfsCounter, 795 mSDsluCounter, 2952 mSDsCounter, 0 mSdLazyCounter, 1496 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 843 SdHoareTripleChecker+Valid, 3334 SdHoareTripleChecker+Invalid, 1696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 1496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-06 18:57:36,728 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [843 Valid, 3334 Invalid, 1696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 1496 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-06 18:57:36,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2021-12-06 18:57:36,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 940. [2021-12-06 18:57:36,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 940 states, 795 states have (on average 1.3018867924528301) internal successors, (1035), 802 states have internal predecessors, (1035), 90 states have call successors, (90), 51 states have call predecessors, (90), 54 states have return successors, (95), 90 states have call predecessors, (95), 90 states have call successors, (95) [2021-12-06 18:57:36,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1220 transitions. [2021-12-06 18:57:36,769 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1220 transitions. Word has length 277 [2021-12-06 18:57:36,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:57:36,770 INFO L470 AbstractCegarLoop]: Abstraction has 940 states and 1220 transitions. [2021-12-06 18:57:36,770 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.947368421052632) internal successors, (151), 14 states have internal predecessors, (151), 5 states have call successors, (28), 5 states have call predecessors, (28), 9 states have return successors, (27), 8 states have call predecessors, (27), 5 states have call successors, (27) [2021-12-06 18:57:36,770 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1220 transitions. [2021-12-06 18:57:36,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2021-12-06 18:57:36,772 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:57:36,772 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:36,806 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-12-06 18:57:36,972 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-12-06 18:57:36,973 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:57:36,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:57:36,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1041307429, now seen corresponding path program 1 times [2021-12-06 18:57:36,973 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:57:36,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771098261] [2021-12-06 18:57:36,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:57:36,974 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:57:36,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:37,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:57:37,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:37,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:57:37,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:37,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:57:37,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:37,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:57:37,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:37,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:57:37,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:37,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:57:37,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:37,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:57:37,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:37,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:57:37,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:37,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:57:37,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:37,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:57:37,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:37,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:57:37,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:37,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:57:37,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:37,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:57:37,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:37,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:57:37,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:37,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:57:37,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:37,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:57:37,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:37,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-06 18:57:37,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:37,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-12-06 18:57:37,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:37,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-12-06 18:57:37,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:37,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2021-12-06 18:57:37,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:37,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2021-12-06 18:57:37,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:37,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2021-12-06 18:57:37,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:37,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2021-12-06 18:57:37,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:37,080 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 668 trivial. 0 not checked. [2021-12-06 18:57:37,080 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:57:37,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771098261] [2021-12-06 18:57:37,081 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771098261] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 18:57:37,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236475060] [2021-12-06 18:57:37,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:57:37,081 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:57:37,081 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 18:57:37,082 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 18:57:37,082 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-06 18:57:37,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:37,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 940 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-06 18:57:37,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 18:57:37,382 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 607 trivial. 0 not checked. [2021-12-06 18:57:37,382 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 18:57:37,382 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236475060] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:57:37,382 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 18:57:37,382 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2021-12-06 18:57:37,383 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770804470] [2021-12-06 18:57:37,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:57:37,383 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 18:57:37,383 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:57:37,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 18:57:37,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 18:57:37,383 INFO L87 Difference]: Start difference. First operand 940 states and 1220 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-12-06 18:57:37,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:57:37,432 INFO L93 Difference]: Finished difference Result 1743 states and 2304 transitions. [2021-12-06 18:57:37,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 18:57:37,432 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 277 [2021-12-06 18:57:37,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:57:37,438 INFO L225 Difference]: With dead ends: 1743 [2021-12-06 18:57:37,438 INFO L226 Difference]: Without dead ends: 924 [2021-12-06 18:57:37,440 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-06 18:57:37,440 INFO L933 BasicCegarLoop]: 242 mSDtfsCounter, 11 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 18:57:37,440 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 704 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 18:57:37,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2021-12-06 18:57:37,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 924. [2021-12-06 18:57:37,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 924 states, 784 states have (on average 1.2895408163265305) internal successors, (1011), 791 states have internal predecessors, (1011), 86 states have call successors, (86), 51 states have call predecessors, (86), 53 states have return successors, (90), 85 states have call predecessors, (90), 86 states have call successors, (90) [2021-12-06 18:57:37,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 924 states and 1187 transitions. [2021-12-06 18:57:37,485 INFO L78 Accepts]: Start accepts. Automaton has 924 states and 1187 transitions. Word has length 277 [2021-12-06 18:57:37,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:57:37,486 INFO L470 AbstractCegarLoop]: Abstraction has 924 states and 1187 transitions. [2021-12-06 18:57:37,486 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-12-06 18:57:37,486 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1187 transitions. [2021-12-06 18:57:37,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2021-12-06 18:57:37,488 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:57:37,488 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:37,521 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2021-12-06 18:57:37,688 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-12-06 18:57:37,689 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:57:37,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:57:37,689 INFO L85 PathProgramCache]: Analyzing trace with hash -186615214, now seen corresponding path program 1 times [2021-12-06 18:57:37,689 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:57:37,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489304650] [2021-12-06 18:57:37,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:57:37,689 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:57:37,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:37,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:57:37,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:37,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:57:37,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:37,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:57:37,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:37,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:57:37,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:37,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:57:37,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:37,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:57:37,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:37,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:57:37,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:37,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:57:37,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:37,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:57:37,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:37,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:57:37,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:37,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:57:37,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:37,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:57:37,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:37,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:57:37,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:37,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:57:37,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:37,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 18:57:37,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:37,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-06 18:57:37,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:37,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2021-12-06 18:57:37,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:37,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2021-12-06 18:57:37,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:37,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2021-12-06 18:57:37,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:37,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2021-12-06 18:57:37,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:37,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2021-12-06 18:57:37,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:37,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2021-12-06 18:57:37,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:37,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2021-12-06 18:57:37,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:37,785 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 121 proven. 19 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2021-12-06 18:57:37,786 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:57:37,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489304650] [2021-12-06 18:57:37,786 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489304650] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 18:57:37,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053407381] [2021-12-06 18:57:37,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:57:37,786 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:57:37,786 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 18:57:37,787 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 18:57:37,788 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-06 18:57:37,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:37,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 941 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-06 18:57:37,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 18:57:38,069 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 468 trivial. 0 not checked. [2021-12-06 18:57:38,069 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 18:57:38,069 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1053407381] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:57:38,069 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 18:57:38,070 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2021-12-06 18:57:38,070 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549672809] [2021-12-06 18:57:38,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:57:38,070 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 18:57:38,070 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:57:38,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 18:57:38,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 18:57:38,071 INFO L87 Difference]: Start difference. First operand 924 states and 1187 transitions. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-12-06 18:57:38,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:57:38,118 INFO L93 Difference]: Finished difference Result 1576 states and 2065 transitions. [2021-12-06 18:57:38,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 18:57:38,119 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 280 [2021-12-06 18:57:38,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:57:38,122 INFO L225 Difference]: With dead ends: 1576 [2021-12-06 18:57:38,122 INFO L226 Difference]: Without dead ends: 764 [2021-12-06 18:57:38,124 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-06 18:57:38,124 INFO L933 BasicCegarLoop]: 245 mSDtfsCounter, 8 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 18:57:38,124 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 707 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 18:57:38,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2021-12-06 18:57:38,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 764. [2021-12-06 18:57:38,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 764 states, 642 states have (on average 1.2850467289719627) internal successors, (825), 649 states have internal predecessors, (825), 77 states have call successors, (77), 44 states have call predecessors, (77), 44 states have return successors, (77), 74 states have call predecessors, (77), 77 states have call successors, (77) [2021-12-06 18:57:38,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 979 transitions. [2021-12-06 18:57:38,151 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 979 transitions. Word has length 280 [2021-12-06 18:57:38,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:57:38,152 INFO L470 AbstractCegarLoop]: Abstraction has 764 states and 979 transitions. [2021-12-06 18:57:38,152 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-12-06 18:57:38,152 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 979 transitions. [2021-12-06 18:57:38,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2021-12-06 18:57:38,154 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:57:38,154 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 10, 10, 9, 8, 8, 8, 7, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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:57:38,174 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2021-12-06 18:57:38,354 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:57:38,355 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:57:38,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:57:38,355 INFO L85 PathProgramCache]: Analyzing trace with hash -2136317147, now seen corresponding path program 1 times [2021-12-06 18:57:38,356 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:57:38,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261020390] [2021-12-06 18:57:38,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:57:38,356 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:57:38,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:38,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:57:38,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:38,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:57:38,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:38,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:57:38,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:38,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:57:38,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:38,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:57:38,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:38,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:57:38,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:38,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:57:38,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:38,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:57:38,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:38,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:57:38,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:38,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:57:38,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:38,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:57:38,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:38,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:57:38,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:38,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:57:38,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:38,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:57:38,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:38,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:57:38,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:38,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:57:38,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:38,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-06 18:57:38,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:38,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-12-06 18:57:38,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:38,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-12-06 18:57:38,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:38,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2021-12-06 18:57:38,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:38,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2021-12-06 18:57:38,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:38,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2021-12-06 18:57:38,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:38,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2021-12-06 18:57:38,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:38,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2021-12-06 18:57:38,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:38,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 279 [2021-12-06 18:57:38,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:38,602 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2021-12-06 18:57:38,602 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:57:38,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261020390] [2021-12-06 18:57:38,602 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261020390] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 18:57:38,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833002956] [2021-12-06 18:57:38,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:57:38,603 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:57:38,603 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 18:57:38,603 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 18:57:38,604 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-06 18:57:38,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:38,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 988 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-06 18:57:38,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 18:57:38,978 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2021-12-06 18:57:38,978 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 18:57:38,978 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [833002956] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:57:38,978 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 18:57:38,979 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2021-12-06 18:57:38,979 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896339439] [2021-12-06 18:57:38,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:57:38,979 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-06 18:57:38,979 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:57:38,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-06 18:57:38,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2021-12-06 18:57:38,980 INFO L87 Difference]: Start difference. First operand 764 states and 979 transitions. Second operand has 10 states, 10 states have (on average 11.1) internal successors, (111), 9 states have internal predecessors, (111), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2021-12-06 18:57:39,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:57:39,431 INFO L93 Difference]: Finished difference Result 2417 states and 3200 transitions. [2021-12-06 18:57:39,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-06 18:57:39,431 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.1) internal successors, (111), 9 states have internal predecessors, (111), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) Word has length 292 [2021-12-06 18:57:39,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:57:39,439 INFO L225 Difference]: With dead ends: 2417 [2021-12-06 18:57:39,439 INFO L226 Difference]: Without dead ends: 2018 [2021-12-06 18:57:39,440 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=166, Invalid=1094, Unknown=0, NotChecked=0, Total=1260 [2021-12-06 18:57:39,441 INFO L933 BasicCegarLoop]: 453 mSDtfsCounter, 1158 mSDsluCounter, 3029 mSDsCounter, 0 mSdLazyCounter, 827 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1162 SdHoareTripleChecker+Valid, 3482 SdHoareTripleChecker+Invalid, 1024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 18:57:39,441 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1162 Valid, 3482 Invalid, 1024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 827 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 18:57:39,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2018 states. [2021-12-06 18:57:39,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2018 to 1261. [2021-12-06 18:57:39,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1261 states, 1041 states have (on average 1.2795389048991355) internal successors, (1332), 1053 states have internal predecessors, (1332), 145 states have call successors, (145), 74 states have call predecessors, (145), 74 states have return successors, (145), 137 states have call predecessors, (145), 145 states have call successors, (145) [2021-12-06 18:57:39,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1261 states to 1261 states and 1622 transitions. [2021-12-06 18:57:39,491 INFO L78 Accepts]: Start accepts. Automaton has 1261 states and 1622 transitions. Word has length 292 [2021-12-06 18:57:39,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:57:39,491 INFO L470 AbstractCegarLoop]: Abstraction has 1261 states and 1622 transitions. [2021-12-06 18:57:39,492 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.1) internal successors, (111), 9 states have internal predecessors, (111), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2021-12-06 18:57:39,492 INFO L276 IsEmpty]: Start isEmpty. Operand 1261 states and 1622 transitions. [2021-12-06 18:57:39,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2021-12-06 18:57:39,493 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:57:39,493 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 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:57:39,514 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2021-12-06 18:57:39,694 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:57:39,694 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:57:39,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:57:39,695 INFO L85 PathProgramCache]: Analyzing trace with hash -785059678, now seen corresponding path program 1 times [2021-12-06 18:57:39,695 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:57:39,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432274371] [2021-12-06 18:57:39,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:57:39,695 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:57:39,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:39,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:57:39,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:39,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:57:39,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:39,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:57:39,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:39,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:57:39,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:39,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:57:39,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:39,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:57:39,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:39,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:57:39,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:39,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:57:39,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:39,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:57:39,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:39,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:57:39,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:39,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:57:39,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:39,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:57:39,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:39,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:57:39,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:39,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:57:39,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:39,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:57:39,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:39,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:57:39,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:39,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-06 18:57:39,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:39,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-12-06 18:57:39,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:39,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-12-06 18:57:39,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:39,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2021-12-06 18:57:39,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:39,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2021-12-06 18:57:39,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:39,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2021-12-06 18:57:39,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:39,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2021-12-06 18:57:39,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:39,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2021-12-06 18:57:39,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:39,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2021-12-06 18:57:39,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:39,814 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 770 trivial. 0 not checked. [2021-12-06 18:57:39,814 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:57:39,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432274371] [2021-12-06 18:57:39,815 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432274371] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:57:39,815 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:57:39,815 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 18:57:39,815 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636024278] [2021-12-06 18:57:39,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:57:39,816 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 18:57:39,816 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:57:39,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 18:57:39,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-06 18:57:39,817 INFO L87 Difference]: Start difference. First operand 1261 states and 1622 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 6 states have internal predecessors, (102), 5 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2021-12-06 18:57:40,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:57:40,192 INFO L93 Difference]: Finished difference Result 3542 states and 4844 transitions. [2021-12-06 18:57:40,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 18:57:40,192 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 6 states have internal predecessors, (102), 5 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) Word has length 298 [2021-12-06 18:57:40,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:57:40,207 INFO L225 Difference]: With dead ends: 3542 [2021-12-06 18:57:40,207 INFO L226 Difference]: Without dead ends: 2631 [2021-12-06 18:57:40,210 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-06 18:57:40,210 INFO L933 BasicCegarLoop]: 574 mSDtfsCounter, 493 mSDsluCounter, 1623 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 2197 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 18:57:40,211 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [547 Valid, 2197 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 18:57:40,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2631 states. [2021-12-06 18:57:40,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2631 to 1354. [2021-12-06 18:57:40,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1354 states, 1113 states have (on average 1.2911051212938005) internal successors, (1437), 1125 states have internal predecessors, (1437), 166 states have call successors, (166), 74 states have call predecessors, (166), 74 states have return successors, (166), 158 states have call predecessors, (166), 166 states have call successors, (166) [2021-12-06 18:57:40,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1354 states to 1354 states and 1769 transitions. [2021-12-06 18:57:40,297 INFO L78 Accepts]: Start accepts. Automaton has 1354 states and 1769 transitions. Word has length 298 [2021-12-06 18:57:40,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:57:40,297 INFO L470 AbstractCegarLoop]: Abstraction has 1354 states and 1769 transitions. [2021-12-06 18:57:40,297 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 6 states have internal predecessors, (102), 5 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2021-12-06 18:57:40,298 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 1769 transitions. [2021-12-06 18:57:40,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2021-12-06 18:57:40,299 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:57:40,299 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 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:57:40,300 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-12-06 18:57:40,300 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:57:40,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:57:40,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1679492638, now seen corresponding path program 1 times [2021-12-06 18:57:40,300 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:57:40,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46471470] [2021-12-06 18:57:40,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:57:40,300 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:57:40,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:40,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:57:40,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:40,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:57:40,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:40,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:57:40,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:40,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:57:40,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:40,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:57:40,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:40,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:57:40,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:40,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:57:40,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:40,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:57:40,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:40,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:57:40,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:40,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:57:40,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:40,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:57:40,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:40,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:57:40,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:40,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:57:40,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:40,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:57:40,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:40,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:57:40,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:40,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:57:40,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:40,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-06 18:57:40,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:40,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-12-06 18:57:40,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:40,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-12-06 18:57:40,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:40,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2021-12-06 18:57:40,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:40,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2021-12-06 18:57:40,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:40,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2021-12-06 18:57:40,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:40,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2021-12-06 18:57:40,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:40,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2021-12-06 18:57:40,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:40,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2021-12-06 18:57:40,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:40,466 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2021-12-06 18:57:40,467 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:57:40,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46471470] [2021-12-06 18:57:40,467 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46471470] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 18:57:40,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779919734] [2021-12-06 18:57:40,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:57:40,467 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:57:40,467 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 18:57:40,468 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 18:57:40,468 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-06 18:57:40,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:40,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 999 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-06 18:57:40,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 18:57:40,910 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2021-12-06 18:57:40,910 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 18:57:40,911 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [779919734] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:57:40,911 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 18:57:40,911 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 12 [2021-12-06 18:57:40,911 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434727721] [2021-12-06 18:57:40,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:57:40,911 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-06 18:57:40,911 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:57:40,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-06 18:57:40,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-12-06 18:57:40,912 INFO L87 Difference]: Start difference. First operand 1354 states and 1769 transitions. Second operand has 10 states, 10 states have (on average 11.9) internal successors, (119), 9 states have internal predecessors, (119), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2021-12-06 18:57:41,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:57:41,674 INFO L93 Difference]: Finished difference Result 3938 states and 5327 transitions. [2021-12-06 18:57:41,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-06 18:57:41,674 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.9) internal successors, (119), 9 states have internal predecessors, (119), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) Word has length 298 [2021-12-06 18:57:41,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:57:41,686 INFO L225 Difference]: With dead ends: 3938 [2021-12-06 18:57:41,686 INFO L226 Difference]: Without dead ends: 2935 [2021-12-06 18:57:41,687 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 346 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=660, Unknown=0, NotChecked=0, Total=812 [2021-12-06 18:57:41,688 INFO L933 BasicCegarLoop]: 541 mSDtfsCounter, 1309 mSDsluCounter, 3120 mSDsCounter, 0 mSdLazyCounter, 1132 mSolverCounterSat, 278 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1323 SdHoareTripleChecker+Valid, 3661 SdHoareTripleChecker+Invalid, 1410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 278 IncrementalHoareTripleChecker+Valid, 1132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-06 18:57:41,688 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1323 Valid, 3661 Invalid, 1410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [278 Valid, 1132 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-06 18:57:41,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2935 states. [2021-12-06 18:57:41,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2935 to 1549. [2021-12-06 18:57:41,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1549 states, 1271 states have (on average 1.2840283241542092) internal successors, (1632), 1285 states have internal predecessors, (1632), 193 states have call successors, (193), 84 states have call predecessors, (193), 84 states have return successors, (193), 183 states have call predecessors, (193), 193 states have call successors, (193) [2021-12-06 18:57:41,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1549 states to 1549 states and 2018 transitions. [2021-12-06 18:57:41,771 INFO L78 Accepts]: Start accepts. Automaton has 1549 states and 2018 transitions. Word has length 298 [2021-12-06 18:57:41,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:57:41,771 INFO L470 AbstractCegarLoop]: Abstraction has 1549 states and 2018 transitions. [2021-12-06 18:57:41,771 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.9) internal successors, (119), 9 states have internal predecessors, (119), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2021-12-06 18:57:41,771 INFO L276 IsEmpty]: Start isEmpty. Operand 1549 states and 2018 transitions. [2021-12-06 18:57:41,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2021-12-06 18:57:41,773 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:57:41,773 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 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:57:41,794 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2021-12-06 18:57:41,974 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2021-12-06 18:57:41,974 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:57:41,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:57:41,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1728419810, now seen corresponding path program 1 times [2021-12-06 18:57:41,976 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:57:41,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075986495] [2021-12-06 18:57:41,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:57:41,977 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:57:42,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:42,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:57:42,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:42,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:57:42,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:42,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:57:42,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:42,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:57:42,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:42,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:57:42,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:42,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:57:42,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:42,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:57:42,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:42,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:57:42,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:42,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:57:42,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:42,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:57:42,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:42,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:57:42,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:42,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:57:42,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:42,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:57:42,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:42,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:57:42,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:42,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:57:42,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:42,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:57:42,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:42,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-06 18:57:42,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:42,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-12-06 18:57:42,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:42,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-12-06 18:57:42,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:42,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2021-12-06 18:57:42,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:42,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2021-12-06 18:57:42,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:42,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2021-12-06 18:57:42,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:42,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2021-12-06 18:57:42,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:42,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2021-12-06 18:57:42,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:42,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2021-12-06 18:57:42,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:42,168 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2021-12-06 18:57:42,168 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:57:42,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075986495] [2021-12-06 18:57:42,168 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075986495] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 18:57:42,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716061799] [2021-12-06 18:57:42,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:57:42,169 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:57:42,169 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 18:57:42,170 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 18:57:42,170 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-06 18:57:42,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:42,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 999 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-06 18:57:42,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 18:57:42,619 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 583 trivial. 0 not checked. [2021-12-06 18:57:42,619 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 18:57:42,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716061799] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:57:42,619 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 18:57:42,619 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 12 [2021-12-06 18:57:42,619 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446608196] [2021-12-06 18:57:42,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:57:42,620 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-06 18:57:42,620 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:57:42,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-06 18:57:42,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-12-06 18:57:42,620 INFO L87 Difference]: Start difference. First operand 1549 states and 2018 transitions. Second operand has 10 states, 10 states have (on average 11.7) internal successors, (117), 9 states have internal predecessors, (117), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2021-12-06 18:57:43,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:57:43,353 INFO L93 Difference]: Finished difference Result 3757 states and 5047 transitions. [2021-12-06 18:57:43,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-06 18:57:43,353 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.7) internal successors, (117), 9 states have internal predecessors, (117), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) Word has length 298 [2021-12-06 18:57:43,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:57:43,365 INFO L225 Difference]: With dead ends: 3757 [2021-12-06 18:57:43,365 INFO L226 Difference]: Without dead ends: 2619 [2021-12-06 18:57:43,367 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 346 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=660, Unknown=0, NotChecked=0, Total=812 [2021-12-06 18:57:43,367 INFO L933 BasicCegarLoop]: 517 mSDtfsCounter, 1277 mSDsluCounter, 3258 mSDsCounter, 0 mSdLazyCounter, 1157 mSolverCounterSat, 273 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1292 SdHoareTripleChecker+Valid, 3775 SdHoareTripleChecker+Invalid, 1430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 273 IncrementalHoareTripleChecker+Valid, 1157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-06 18:57:43,368 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1292 Valid, 3775 Invalid, 1430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [273 Valid, 1157 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-06 18:57:43,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2619 states. [2021-12-06 18:57:43,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2619 to 1515. [2021-12-06 18:57:43,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1515 states, 1247 states have (on average 1.2766639935846031) internal successors, (1592), 1261 states have internal predecessors, (1592), 183 states have call successors, (183), 84 states have call predecessors, (183), 84 states have return successors, (183), 173 states have call predecessors, (183), 183 states have call successors, (183) [2021-12-06 18:57:43,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1515 states to 1515 states and 1958 transitions. [2021-12-06 18:57:43,461 INFO L78 Accepts]: Start accepts. Automaton has 1515 states and 1958 transitions. Word has length 298 [2021-12-06 18:57:43,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:57:43,461 INFO L470 AbstractCegarLoop]: Abstraction has 1515 states and 1958 transitions. [2021-12-06 18:57:43,461 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.7) internal successors, (117), 9 states have internal predecessors, (117), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2021-12-06 18:57:43,461 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 1958 transitions. [2021-12-06 18:57:43,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2021-12-06 18:57:43,463 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:57:43,463 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 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:57:43,496 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2021-12-06 18:57:43,664 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2021-12-06 18:57:43,664 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:57:43,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:57:43,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1661534500, now seen corresponding path program 1 times [2021-12-06 18:57:43,665 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:57:43,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593407203] [2021-12-06 18:57:43,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:57:43,665 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:57:43,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:43,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:57:43,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:43,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:57:43,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:43,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:57:43,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:43,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:57:43,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:43,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:57:43,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:43,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:57:43,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:43,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:57:43,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:43,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:57:43,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:43,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:57:43,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:43,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:57:43,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:43,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:57:43,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:43,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:57:43,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:43,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:57:43,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:43,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:57:43,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:43,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:57:43,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:43,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:57:43,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:43,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-06 18:57:43,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:43,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-12-06 18:57:43,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:43,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-12-06 18:57:43,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:43,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2021-12-06 18:57:43,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:43,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2021-12-06 18:57:43,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:43,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2021-12-06 18:57:43,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:43,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2021-12-06 18:57:43,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:43,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2021-12-06 18:57:43,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:43,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2021-12-06 18:57:43,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:43,779 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 770 trivial. 0 not checked. [2021-12-06 18:57:43,779 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:57:43,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593407203] [2021-12-06 18:57:43,779 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593407203] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:57:43,780 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:57:43,780 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 18:57:43,780 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114141837] [2021-12-06 18:57:43,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:57:43,780 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 18:57:43,780 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:57:43,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 18:57:43,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-06 18:57:43,781 INFO L87 Difference]: Start difference. First operand 1515 states and 1958 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 3 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2021-12-06 18:57:44,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:57:44,183 INFO L93 Difference]: Finished difference Result 2714 states and 3542 transitions. [2021-12-06 18:57:44,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 18:57:44,183 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 3 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 298 [2021-12-06 18:57:44,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:57:44,190 INFO L225 Difference]: With dead ends: 2714 [2021-12-06 18:57:44,190 INFO L226 Difference]: Without dead ends: 1567 [2021-12-06 18:57:44,192 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-12-06 18:57:44,193 INFO L933 BasicCegarLoop]: 297 mSDtfsCounter, 459 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 18:57:44,193 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [479 Valid, 744 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 18:57:44,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1567 states. [2021-12-06 18:57:44,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1567 to 1427. [2021-12-06 18:57:44,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1427 states, 1174 states have (on average 1.2776831345826236) internal successors, (1500), 1187 states have internal predecessors, (1500), 173 states have call successors, (173), 79 states have call predecessors, (173), 79 states have return successors, (173), 164 states have call predecessors, (173), 173 states have call successors, (173) [2021-12-06 18:57:44,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1427 states and 1846 transitions. [2021-12-06 18:57:44,270 INFO L78 Accepts]: Start accepts. Automaton has 1427 states and 1846 transitions. Word has length 298 [2021-12-06 18:57:44,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:57:44,270 INFO L470 AbstractCegarLoop]: Abstraction has 1427 states and 1846 transitions. [2021-12-06 18:57:44,270 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 3 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2021-12-06 18:57:44,271 INFO L276 IsEmpty]: Start isEmpty. Operand 1427 states and 1846 transitions. [2021-12-06 18:57:44,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2021-12-06 18:57:44,275 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:57:44,275 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:44,276 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-12-06 18:57:44,276 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:57:44,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:57:44,276 INFO L85 PathProgramCache]: Analyzing trace with hash -19843425, now seen corresponding path program 1 times [2021-12-06 18:57:44,276 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:57:44,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244785013] [2021-12-06 18:57:44,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:57:44,276 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:57:44,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:44,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:57:44,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:44,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:57:44,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:44,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:57:44,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:44,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:57:44,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:44,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:57:44,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:44,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:57:44,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:44,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:57:44,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:44,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:57:44,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:44,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:57:44,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:44,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:57:44,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:44,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:57:44,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:44,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:57:44,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:44,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:57:44,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:44,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:57:44,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:44,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:57:44,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:44,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:57:44,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:44,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-06 18:57:44,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:44,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-12-06 18:57:44,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:44,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-12-06 18:57:44,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:44,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2021-12-06 18:57:44,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:44,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2021-12-06 18:57:44,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:44,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2021-12-06 18:57:44,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:44,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2021-12-06 18:57:44,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:44,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2021-12-06 18:57:44,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:44,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2021-12-06 18:57:44,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:44,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2021-12-06 18:57:44,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:44,364 INFO L134 CoverageAnalysis]: Checked inductivity of 710 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 708 trivial. 0 not checked. [2021-12-06 18:57:44,364 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:57:44,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244785013] [2021-12-06 18:57:44,364 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244785013] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:57:44,364 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:57:44,365 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 18:57:44,365 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429217530] [2021-12-06 18:57:44,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:57:44,365 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 18:57:44,365 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:57:44,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 18:57:44,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 18:57:44,366 INFO L87 Difference]: Start difference. First operand 1427 states and 1846 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2021-12-06 18:57:44,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:57:44,719 INFO L93 Difference]: Finished difference Result 2620 states and 3407 transitions. [2021-12-06 18:57:44,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-06 18:57:44,719 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 311 [2021-12-06 18:57:44,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:57:44,724 INFO L225 Difference]: With dead ends: 2620 [2021-12-06 18:57:44,724 INFO L226 Difference]: Without dead ends: 1561 [2021-12-06 18:57:44,726 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-06 18:57:44,726 INFO L933 BasicCegarLoop]: 392 mSDtfsCounter, 495 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 1021 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 18:57:44,726 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [513 Valid, 1021 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 18:57:44,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1561 states. [2021-12-06 18:57:44,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1561 to 1286. [2021-12-06 18:57:44,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1286 states, 1064 states have (on average 1.256578947368421) internal successors, (1337), 1072 states have internal predecessors, (1337), 151 states have call successors, (151), 70 states have call predecessors, (151), 70 states have return successors, (151), 143 states have call predecessors, (151), 151 states have call successors, (151) [2021-12-06 18:57:44,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 1286 states and 1639 transitions. [2021-12-06 18:57:44,794 INFO L78 Accepts]: Start accepts. Automaton has 1286 states and 1639 transitions. Word has length 311 [2021-12-06 18:57:44,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:57:44,794 INFO L470 AbstractCegarLoop]: Abstraction has 1286 states and 1639 transitions. [2021-12-06 18:57:44,794 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2021-12-06 18:57:44,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 1639 transitions. [2021-12-06 18:57:44,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2021-12-06 18:57:44,797 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:57:44,797 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 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] [2021-12-06 18:57:44,797 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-12-06 18:57:44,797 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:57:44,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:57:44,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1173087113, now seen corresponding path program 1 times [2021-12-06 18:57:44,798 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:57:44,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862322689] [2021-12-06 18:57:44,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:57:44,798 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:57:44,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:44,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:57:44,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:44,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:57:44,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:44,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:57:44,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:44,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:57:44,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:44,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:57:44,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:44,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:57:44,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:44,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:57:44,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:44,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:57:44,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:44,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:57:44,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:44,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:57:44,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:44,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:57:44,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:44,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:57:44,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:44,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:57:44,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:44,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:57:44,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:44,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:57:44,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:44,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:57:44,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:44,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-06 18:57:44,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:44,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-12-06 18:57:44,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:44,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-12-06 18:57:44,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:44,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2021-12-06 18:57:44,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:44,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2021-12-06 18:57:44,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:44,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2021-12-06 18:57:44,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:44,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2021-12-06 18:57:44,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:44,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2021-12-06 18:57:44,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:44,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2021-12-06 18:57:44,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:44,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2021-12-06 18:57:44,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:44,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 312 [2021-12-06 18:57:44,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:44,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 321 [2021-12-06 18:57:44,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:44,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 330 [2021-12-06 18:57:44,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:44,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 338 [2021-12-06 18:57:44,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:44,965 INFO L134 CoverageAnalysis]: Checked inductivity of 881 backedges. 16 proven. 20 refuted. 0 times theorem prover too weak. 845 trivial. 0 not checked. [2021-12-06 18:57:44,965 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:57:44,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862322689] [2021-12-06 18:57:44,965 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862322689] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 18:57:44,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317133314] [2021-12-06 18:57:44,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:57:44,966 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:57:44,966 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 18:57:44,967 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 18:57:44,976 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-06 18:57:45,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:45,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 1283 conjuncts, 40 conjunts are in the unsatisfiable core [2021-12-06 18:57:45,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 18:57:45,418 INFO L134 CoverageAnalysis]: Checked inductivity of 881 backedges. 151 proven. 33 refuted. 0 times theorem prover too weak. 697 trivial. 0 not checked. [2021-12-06 18:57:45,418 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 18:57:45,751 INFO L134 CoverageAnalysis]: Checked inductivity of 881 backedges. 49 proven. 2 refuted. 0 times theorem prover too weak. 830 trivial. 0 not checked. [2021-12-06 18:57:45,751 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317133314] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 18:57:45,751 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 18:57:45,752 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 9] total 23 [2021-12-06 18:57:45,752 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086456685] [2021-12-06 18:57:45,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 18:57:45,752 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-06 18:57:45,752 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:57:45,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-06 18:57:45,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=447, Unknown=0, NotChecked=0, Total=506 [2021-12-06 18:57:45,753 INFO L87 Difference]: Start difference. First operand 1286 states and 1639 transitions. Second operand has 23 states, 23 states have (on average 9.391304347826088) internal successors, (216), 19 states have internal predecessors, (216), 6 states have call successors, (45), 6 states have call predecessors, (45), 9 states have return successors, (46), 9 states have call predecessors, (46), 6 states have call successors, (46) [2021-12-06 18:57:52,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:57:52,997 INFO L93 Difference]: Finished difference Result 8833 states and 12572 transitions. [2021-12-06 18:57:52,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2021-12-06 18:57:52,998 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 9.391304347826088) internal successors, (216), 19 states have internal predecessors, (216), 6 states have call successors, (45), 6 states have call predecessors, (45), 9 states have return successors, (46), 9 states have call predecessors, (46), 6 states have call successors, (46) Word has length 352 [2021-12-06 18:57:52,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:57:53,018 INFO L225 Difference]: With dead ends: 8833 [2021-12-06 18:57:53,018 INFO L226 Difference]: Without dead ends: 7915 [2021-12-06 18:57:53,026 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 967 GetRequests, 814 SyntacticMatches, 1 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8331 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2215, Invalid=21347, Unknown=0, NotChecked=0, Total=23562 [2021-12-06 18:57:53,026 INFO L933 BasicCegarLoop]: 843 mSDtfsCounter, 3394 mSDsluCounter, 10171 mSDsCounter, 0 mSdLazyCounter, 12519 mSolverCounterSat, 2225 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3420 SdHoareTripleChecker+Valid, 11014 SdHoareTripleChecker+Invalid, 14744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2225 IncrementalHoareTripleChecker+Valid, 12519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2021-12-06 18:57:53,027 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3420 Valid, 11014 Invalid, 14744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2225 Valid, 12519 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2021-12-06 18:57:53,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7915 states. [2021-12-06 18:57:53,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7915 to 2726. [2021-12-06 18:57:53,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2726 states, 2224 states have (on average 1.272931654676259) internal successors, (2831), 2246 states have internal predecessors, (2831), 326 states have call successors, (326), 157 states have call predecessors, (326), 175 states have return successors, (356), 322 states have call predecessors, (356), 326 states have call successors, (356) [2021-12-06 18:57:53,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2726 states to 2726 states and 3513 transitions. [2021-12-06 18:57:53,303 INFO L78 Accepts]: Start accepts. Automaton has 2726 states and 3513 transitions. Word has length 352 [2021-12-06 18:57:53,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:57:53,304 INFO L470 AbstractCegarLoop]: Abstraction has 2726 states and 3513 transitions. [2021-12-06 18:57:53,304 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 9.391304347826088) internal successors, (216), 19 states have internal predecessors, (216), 6 states have call successors, (45), 6 states have call predecessors, (45), 9 states have return successors, (46), 9 states have call predecessors, (46), 6 states have call successors, (46) [2021-12-06 18:57:53,304 INFO L276 IsEmpty]: Start isEmpty. Operand 2726 states and 3513 transitions. [2021-12-06 18:57:53,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2021-12-06 18:57:53,308 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:57:53,308 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 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] [2021-12-06 18:57:53,328 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2021-12-06 18:57:53,509 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:57:53,509 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:57:53,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:57:53,510 INFO L85 PathProgramCache]: Analyzing trace with hash 623485226, now seen corresponding path program 1 times [2021-12-06 18:57:53,511 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:57:53,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78620866] [2021-12-06 18:57:53,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:57:53,512 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:57:53,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:53,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:57:53,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:53,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:57:53,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:53,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:57:53,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:53,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:57:53,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:53,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:57:53,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:53,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:57:53,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:53,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:57:53,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:53,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:57:53,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:53,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:57:53,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:53,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:57:53,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:53,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:57:53,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:53,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:57:53,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:53,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:57:53,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:53,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:57:53,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:53,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:57:53,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:53,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:57:53,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:53,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-06 18:57:53,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:53,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-12-06 18:57:53,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:53,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-12-06 18:57:53,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:53,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2021-12-06 18:57:53,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:53,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2021-12-06 18:57:53,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:53,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2021-12-06 18:57:53,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:53,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2021-12-06 18:57:53,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:53,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2021-12-06 18:57:53,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:53,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2021-12-06 18:57:53,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:53,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2021-12-06 18:57:53,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:53,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 312 [2021-12-06 18:57:53,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:53,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 321 [2021-12-06 18:57:53,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:53,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 330 [2021-12-06 18:57:53,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:53,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 338 [2021-12-06 18:57:53,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:53,671 INFO L134 CoverageAnalysis]: Checked inductivity of 881 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 853 trivial. 0 not checked. [2021-12-06 18:57:53,671 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:57:53,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78620866] [2021-12-06 18:57:53,672 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78620866] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:57:53,672 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:57:53,672 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-06 18:57:53,672 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106852844] [2021-12-06 18:57:53,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:57:53,672 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 18:57:53,672 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:57:53,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 18:57:53,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-06 18:57:53,673 INFO L87 Difference]: Start difference. First operand 2726 states and 3513 transitions. Second operand has 9 states, 9 states have (on average 12.88888888888889) internal successors, (116), 7 states have internal predecessors, (116), 3 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) [2021-12-06 18:57:54,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:57:54,444 INFO L93 Difference]: Finished difference Result 6324 states and 8353 transitions. [2021-12-06 18:57:54,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-06 18:57:54,445 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.88888888888889) internal successors, (116), 7 states have internal predecessors, (116), 3 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) Word has length 352 [2021-12-06 18:57:54,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:57:54,452 INFO L225 Difference]: With dead ends: 6324 [2021-12-06 18:57:54,452 INFO L226 Difference]: Without dead ends: 4142 [2021-12-06 18:57:54,455 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2021-12-06 18:57:54,455 INFO L933 BasicCegarLoop]: 440 mSDtfsCounter, 557 mSDsluCounter, 1880 mSDsCounter, 0 mSdLazyCounter, 1219 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 569 SdHoareTripleChecker+Valid, 2320 SdHoareTripleChecker+Invalid, 1350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 1219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 18:57:54,456 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [569 Valid, 2320 Invalid, 1350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 1219 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-06 18:57:54,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4142 states. [2021-12-06 18:57:54,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4142 to 2424. [2021-12-06 18:57:54,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2424 states, 1996 states have (on average 1.2650300601202404) internal successors, (2525), 2016 states have internal predecessors, (2525), 276 states have call successors, (276), 135 states have call predecessors, (276), 151 states have return successors, (296), 272 states have call predecessors, (296), 276 states have call successors, (296) [2021-12-06 18:57:54,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2424 states to 2424 states and 3097 transitions. [2021-12-06 18:57:54,626 INFO L78 Accepts]: Start accepts. Automaton has 2424 states and 3097 transitions. Word has length 352 [2021-12-06 18:57:54,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:57:54,627 INFO L470 AbstractCegarLoop]: Abstraction has 2424 states and 3097 transitions. [2021-12-06 18:57:54,627 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.88888888888889) internal successors, (116), 7 states have internal predecessors, (116), 3 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) [2021-12-06 18:57:54,627 INFO L276 IsEmpty]: Start isEmpty. Operand 2424 states and 3097 transitions. [2021-12-06 18:57:54,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2021-12-06 18:57:54,631 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:57:54,631 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 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] [2021-12-06 18:57:54,631 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-12-06 18:57:54,631 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:57:54,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:57:54,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1387268054, now seen corresponding path program 1 times [2021-12-06 18:57:54,632 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:57:54,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312706638] [2021-12-06 18:57:54,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:57:54,632 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:57:54,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:54,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:57:54,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:54,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:57:54,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:54,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:57:54,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:54,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:57:54,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:54,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:57:54,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:54,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:57:54,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:54,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:57:54,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:54,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:57:54,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:54,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:57:54,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:54,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:57:54,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:54,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:57:54,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:54,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:57:54,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:54,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:57:54,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:54,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:57:54,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:54,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:57:54,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:54,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:57:54,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:54,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-06 18:57:54,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:54,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-12-06 18:57:54,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:54,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-12-06 18:57:54,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:54,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2021-12-06 18:57:54,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:54,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2021-12-06 18:57:54,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:54,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2021-12-06 18:57:54,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:54,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2021-12-06 18:57:54,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:54,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2021-12-06 18:57:54,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:54,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2021-12-06 18:57:54,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:54,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2021-12-06 18:57:54,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:54,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 312 [2021-12-06 18:57:54,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:54,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 321 [2021-12-06 18:57:54,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:54,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 330 [2021-12-06 18:57:54,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:54,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 338 [2021-12-06 18:57:54,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:54,744 INFO L134 CoverageAnalysis]: Checked inductivity of 881 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 873 trivial. 0 not checked. [2021-12-06 18:57:54,744 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:57:54,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312706638] [2021-12-06 18:57:54,745 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312706638] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:57:54,745 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:57:54,745 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 18:57:54,745 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719871095] [2021-12-06 18:57:54,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:57:54,745 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 18:57:54,745 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:57:54,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 18:57:54,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-06 18:57:54,746 INFO L87 Difference]: Start difference. First operand 2424 states and 3097 transitions. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 5 states have internal predecessors, (108), 4 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2021-12-06 18:57:55,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:57:55,087 INFO L93 Difference]: Finished difference Result 4456 states and 5730 transitions. [2021-12-06 18:57:55,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 18:57:55,087 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 5 states have internal predecessors, (108), 4 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) Word has length 352 [2021-12-06 18:57:55,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:57:55,092 INFO L225 Difference]: With dead ends: 4456 [2021-12-06 18:57:55,092 INFO L226 Difference]: Without dead ends: 2424 [2021-12-06 18:57:55,094 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-06 18:57:55,095 INFO L933 BasicCegarLoop]: 228 mSDtfsCounter, 373 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 18:57:55,095 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [389 Valid, 507 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 18:57:55,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2424 states. [2021-12-06 18:57:55,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2424 to 2424. [2021-12-06 18:57:55,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2424 states, 1996 states have (on average 1.2635270541082164) internal successors, (2522), 2016 states have internal predecessors, (2522), 276 states have call successors, (276), 135 states have call predecessors, (276), 151 states have return successors, (296), 272 states have call predecessors, (296), 276 states have call successors, (296) [2021-12-06 18:57:55,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2424 states to 2424 states and 3094 transitions. [2021-12-06 18:57:55,262 INFO L78 Accepts]: Start accepts. Automaton has 2424 states and 3094 transitions. Word has length 352 [2021-12-06 18:57:55,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:57:55,262 INFO L470 AbstractCegarLoop]: Abstraction has 2424 states and 3094 transitions. [2021-12-06 18:57:55,262 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 5 states have internal predecessors, (108), 4 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2021-12-06 18:57:55,263 INFO L276 IsEmpty]: Start isEmpty. Operand 2424 states and 3094 transitions. [2021-12-06 18:57:55,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2021-12-06 18:57:55,267 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:57:55,267 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 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] [2021-12-06 18:57:55,267 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-12-06 18:57:55,267 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:57:55,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:57:55,267 INFO L85 PathProgramCache]: Analyzing trace with hash -838242006, now seen corresponding path program 1 times [2021-12-06 18:57:55,267 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:57:55,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832384939] [2021-12-06 18:57:55,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:57:55,268 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:57:55,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:55,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:57:55,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:55,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:57:55,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:55,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:57:55,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:55,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:57:55,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:55,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:57:55,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:55,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:57:55,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:55,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:57:55,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:55,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:57:55,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:55,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:57:55,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:55,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:57:55,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:55,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:57:55,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:55,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:57:55,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:55,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:57:55,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:55,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:57:55,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:55,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:57:55,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:55,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:57:55,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:55,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-06 18:57:55,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:55,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-12-06 18:57:55,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:55,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2021-12-06 18:57:55,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:55,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2021-12-06 18:57:55,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:55,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2021-12-06 18:57:55,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:55,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2021-12-06 18:57:55,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:55,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2021-12-06 18:57:55,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:55,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2021-12-06 18:57:55,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:55,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2021-12-06 18:57:55,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:55,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2021-12-06 18:57:55,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:55,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 312 [2021-12-06 18:57:55,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:55,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 321 [2021-12-06 18:57:55,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:55,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 330 [2021-12-06 18:57:55,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:55,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 338 [2021-12-06 18:57:55,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:55,362 INFO L134 CoverageAnalysis]: Checked inductivity of 877 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 854 trivial. 0 not checked. [2021-12-06 18:57:55,362 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:57:55,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832384939] [2021-12-06 18:57:55,362 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832384939] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:57:55,362 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:57:55,362 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 18:57:55,363 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631786214] [2021-12-06 18:57:55,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:57:55,363 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 18:57:55,363 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:57:55,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 18:57:55,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 18:57:55,364 INFO L87 Difference]: Start difference. First operand 2424 states and 3094 transitions. Second operand has 4 states, 4 states have (on average 31.25) internal successors, (125), 3 states have internal predecessors, (125), 2 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2021-12-06 18:57:55,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:57:55,849 INFO L93 Difference]: Finished difference Result 6374 states and 8182 transitions. [2021-12-06 18:57:55,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 18:57:55,850 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 3 states have internal predecessors, (125), 2 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 352 [2021-12-06 18:57:55,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:57:55,858 INFO L225 Difference]: With dead ends: 6374 [2021-12-06 18:57:55,858 INFO L226 Difference]: Without dead ends: 4330 [2021-12-06 18:57:55,861 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-06 18:57:55,861 INFO L933 BasicCegarLoop]: 302 mSDtfsCounter, 212 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 18:57:55,862 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [232 Valid, 660 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 18:57:55,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4330 states. [2021-12-06 18:57:56,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4330 to 2772. [2021-12-06 18:57:56,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2772 states, 2344 states have (on average 1.2602389078498293) internal successors, (2954), 2364 states have internal predecessors, (2954), 276 states have call successors, (276), 135 states have call predecessors, (276), 151 states have return successors, (296), 272 states have call predecessors, (296), 276 states have call successors, (296) [2021-12-06 18:57:56,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2772 states to 2772 states and 3526 transitions. [2021-12-06 18:57:56,102 INFO L78 Accepts]: Start accepts. Automaton has 2772 states and 3526 transitions. Word has length 352 [2021-12-06 18:57:56,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:57:56,102 INFO L470 AbstractCegarLoop]: Abstraction has 2772 states and 3526 transitions. [2021-12-06 18:57:56,102 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 3 states have internal predecessors, (125), 2 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2021-12-06 18:57:56,102 INFO L276 IsEmpty]: Start isEmpty. Operand 2772 states and 3526 transitions. [2021-12-06 18:57:56,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2021-12-06 18:57:56,107 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:57:56,107 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 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] [2021-12-06 18:57:56,107 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-12-06 18:57:56,108 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:57:56,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:57:56,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1734722604, now seen corresponding path program 1 times [2021-12-06 18:57:56,108 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:57:56,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331983509] [2021-12-06 18:57:56,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:57:56,108 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:57:56,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:56,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:57:56,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:56,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:57:56,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:56,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:57:56,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:56,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:57:56,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:56,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:57:56,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:56,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:57:56,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:56,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:57:56,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:56,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:57:56,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:56,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:57:56,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:56,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:57:56,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:56,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:57:56,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:56,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:57:56,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:56,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:57:56,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:56,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:57:56,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:56,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:57:56,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:56,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:57:56,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:56,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-06 18:57:56,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:56,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-12-06 18:57:56,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:56,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2021-12-06 18:57:56,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:56,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2021-12-06 18:57:56,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:56,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2021-12-06 18:57:56,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:56,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2021-12-06 18:57:56,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:56,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2021-12-06 18:57:56,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:56,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2021-12-06 18:57:56,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:56,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2021-12-06 18:57:56,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:56,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2021-12-06 18:57:56,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:56,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 312 [2021-12-06 18:57:56,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:56,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 321 [2021-12-06 18:57:56,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:56,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 330 [2021-12-06 18:57:56,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:56,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 338 [2021-12-06 18:57:56,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:56,207 INFO L134 CoverageAnalysis]: Checked inductivity of 877 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 833 trivial. 0 not checked. [2021-12-06 18:57:56,208 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:57:56,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331983509] [2021-12-06 18:57:56,208 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331983509] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:57:56,208 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:57:56,208 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 18:57:56,208 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829381629] [2021-12-06 18:57:56,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:57:56,209 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 18:57:56,209 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:57:56,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 18:57:56,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 18:57:56,209 INFO L87 Difference]: Start difference. First operand 2772 states and 3526 transitions. Second operand has 5 states, 5 states have (on average 22.8) internal successors, (114), 4 states have internal predecessors, (114), 2 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2021-12-06 18:57:56,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:57:56,534 INFO L93 Difference]: Finished difference Result 5569 states and 7079 transitions. [2021-12-06 18:57:56,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 18:57:56,535 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 4 states have internal predecessors, (114), 2 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) Word has length 352 [2021-12-06 18:57:56,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:57:56,541 INFO L225 Difference]: With dead ends: 5569 [2021-12-06 18:57:56,541 INFO L226 Difference]: Without dead ends: 2708 [2021-12-06 18:57:56,544 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-06 18:57:56,545 INFO L933 BasicCegarLoop]: 225 mSDtfsCounter, 107 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 18:57:56,545 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 722 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 18:57:56,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2708 states. [2021-12-06 18:57:56,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2708 to 2708. [2021-12-06 18:57:56,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2708 states, 2296 states have (on average 1.2364982578397212) internal successors, (2839), 2316 states have internal predecessors, (2839), 276 states have call successors, (276), 135 states have call predecessors, (276), 135 states have return successors, (276), 256 states have call predecessors, (276), 276 states have call successors, (276) [2021-12-06 18:57:56,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2708 states to 2708 states and 3391 transitions. [2021-12-06 18:57:56,750 INFO L78 Accepts]: Start accepts. Automaton has 2708 states and 3391 transitions. Word has length 352 [2021-12-06 18:57:56,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:57:56,751 INFO L470 AbstractCegarLoop]: Abstraction has 2708 states and 3391 transitions. [2021-12-06 18:57:56,751 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 4 states have internal predecessors, (114), 2 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2021-12-06 18:57:56,751 INFO L276 IsEmpty]: Start isEmpty. Operand 2708 states and 3391 transitions. [2021-12-06 18:57:56,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2021-12-06 18:57:56,756 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:57:56,756 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 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] [2021-12-06 18:57:56,756 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-12-06 18:57:56,756 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:57:56,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:57:56,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1091864014, now seen corresponding path program 1 times [2021-12-06 18:57:56,757 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:57:56,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198941893] [2021-12-06 18:57:56,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:57:56,757 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:57:56,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:56,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:57:56,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:56,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:57:56,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:56,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:57:56,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:56,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:57:56,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:56,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:57:56,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:56,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:57:56,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:56,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:57:56,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:56,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:57:56,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:56,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:57:56,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:56,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:57:56,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:56,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:57:56,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:56,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:57:56,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:56,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:57:56,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:56,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:57:56,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:56,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:57:56,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:56,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:57:56,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:56,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-06 18:57:56,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:56,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-12-06 18:57:56,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:56,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2021-12-06 18:57:56,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:56,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2021-12-06 18:57:56,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:56,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2021-12-06 18:57:56,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:56,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2021-12-06 18:57:56,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:56,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2021-12-06 18:57:56,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:56,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2021-12-06 18:57:56,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:56,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2021-12-06 18:57:56,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:56,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2021-12-06 18:57:56,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:56,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 312 [2021-12-06 18:57:56,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:56,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 321 [2021-12-06 18:57:56,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:56,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 331 [2021-12-06 18:57:56,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:56,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 340 [2021-12-06 18:57:56,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:56,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 348 [2021-12-06 18:57:56,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:56,863 INFO L134 CoverageAnalysis]: Checked inductivity of 934 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 910 trivial. 0 not checked. [2021-12-06 18:57:56,863 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:57:56,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198941893] [2021-12-06 18:57:56,863 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198941893] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:57:56,863 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:57:56,863 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 18:57:56,864 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627903393] [2021-12-06 18:57:56,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:57:56,864 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 18:57:56,864 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:57:56,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 18:57:56,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 18:57:56,865 INFO L87 Difference]: Start difference. First operand 2708 states and 3391 transitions. Second operand has 4 states, 4 states have (on average 32.5) internal successors, (130), 3 states have internal predecessors, (130), 2 states have call successors, (22), 3 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2021-12-06 18:57:57,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:57:57,157 INFO L93 Difference]: Finished difference Result 4994 states and 6282 transitions. [2021-12-06 18:57:57,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 18:57:57,158 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 3 states have internal predecessors, (130), 2 states have call successors, (22), 3 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 362 [2021-12-06 18:57:57,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:57:57,162 INFO L225 Difference]: With dead ends: 4994 [2021-12-06 18:57:57,162 INFO L226 Difference]: Without dead ends: 2623 [2021-12-06 18:57:57,165 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 18:57:57,166 INFO L933 BasicCegarLoop]: 235 mSDtfsCounter, 54 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 18:57:57,166 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 563 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 18:57:57,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2623 states. [2021-12-06 18:57:57,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2623 to 2623. [2021-12-06 18:57:57,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2623 states, 2211 states have (on average 1.222071460877431) internal successors, (2702), 2231 states have internal predecessors, (2702), 276 states have call successors, (276), 135 states have call predecessors, (276), 135 states have return successors, (276), 256 states have call predecessors, (276), 276 states have call successors, (276) [2021-12-06 18:57:57,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2623 states to 2623 states and 3254 transitions. [2021-12-06 18:57:57,392 INFO L78 Accepts]: Start accepts. Automaton has 2623 states and 3254 transitions. Word has length 362 [2021-12-06 18:57:57,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:57:57,392 INFO L470 AbstractCegarLoop]: Abstraction has 2623 states and 3254 transitions. [2021-12-06 18:57:57,393 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 3 states have internal predecessors, (130), 2 states have call successors, (22), 3 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2021-12-06 18:57:57,393 INFO L276 IsEmpty]: Start isEmpty. Operand 2623 states and 3254 transitions. [2021-12-06 18:57:57,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2021-12-06 18:57:57,397 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:57:57,397 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 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] [2021-12-06 18:57:57,398 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-12-06 18:57:57,398 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:57:57,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:57:57,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1080894090, now seen corresponding path program 1 times [2021-12-06 18:57:57,398 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:57:57,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95287] [2021-12-06 18:57:57,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:57:57,398 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:57:57,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:57,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:57:57,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:57,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:57:57,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:57,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:57:57,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:57,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:57:57,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:57,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:57:57,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:57,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:57:57,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:57,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:57:57,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:57,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:57:57,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:57,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:57:57,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:57,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:57:57,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:57,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:57:57,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:57,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:57:57,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:57,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:57:57,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:57,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:57:57,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:57,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:57:57,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:57,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:57:57,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:57,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-06 18:57:57,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:57,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2021-12-06 18:57:57,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:57,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2021-12-06 18:57:57,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:57,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2021-12-06 18:57:57,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:57,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2021-12-06 18:57:57,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:57,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2021-12-06 18:57:57,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:57,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2021-12-06 18:57:57,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:57,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2021-12-06 18:57:57,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:57,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 284 [2021-12-06 18:57:57,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:57,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 294 [2021-12-06 18:57:57,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:57,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 313 [2021-12-06 18:57:57,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:57,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 322 [2021-12-06 18:57:57,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:57,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 332 [2021-12-06 18:57:57,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:57,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 341 [2021-12-06 18:57:57,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:57,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 349 [2021-12-06 18:57:57,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:57,549 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 16 proven. 20 refuted. 0 times theorem prover too weak. 902 trivial. 0 not checked. [2021-12-06 18:57:57,549 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:57:57,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95287] [2021-12-06 18:57:57,549 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95287] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 18:57:57,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1381161474] [2021-12-06 18:57:57,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:57:57,550 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:57:57,550 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 18:57:57,550 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 18:57:57,551 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-12-06 18:57:57,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:57:57,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 1309 conjuncts, 40 conjunts are in the unsatisfiable core [2021-12-06 18:57:57,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 18:57:58,061 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 293 proven. 92 refuted. 0 times theorem prover too weak. 553 trivial. 0 not checked. [2021-12-06 18:57:58,061 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 18:57:58,570 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 51 proven. 199 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2021-12-06 18:57:58,570 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1381161474] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 18:57:58,571 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 18:57:58,571 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 18] total 33 [2021-12-06 18:57:58,571 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203653551] [2021-12-06 18:57:58,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 18:57:58,572 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-12-06 18:57:58,572 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:57:58,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-12-06 18:57:58,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=967, Unknown=0, NotChecked=0, Total=1056 [2021-12-06 18:57:58,573 INFO L87 Difference]: Start difference. First operand 2623 states and 3254 transitions. Second operand has 33 states, 32 states have (on average 9.3125) internal successors, (298), 28 states have internal predecessors, (298), 10 states have call successors, (61), 10 states have call predecessors, (61), 11 states have return successors, (60), 10 states have call predecessors, (60), 9 states have call successors, (60) [2021-12-06 18:58:08,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:58:08,392 INFO L93 Difference]: Finished difference Result 15761 states and 21274 transitions. [2021-12-06 18:58:08,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 166 states. [2021-12-06 18:58:08,393 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 9.3125) internal successors, (298), 28 states have internal predecessors, (298), 10 states have call successors, (61), 10 states have call predecessors, (61), 11 states have return successors, (60), 10 states have call predecessors, (60), 9 states have call successors, (60) Word has length 363 [2021-12-06 18:58:08,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:58:08,422 INFO L225 Difference]: With dead ends: 15761 [2021-12-06 18:58:08,422 INFO L226 Difference]: Without dead ends: 13678 [2021-12-06 18:58:08,435 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 969 GetRequests, 776 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13680 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3023, Invalid=34807, Unknown=0, NotChecked=0, Total=37830 [2021-12-06 18:58:08,436 INFO L933 BasicCegarLoop]: 1016 mSDtfsCounter, 3759 mSDsluCounter, 17173 mSDsCounter, 0 mSdLazyCounter, 15928 mSolverCounterSat, 1685 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3785 SdHoareTripleChecker+Valid, 18189 SdHoareTripleChecker+Invalid, 17613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1685 IncrementalHoareTripleChecker+Valid, 15928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2021-12-06 18:58:08,436 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3785 Valid, 18189 Invalid, 17613 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1685 Valid, 15928 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2021-12-06 18:58:08,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13678 states. [2021-12-06 18:58:08,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13678 to 3066. [2021-12-06 18:58:08,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3066 states, 2606 states have (on average 1.2145049884881043) internal successors, (3165), 2626 states have internal predecessors, (3165), 302 states have call successors, (302), 155 states have call predecessors, (302), 157 states have return successors, (306), 284 states have call predecessors, (306), 302 states have call successors, (306) [2021-12-06 18:58:08,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3066 states to 3066 states and 3773 transitions. [2021-12-06 18:58:08,764 INFO L78 Accepts]: Start accepts. Automaton has 3066 states and 3773 transitions. Word has length 363 [2021-12-06 18:58:08,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:58:08,765 INFO L470 AbstractCegarLoop]: Abstraction has 3066 states and 3773 transitions. [2021-12-06 18:58:08,765 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 9.3125) internal successors, (298), 28 states have internal predecessors, (298), 10 states have call successors, (61), 10 states have call predecessors, (61), 11 states have return successors, (60), 10 states have call predecessors, (60), 9 states have call successors, (60) [2021-12-06 18:58:08,765 INFO L276 IsEmpty]: Start isEmpty. Operand 3066 states and 3773 transitions. [2021-12-06 18:58:08,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2021-12-06 18:58:08,770 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:58:08,771 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 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] [2021-12-06 18:58:08,791 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2021-12-06 18:58:08,971 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2021-12-06 18:58:08,971 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:58:08,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:58:08,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1599486290, now seen corresponding path program 1 times [2021-12-06 18:58:08,972 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:58:08,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124241334] [2021-12-06 18:58:08,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:58:08,972 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:58:08,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:08,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:58:08,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:08,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:58:08,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:09,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-06 18:58:09,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:09,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-06 18:58:09,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:09,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-06 18:58:09,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:09,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:58:09,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:09,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:58:09,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:09,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:58:09,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:09,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-12-06 18:58:09,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:09,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:58:09,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:09,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:58:09,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:09,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:58:09,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:09,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-06 18:58:09,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:09,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:58:09,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:09,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:58:09,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:09,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:58:09,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:09,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2021-12-06 18:58:09,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:09,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2021-12-06 18:58:09,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:09,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2021-12-06 18:58:09,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:09,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2021-12-06 18:58:09,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:09,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2021-12-06 18:58:09,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:09,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2021-12-06 18:58:09,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:09,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2021-12-06 18:58:09,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:09,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2021-12-06 18:58:09,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:09,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2021-12-06 18:58:09,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:09,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 297 [2021-12-06 18:58:09,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:09,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 316 [2021-12-06 18:58:09,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:09,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 325 [2021-12-06 18:58:09,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:09,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 335 [2021-12-06 18:58:09,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:09,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 344 [2021-12-06 18:58:09,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:09,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 352 [2021-12-06 18:58:09,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:09,088 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 9 proven. 136 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2021-12-06 18:58:09,088 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:58:09,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124241334] [2021-12-06 18:58:09,089 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124241334] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 18:58:09,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038061514] [2021-12-06 18:58:09,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:58:09,089 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:58:09,089 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 18:58:09,090 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 18:58:09,090 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-12-06 18:58:09,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:09,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 1307 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-06 18:58:09,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 18:58:09,529 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 693 trivial. 0 not checked. [2021-12-06 18:58:09,529 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 18:58:09,530 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038061514] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:58:09,530 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 18:58:09,530 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2021-12-06 18:58:09,530 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468977296] [2021-12-06 18:58:09,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:58:09,531 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 18:58:09,531 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:58:09,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 18:58:09,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-06 18:58:09,531 INFO L87 Difference]: Start difference. First operand 3066 states and 3773 transitions. Second operand has 5 states, 5 states have (on average 25.0) internal successors, (125), 4 states have internal predecessors, (125), 3 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2021-12-06 18:58:09,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:58:09,823 INFO L93 Difference]: Finished difference Result 5395 states and 6695 transitions. [2021-12-06 18:58:09,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 18:58:09,823 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 4 states have internal predecessors, (125), 3 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 366 [2021-12-06 18:58:09,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:58:09,848 INFO L225 Difference]: With dead ends: 5395 [2021-12-06 18:58:09,849 INFO L226 Difference]: Without dead ends: 3082 [2021-12-06 18:58:09,852 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 425 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-06 18:58:09,852 INFO L933 BasicCegarLoop]: 245 mSDtfsCounter, 199 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 18:58:09,852 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [199 Valid, 514 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 18:58:09,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3082 states. [2021-12-06 18:58:10,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3082 to 3066. [2021-12-06 18:58:10,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3066 states, 2606 states have (on average 1.2129700690713738) internal successors, (3161), 2626 states have internal predecessors, (3161), 302 states have call successors, (302), 155 states have call predecessors, (302), 157 states have return successors, (306), 284 states have call predecessors, (306), 302 states have call successors, (306) [2021-12-06 18:58:10,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3066 states to 3066 states and 3769 transitions. [2021-12-06 18:58:10,101 INFO L78 Accepts]: Start accepts. Automaton has 3066 states and 3769 transitions. Word has length 366 [2021-12-06 18:58:10,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:58:10,101 INFO L470 AbstractCegarLoop]: Abstraction has 3066 states and 3769 transitions. [2021-12-06 18:58:10,102 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 4 states have internal predecessors, (125), 3 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2021-12-06 18:58:10,102 INFO L276 IsEmpty]: Start isEmpty. Operand 3066 states and 3769 transitions. [2021-12-06 18:58:10,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2021-12-06 18:58:10,107 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:58:10,107 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1] [2021-12-06 18:58:10,127 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2021-12-06 18:58:10,307 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:58:10,308 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:58:10,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:58:10,308 INFO L85 PathProgramCache]: Analyzing trace with hash -902269648, now seen corresponding path program 1 times [2021-12-06 18:58:10,308 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:58:10,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260497438] [2021-12-06 18:58:10,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:58:10,309 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:58:10,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:10,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:58:10,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:10,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:58:10,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:10,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-06 18:58:10,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:10,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-06 18:58:10,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:10,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-06 18:58:10,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:10,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:58:10,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:10,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:58:10,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:10,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:58:10,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:10,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-12-06 18:58:10,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:10,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:58:10,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:10,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:58:10,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:10,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:58:10,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:10,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-06 18:58:10,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:10,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:58:10,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:10,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:58:10,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:10,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:58:10,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:10,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2021-12-06 18:58:10,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:10,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2021-12-06 18:58:10,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:10,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2021-12-06 18:58:10,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:10,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2021-12-06 18:58:10,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:10,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2021-12-06 18:58:10,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:10,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2021-12-06 18:58:10,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:10,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2021-12-06 18:58:10,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:10,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2021-12-06 18:58:10,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:10,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2021-12-06 18:58:10,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:10,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 297 [2021-12-06 18:58:10,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:10,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 316 [2021-12-06 18:58:10,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:10,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 325 [2021-12-06 18:58:10,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:10,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 335 [2021-12-06 18:58:10,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:10,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 344 [2021-12-06 18:58:10,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:10,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 352 [2021-12-06 18:58:10,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:10,401 INFO L134 CoverageAnalysis]: Checked inductivity of 944 backedges. 9 proven. 136 refuted. 0 times theorem prover too weak. 799 trivial. 0 not checked. [2021-12-06 18:58:10,401 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:58:10,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260497438] [2021-12-06 18:58:10,401 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260497438] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 18:58:10,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748478837] [2021-12-06 18:58:10,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:58:10,402 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:58:10,402 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 18:58:10,402 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 18:58:10,403 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-12-06 18:58:10,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:10,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 1309 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-06 18:58:10,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 18:58:10,743 INFO L134 CoverageAnalysis]: Checked inductivity of 944 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 855 trivial. 0 not checked. [2021-12-06 18:58:10,743 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 18:58:10,744 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748478837] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:58:10,744 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 18:58:10,744 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2021-12-06 18:58:10,744 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534913297] [2021-12-06 18:58:10,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:58:10,744 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 18:58:10,744 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:58:10,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 18:58:10,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 18:58:10,745 INFO L87 Difference]: Start difference. First operand 3066 states and 3769 transitions. Second operand has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2021-12-06 18:58:10,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:58:10,975 INFO L93 Difference]: Finished difference Result 5660 states and 6992 transitions. [2021-12-06 18:58:10,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 18:58:10,976 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 366 [2021-12-06 18:58:10,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:58:10,980 INFO L225 Difference]: With dead ends: 5660 [2021-12-06 18:58:10,980 INFO L226 Difference]: Without dead ends: 2595 [2021-12-06 18:58:10,983 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 428 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-06 18:58:10,984 INFO L933 BasicCegarLoop]: 235 mSDtfsCounter, 28 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 18:58:10,984 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 667 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 18:58:10,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2595 states. [2021-12-06 18:58:11,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2595 to 2595. [2021-12-06 18:58:11,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2595 states, 2192 states have (on average 1.2208029197080292) internal successors, (2676), 2210 states have internal predecessors, (2676), 270 states have call successors, (270), 132 states have call predecessors, (270), 132 states have return successors, (270), 252 states have call predecessors, (270), 270 states have call successors, (270) [2021-12-06 18:58:11,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2595 states to 2595 states and 3216 transitions. [2021-12-06 18:58:11,219 INFO L78 Accepts]: Start accepts. Automaton has 2595 states and 3216 transitions. Word has length 366 [2021-12-06 18:58:11,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:58:11,219 INFO L470 AbstractCegarLoop]: Abstraction has 2595 states and 3216 transitions. [2021-12-06 18:58:11,219 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2021-12-06 18:58:11,219 INFO L276 IsEmpty]: Start isEmpty. Operand 2595 states and 3216 transitions. [2021-12-06 18:58:11,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2021-12-06 18:58:11,223 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:58:11,224 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 12, 12, 9, 8, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 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:58:11,244 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2021-12-06 18:58:11,424 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2021-12-06 18:58:11,424 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:58:11,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:58:11,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1162142773, now seen corresponding path program 1 times [2021-12-06 18:58:11,425 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:58:11,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381607012] [2021-12-06 18:58:11,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:58:11,425 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:58:11,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:11,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:58:11,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:11,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:58:11,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:11,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:58:11,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:11,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:58:11,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:11,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:58:11,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:11,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:58:11,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:11,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:58:11,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:11,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:58:11,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:11,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:58:11,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:11,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:58:11,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:11,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:58:11,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:11,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:58:11,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:11,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:58:11,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:11,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:58:11,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:11,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:58:11,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:11,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:58:11,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:11,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-06 18:58:11,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:11,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-12-06 18:58:11,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:11,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-12-06 18:58:11,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:11,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2021-12-06 18:58:11,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:11,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2021-12-06 18:58:11,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:11,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2021-12-06 18:58:11,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:11,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2021-12-06 18:58:11,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:11,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2021-12-06 18:58:11,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:11,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2021-12-06 18:58:11,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:11,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 294 [2021-12-06 18:58:11,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:11,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 304 [2021-12-06 18:58:11,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:11,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 323 [2021-12-06 18:58:11,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:11,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 332 [2021-12-06 18:58:11,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:11,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 342 [2021-12-06 18:58:11,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:11,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 351 [2021-12-06 18:58:11,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:11,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 359 [2021-12-06 18:58:11,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:11,622 INFO L134 CoverageAnalysis]: Checked inductivity of 999 backedges. 19 proven. 14 refuted. 0 times theorem prover too weak. 966 trivial. 0 not checked. [2021-12-06 18:58:11,622 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:58:11,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381607012] [2021-12-06 18:58:11,622 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381607012] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 18:58:11,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653475345] [2021-12-06 18:58:11,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:58:11,622 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:58:11,622 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 18:58:11,623 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 18:58:11,623 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-12-06 18:58:11,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:11,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 1334 conjuncts, 64 conjunts are in the unsatisfiable core [2021-12-06 18:58:11,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 18:58:12,684 INFO L134 CoverageAnalysis]: Checked inductivity of 999 backedges. 477 proven. 210 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2021-12-06 18:58:12,685 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 18:58:13,714 INFO L134 CoverageAnalysis]: Checked inductivity of 999 backedges. 107 proven. 194 refuted. 0 times theorem prover too weak. 698 trivial. 0 not checked. [2021-12-06 18:58:13,714 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [653475345] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 18:58:13,714 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 18:58:13,715 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 26, 21] total 52 [2021-12-06 18:58:13,715 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394774955] [2021-12-06 18:58:13,715 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 18:58:13,716 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2021-12-06 18:58:13,716 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:58:13,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2021-12-06 18:58:13,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=2446, Unknown=0, NotChecked=0, Total=2652 [2021-12-06 18:58:13,716 INFO L87 Difference]: Start difference. First operand 2595 states and 3216 transitions. Second operand has 52 states, 52 states have (on average 7.365384615384615) internal successors, (383), 45 states have internal predecessors, (383), 17 states have call successors, (64), 13 states have call predecessors, (64), 18 states have return successors, (67), 21 states have call predecessors, (67), 17 states have call successors, (67) [2021-12-06 18:58:27,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:58:27,642 INFO L93 Difference]: Finished difference Result 14557 states and 19073 transitions. [2021-12-06 18:58:27,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2021-12-06 18:58:27,643 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 7.365384615384615) internal successors, (383), 45 states have internal predecessors, (383), 17 states have call successors, (64), 13 states have call predecessors, (64), 18 states have return successors, (67), 21 states have call predecessors, (67), 17 states have call successors, (67) Word has length 373 [2021-12-06 18:58:27,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:58:27,660 INFO L225 Difference]: With dead ends: 14557 [2021-12-06 18:58:27,660 INFO L226 Difference]: Without dead ends: 12470 [2021-12-06 18:58:27,667 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 993 GetRequests, 787 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13942 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=3489, Invalid=39567, Unknown=0, NotChecked=0, Total=43056 [2021-12-06 18:58:27,667 INFO L933 BasicCegarLoop]: 1030 mSDtfsCounter, 3123 mSDsluCounter, 19275 mSDsCounter, 0 mSdLazyCounter, 18365 mSolverCounterSat, 1577 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3137 SdHoareTripleChecker+Valid, 20305 SdHoareTripleChecker+Invalid, 19942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1577 IncrementalHoareTripleChecker+Valid, 18365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2021-12-06 18:58:27,667 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3137 Valid, 20305 Invalid, 19942 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1577 Valid, 18365 Invalid, 0 Unknown, 0 Unchecked, 7.5s Time] [2021-12-06 18:58:27,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12470 states. [2021-12-06 18:58:28,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12470 to 3840. [2021-12-06 18:58:28,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3840 states, 3242 states have (on average 1.228871067242443) internal successors, (3984), 3269 states have internal predecessors, (3984), 400 states have call successors, (400), 197 states have call predecessors, (400), 197 states have return successors, (400), 373 states have call predecessors, (400), 400 states have call successors, (400) [2021-12-06 18:58:28,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3840 states to 3840 states and 4784 transitions. [2021-12-06 18:58:28,073 INFO L78 Accepts]: Start accepts. Automaton has 3840 states and 4784 transitions. Word has length 373 [2021-12-06 18:58:28,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:58:28,073 INFO L470 AbstractCegarLoop]: Abstraction has 3840 states and 4784 transitions. [2021-12-06 18:58:28,074 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 7.365384615384615) internal successors, (383), 45 states have internal predecessors, (383), 17 states have call successors, (64), 13 states have call predecessors, (64), 18 states have return successors, (67), 21 states have call predecessors, (67), 17 states have call successors, (67) [2021-12-06 18:58:28,074 INFO L276 IsEmpty]: Start isEmpty. Operand 3840 states and 4784 transitions. [2021-12-06 18:58:28,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2021-12-06 18:58:28,080 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:58:28,080 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 9, 9, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1] [2021-12-06 18:58:28,114 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-12-06 18:58:28,281 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2021-12-06 18:58:28,281 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:58:28,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:58:28,281 INFO L85 PathProgramCache]: Analyzing trace with hash 484959168, now seen corresponding path program 1 times [2021-12-06 18:58:28,281 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:58:28,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91637624] [2021-12-06 18:58:28,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:58:28,282 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:58:28,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:28,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:58:28,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:28,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:58:28,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:28,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:58:28,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:28,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:58:28,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:28,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:58:28,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:28,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:58:28,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:28,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:58:28,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:28,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:58:28,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:28,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:58:28,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:28,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:58:28,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:28,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:58:28,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:28,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:58:28,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:28,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:58:28,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:28,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:58:28,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:28,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:58:28,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:28,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:58:28,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:28,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-06 18:58:28,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:28,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-12-06 18:58:28,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:28,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-12-06 18:58:28,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:28,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2021-12-06 18:58:28,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:28,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2021-12-06 18:58:28,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:28,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2021-12-06 18:58:28,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:28,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2021-12-06 18:58:28,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:28,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2021-12-06 18:58:28,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:28,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2021-12-06 18:58:28,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:28,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 294 [2021-12-06 18:58:28,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:28,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2021-12-06 18:58:28,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:28,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-12-06 18:58:28,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:28,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 334 [2021-12-06 18:58:28,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:28,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 343 [2021-12-06 18:58:28,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:28,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 353 [2021-12-06 18:58:28,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:28,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2021-12-06 18:58:28,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:28,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 370 [2021-12-06 18:58:28,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:28,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1069 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1061 trivial. 0 not checked. [2021-12-06 18:58:28,394 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:58:28,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91637624] [2021-12-06 18:58:28,394 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91637624] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:58:28,394 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:58:28,395 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 18:58:28,395 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379544136] [2021-12-06 18:58:28,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:58:28,395 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 18:58:28,395 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:58:28,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 18:58:28,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-06 18:58:28,395 INFO L87 Difference]: Start difference. First operand 3840 states and 4784 transitions. Second operand has 6 states, 6 states have (on average 20.5) internal successors, (123), 5 states have internal predecessors, (123), 4 states have call successors, (22), 3 states have call predecessors, (22), 1 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21) [2021-12-06 18:58:28,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:58:28,916 INFO L93 Difference]: Finished difference Result 7235 states and 9060 transitions. [2021-12-06 18:58:28,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 18:58:28,917 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 5 states have internal predecessors, (123), 4 states have call successors, (22), 3 states have call predecessors, (22), 1 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21) Word has length 384 [2021-12-06 18:58:28,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:58:28,923 INFO L225 Difference]: With dead ends: 7235 [2021-12-06 18:58:28,923 INFO L226 Difference]: Without dead ends: 3852 [2021-12-06 18:58:28,928 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-06 18:58:28,928 INFO L933 BasicCegarLoop]: 224 mSDtfsCounter, 377 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 18:58:28,928 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [393 Valid, 456 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 18:58:28,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3852 states. [2021-12-06 18:58:29,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3852 to 3848. [2021-12-06 18:58:29,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3848 states, 3250 states have (on average 1.2258461538461538) internal successors, (3984), 3277 states have internal predecessors, (3984), 400 states have call successors, (400), 197 states have call predecessors, (400), 197 states have return successors, (400), 373 states have call predecessors, (400), 400 states have call successors, (400) [2021-12-06 18:58:29,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3848 states to 3848 states and 4784 transitions. [2021-12-06 18:58:29,348 INFO L78 Accepts]: Start accepts. Automaton has 3848 states and 4784 transitions. Word has length 384 [2021-12-06 18:58:29,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:58:29,349 INFO L470 AbstractCegarLoop]: Abstraction has 3848 states and 4784 transitions. [2021-12-06 18:58:29,349 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 5 states have internal predecessors, (123), 4 states have call successors, (22), 3 states have call predecessors, (22), 1 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21) [2021-12-06 18:58:29,349 INFO L276 IsEmpty]: Start isEmpty. Operand 3848 states and 4784 transitions. [2021-12-06 18:58:29,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2021-12-06 18:58:29,358 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:58:29,359 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 9, 9, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 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] [2021-12-06 18:58:29,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-12-06 18:58:29,359 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:58:29,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:58:29,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1525741157, now seen corresponding path program 1 times [2021-12-06 18:58:29,360 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:58:29,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895800872] [2021-12-06 18:58:29,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:58:29,360 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:58:29,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:29,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:58:29,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:29,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:58:29,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:29,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:58:29,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:29,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:58:29,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:29,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:58:29,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:29,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:58:29,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:29,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:58:29,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:29,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:58:29,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:29,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:58:29,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:29,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:58:29,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:29,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:58:29,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:29,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:58:29,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:29,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:58:29,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:29,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:58:29,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:29,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:58:29,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:29,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:58:29,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:29,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-06 18:58:29,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:29,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2021-12-06 18:58:29,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:29,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-12-06 18:58:29,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:29,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2021-12-06 18:58:29,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:29,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2021-12-06 18:58:29,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:29,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2021-12-06 18:58:29,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:29,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2021-12-06 18:58:29,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:29,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2021-12-06 18:58:29,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:29,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 288 [2021-12-06 18:58:29,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:29,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 295 [2021-12-06 18:58:29,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:29,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 306 [2021-12-06 18:58:29,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:29,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 316 [2021-12-06 18:58:29,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:29,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 335 [2021-12-06 18:58:29,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:29,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 344 [2021-12-06 18:58:29,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:29,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 354 [2021-12-06 18:58:29,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:29,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 363 [2021-12-06 18:58:29,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:29,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 371 [2021-12-06 18:58:29,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:29,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1075 backedges. 19 proven. 20 refuted. 0 times theorem prover too weak. 1036 trivial. 0 not checked. [2021-12-06 18:58:29,519 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:58:29,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895800872] [2021-12-06 18:58:29,519 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895800872] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 18:58:29,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138882316] [2021-12-06 18:58:29,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:58:29,519 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:58:29,519 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 18:58:29,520 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 18:58:29,522 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-12-06 18:58:29,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:29,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 1361 conjuncts, 62 conjunts are in the unsatisfiable core [2021-12-06 18:58:29,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 18:58:30,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1075 backedges. 552 proven. 221 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2021-12-06 18:58:30,472 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 18:58:31,285 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger: modulus not positive [2021-12-06 18:58:31,285 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-06 18:58:31,285 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2021-12-06 18:58:31,285 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914882793] [2021-12-06 18:58:31,285 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-06 18:58:31,286 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 18:58:31,286 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:58:31,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 18:58:31,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1811, Unknown=0, NotChecked=0, Total=1980 [2021-12-06 18:58:31,287 INFO L87 Difference]: Start difference. First operand 3848 states and 4784 transitions. Second operand has 9 states, 9 states have (on average 15.666666666666666) internal successors, (141), 8 states have internal predecessors, (141), 5 states have call successors, (26), 3 states have call predecessors, (26), 1 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) [2021-12-06 18:58:33,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:58:33,391 INFO L93 Difference]: Finished difference Result 11324 states and 14284 transitions. [2021-12-06 18:58:33,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-12-06 18:58:33,392 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 15.666666666666666) internal successors, (141), 8 states have internal predecessors, (141), 5 states have call successors, (26), 3 states have call predecessors, (26), 1 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) Word has length 385 [2021-12-06 18:58:33,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:58:33,402 INFO L225 Difference]: With dead ends: 11324 [2021-12-06 18:58:33,402 INFO L226 Difference]: Without dead ends: 8163 [2021-12-06 18:58:33,406 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 778 GetRequests, 709 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 909 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=438, Invalid=4532, Unknown=0, NotChecked=0, Total=4970 [2021-12-06 18:58:33,406 INFO L933 BasicCegarLoop]: 623 mSDtfsCounter, 829 mSDsluCounter, 1854 mSDsCounter, 0 mSdLazyCounter, 1784 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 845 SdHoareTripleChecker+Valid, 2477 SdHoareTripleChecker+Invalid, 2024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 1784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-12-06 18:58:33,406 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [845 Valid, 2477 Invalid, 2024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 1784 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-12-06 18:58:33,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8163 states. [2021-12-06 18:58:33,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8163 to 3840. [2021-12-06 18:58:33,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3840 states, 3242 states have (on average 1.2264034546576188) internal successors, (3976), 3269 states have internal predecessors, (3976), 400 states have call successors, (400), 197 states have call predecessors, (400), 197 states have return successors, (400), 373 states have call predecessors, (400), 400 states have call successors, (400) [2021-12-06 18:58:33,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3840 states to 3840 states and 4776 transitions. [2021-12-06 18:58:33,813 INFO L78 Accepts]: Start accepts. Automaton has 3840 states and 4776 transitions. Word has length 385 [2021-12-06 18:58:33,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:58:33,813 INFO L470 AbstractCegarLoop]: Abstraction has 3840 states and 4776 transitions. [2021-12-06 18:58:33,813 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.666666666666666) internal successors, (141), 8 states have internal predecessors, (141), 5 states have call successors, (26), 3 states have call predecessors, (26), 1 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) [2021-12-06 18:58:33,813 INFO L276 IsEmpty]: Start isEmpty. Operand 3840 states and 4776 transitions. [2021-12-06 18:58:33,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2021-12-06 18:58:33,819 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:58:33,819 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 9, 9, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 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] [2021-12-06 18:58:33,839 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2021-12-06 18:58:34,020 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2021-12-06 18:58:34,021 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:58:34,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:58:34,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1998080803, now seen corresponding path program 1 times [2021-12-06 18:58:34,023 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:58:34,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508794827] [2021-12-06 18:58:34,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:58:34,024 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:58:34,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:34,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:58:34,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:34,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:58:34,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:34,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:58:34,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:34,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:58:34,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:34,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:58:34,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:34,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:58:34,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:34,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:58:34,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:34,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:58:34,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:34,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:58:34,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:34,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:58:34,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:34,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:58:34,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:34,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:58:34,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:34,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:58:34,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:34,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:58:34,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:34,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:58:34,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:34,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:58:34,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:34,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-06 18:58:34,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:34,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2021-12-06 18:58:34,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:34,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-12-06 18:58:34,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:34,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2021-12-06 18:58:34,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:34,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2021-12-06 18:58:34,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:34,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2021-12-06 18:58:34,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:34,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2021-12-06 18:58:34,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:34,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2021-12-06 18:58:34,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:34,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 288 [2021-12-06 18:58:34,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:34,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 295 [2021-12-06 18:58:34,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:34,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 306 [2021-12-06 18:58:34,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:34,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 316 [2021-12-06 18:58:34,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:34,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 335 [2021-12-06 18:58:34,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:34,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 344 [2021-12-06 18:58:34,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:34,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 354 [2021-12-06 18:58:34,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:34,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 363 [2021-12-06 18:58:34,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:34,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 371 [2021-12-06 18:58:34,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:34,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1075 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1068 trivial. 0 not checked. [2021-12-06 18:58:34,160 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:58:34,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508794827] [2021-12-06 18:58:34,160 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508794827] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:58:34,160 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:58:34,161 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 18:58:34,161 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241068019] [2021-12-06 18:58:34,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:58:34,161 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 18:58:34,161 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:58:34,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 18:58:34,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 18:58:34,161 INFO L87 Difference]: Start difference. First operand 3840 states and 4776 transitions. Second operand has 4 states, 4 states have (on average 29.25) internal successors, (117), 3 states have internal predecessors, (117), 2 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2021-12-06 18:58:34,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:58:34,566 INFO L93 Difference]: Finished difference Result 6636 states and 8283 transitions. [2021-12-06 18:58:34,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 18:58:34,566 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 3 states have internal predecessors, (117), 2 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 385 [2021-12-06 18:58:34,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:58:34,571 INFO L225 Difference]: With dead ends: 6636 [2021-12-06 18:58:34,571 INFO L226 Difference]: Without dead ends: 3230 [2021-12-06 18:58:34,575 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 18:58:34,576 INFO L933 BasicCegarLoop]: 233 mSDtfsCounter, 51 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 18:58:34,576 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 557 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 18:58:34,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3230 states. [2021-12-06 18:58:34,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3230 to 3230. [2021-12-06 18:58:34,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3230 states, 2664 states have (on average 1.2113363363363363) internal successors, (3227), 2691 states have internal predecessors, (3227), 384 states have call successors, (384), 181 states have call predecessors, (384), 181 states have return successors, (384), 357 states have call predecessors, (384), 384 states have call successors, (384) [2021-12-06 18:58:34,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3230 states to 3230 states and 3995 transitions. [2021-12-06 18:58:34,907 INFO L78 Accepts]: Start accepts. Automaton has 3230 states and 3995 transitions. Word has length 385 [2021-12-06 18:58:34,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:58:34,908 INFO L470 AbstractCegarLoop]: Abstraction has 3230 states and 3995 transitions. [2021-12-06 18:58:34,908 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 3 states have internal predecessors, (117), 2 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2021-12-06 18:58:34,908 INFO L276 IsEmpty]: Start isEmpty. Operand 3230 states and 3995 transitions. [2021-12-06 18:58:34,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2021-12-06 18:58:34,913 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:58:34,914 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 9, 9, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1] [2021-12-06 18:58:34,914 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-12-06 18:58:34,914 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:58:34,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:58:34,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1582790027, now seen corresponding path program 1 times [2021-12-06 18:58:34,914 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:58:34,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509009311] [2021-12-06 18:58:34,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:58:34,915 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:58:34,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:35,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:58:35,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:35,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:58:35,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:35,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:58:35,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:35,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:58:35,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:35,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:58:35,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:35,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:58:35,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:35,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:58:35,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:35,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:58:35,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:35,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:58:35,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:35,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:58:35,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:35,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:58:35,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:35,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:58:35,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:35,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:58:35,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:35,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:58:35,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:35,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:58:35,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:35,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:58:35,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:35,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-06 18:58:35,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:35,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-12-06 18:58:35,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:35,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2021-12-06 18:58:35,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:35,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2021-12-06 18:58:35,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:35,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2021-12-06 18:58:35,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:35,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2021-12-06 18:58:35,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:35,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2021-12-06 18:58:35,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:35,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2021-12-06 18:58:35,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:35,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 288 [2021-12-06 18:58:35,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:35,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 295 [2021-12-06 18:58:35,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:35,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 306 [2021-12-06 18:58:35,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:35,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 316 [2021-12-06 18:58:35,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:35,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 335 [2021-12-06 18:58:35,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:35,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 344 [2021-12-06 18:58:35,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:35,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 354 [2021-12-06 18:58:35,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:35,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 363 [2021-12-06 18:58:35,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:35,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 371 [2021-12-06 18:58:35,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:35,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1069 backedges. 16 proven. 29 refuted. 0 times theorem prover too weak. 1024 trivial. 0 not checked. [2021-12-06 18:58:35,142 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:58:35,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509009311] [2021-12-06 18:58:35,142 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509009311] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 18:58:35,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868735701] [2021-12-06 18:58:35,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:58:35,142 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:58:35,142 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 18:58:35,143 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 18:58:35,143 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-12-06 18:58:35,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:35,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 1361 conjuncts, 62 conjunts are in the unsatisfiable core [2021-12-06 18:58:35,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 18:58:36,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1069 backedges. 546 proven. 221 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2021-12-06 18:58:36,154 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 18:58:37,003 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger: modulus not positive [2021-12-06 18:58:37,004 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-06 18:58:37,004 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2021-12-06 18:58:37,004 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893406738] [2021-12-06 18:58:37,004 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-06 18:58:37,004 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-06 18:58:37,004 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:58:37,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-06 18:58:37,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=2569, Unknown=0, NotChecked=0, Total=2756 [2021-12-06 18:58:37,005 INFO L87 Difference]: Start difference. First operand 3230 states and 3995 transitions. Second operand has 17 states, 17 states have (on average 8.411764705882353) internal successors, (143), 15 states have internal predecessors, (143), 6 states have call successors, (26), 3 states have call predecessors, (26), 2 states have return successors, (25), 7 states have call predecessors, (25), 6 states have call successors, (25) [2021-12-06 18:58:45,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:58:45,349 INFO L93 Difference]: Finished difference Result 21669 states and 28751 transitions. [2021-12-06 18:58:45,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2021-12-06 18:58:45,350 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 8.411764705882353) internal successors, (143), 15 states have internal predecessors, (143), 6 states have call successors, (26), 3 states have call predecessors, (26), 2 states have return successors, (25), 7 states have call predecessors, (25), 6 states have call successors, (25) Word has length 385 [2021-12-06 18:58:45,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:58:45,376 INFO L225 Difference]: With dead ends: 21669 [2021-12-06 18:58:45,376 INFO L226 Difference]: Without dead ends: 19003 [2021-12-06 18:58:45,381 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 860 GetRequests, 706 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6239 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=2313, Invalid=21867, Unknown=0, NotChecked=0, Total=24180 [2021-12-06 18:58:45,382 INFO L933 BasicCegarLoop]: 903 mSDtfsCounter, 1667 mSDsluCounter, 6647 mSDsCounter, 0 mSdLazyCounter, 7515 mSolverCounterSat, 1258 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1683 SdHoareTripleChecker+Valid, 7550 SdHoareTripleChecker+Invalid, 8773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1258 IncrementalHoareTripleChecker+Valid, 7515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2021-12-06 18:58:45,382 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1683 Valid, 7550 Invalid, 8773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1258 Valid, 7515 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2021-12-06 18:58:45,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19003 states. [2021-12-06 18:58:45,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19003 to 4600. [2021-12-06 18:58:45,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4600 states, 3780 states have (on average 1.2161375661375662) internal successors, (4597), 3820 states have internal predecessors, (4597), 564 states have call successors, (564), 255 states have call predecessors, (564), 255 states have return successors, (564), 524 states have call predecessors, (564), 564 states have call successors, (564) [2021-12-06 18:58:45,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4600 states to 4600 states and 5725 transitions. [2021-12-06 18:58:45,969 INFO L78 Accepts]: Start accepts. Automaton has 4600 states and 5725 transitions. Word has length 385 [2021-12-06 18:58:45,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:58:45,970 INFO L470 AbstractCegarLoop]: Abstraction has 4600 states and 5725 transitions. [2021-12-06 18:58:45,970 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 8.411764705882353) internal successors, (143), 15 states have internal predecessors, (143), 6 states have call successors, (26), 3 states have call predecessors, (26), 2 states have return successors, (25), 7 states have call predecessors, (25), 6 states have call successors, (25) [2021-12-06 18:58:45,970 INFO L276 IsEmpty]: Start isEmpty. Operand 4600 states and 5725 transitions. [2021-12-06 18:58:45,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2021-12-06 18:58:45,977 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:58:45,977 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 9, 9, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1] [2021-12-06 18:58:45,997 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2021-12-06 18:58:46,178 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2021-12-06 18:58:46,179 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:58:46,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:58:46,180 INFO L85 PathProgramCache]: Analyzing trace with hash -2044795379, now seen corresponding path program 1 times [2021-12-06 18:58:46,181 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:58:46,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849252326] [2021-12-06 18:58:46,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:58:46,182 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:58:46,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:46,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:58:46,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:46,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:58:46,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:46,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:58:46,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:46,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:58:46,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:46,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:58:46,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:46,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:58:46,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:46,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:58:46,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:46,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:58:46,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:46,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:58:46,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:46,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:58:46,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:46,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:58:46,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:46,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:58:46,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:46,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:58:46,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:46,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:58:46,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:46,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:58:46,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:46,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:58:46,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:46,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-06 18:58:46,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:46,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-12-06 18:58:46,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:46,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2021-12-06 18:58:46,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:46,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2021-12-06 18:58:46,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:46,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2021-12-06 18:58:46,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:46,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2021-12-06 18:58:46,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:46,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2021-12-06 18:58:46,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:46,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2021-12-06 18:58:46,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:46,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 288 [2021-12-06 18:58:46,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:46,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 295 [2021-12-06 18:58:46,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:46,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 306 [2021-12-06 18:58:46,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:46,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 316 [2021-12-06 18:58:46,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:46,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 335 [2021-12-06 18:58:46,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:46,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 344 [2021-12-06 18:58:46,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:46,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 354 [2021-12-06 18:58:46,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:46,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 363 [2021-12-06 18:58:46,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:46,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 371 [2021-12-06 18:58:46,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:46,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1069 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2021-12-06 18:58:46,302 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:58:46,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849252326] [2021-12-06 18:58:46,302 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849252326] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:58:46,302 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:58:46,303 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 18:58:46,303 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710983801] [2021-12-06 18:58:46,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:58:46,303 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 18:58:46,303 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:58:46,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 18:58:46,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-06 18:58:46,304 INFO L87 Difference]: Start difference. First operand 4600 states and 5725 transitions. Second operand has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 5 states have internal predecessors, (128), 4 states have call successors, (23), 3 states have call predecessors, (23), 1 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2021-12-06 18:58:46,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:58:46,992 INFO L93 Difference]: Finished difference Result 8859 states and 11077 transitions. [2021-12-06 18:58:46,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 18:58:46,992 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 5 states have internal predecessors, (128), 4 states have call successors, (23), 3 states have call predecessors, (23), 1 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) Word has length 385 [2021-12-06 18:58:46,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:58:46,999 INFO L225 Difference]: With dead ends: 8859 [2021-12-06 18:58:46,999 INFO L226 Difference]: Without dead ends: 4675 [2021-12-06 18:58:47,003 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-12-06 18:58:47,004 INFO L933 BasicCegarLoop]: 223 mSDtfsCounter, 379 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 18:58:47,004 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [395 Valid, 468 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 18:58:47,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4675 states. [2021-12-06 18:58:47,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4675 to 4650. [2021-12-06 18:58:47,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4650 states, 3830 states have (on average 1.2107049608355092) internal successors, (4637), 3870 states have internal predecessors, (4637), 564 states have call successors, (564), 255 states have call predecessors, (564), 255 states have return successors, (564), 524 states have call predecessors, (564), 564 states have call successors, (564) [2021-12-06 18:58:47,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4650 states to 4650 states and 5765 transitions. [2021-12-06 18:58:47,503 INFO L78 Accepts]: Start accepts. Automaton has 4650 states and 5765 transitions. Word has length 385 [2021-12-06 18:58:47,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:58:47,503 INFO L470 AbstractCegarLoop]: Abstraction has 4650 states and 5765 transitions. [2021-12-06 18:58:47,504 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 5 states have internal predecessors, (128), 4 states have call successors, (23), 3 states have call predecessors, (23), 1 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2021-12-06 18:58:47,504 INFO L276 IsEmpty]: Start isEmpty. Operand 4650 states and 5765 transitions. [2021-12-06 18:58:47,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2021-12-06 18:58:47,509 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:58:47,509 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 9, 9, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1] [2021-12-06 18:58:47,509 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-12-06 18:58:47,509 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:58:47,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:58:47,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1638142338, now seen corresponding path program 1 times [2021-12-06 18:58:47,510 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:58:47,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413761493] [2021-12-06 18:58:47,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:58:47,510 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:58:47,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:47,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:58:47,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:47,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:58:47,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:47,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:58:47,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:47,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:58:47,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:47,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:58:47,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:47,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:58:47,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:47,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:58:47,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:47,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:58:47,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:47,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:58:47,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:47,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:58:47,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:47,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:58:47,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:47,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:58:47,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:47,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:58:47,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:47,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:58:47,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:47,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:58:47,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:47,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:58:47,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:47,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-06 18:58:47,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:47,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-12-06 18:58:47,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:47,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2021-12-06 18:58:47,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:47,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2021-12-06 18:58:47,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:47,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2021-12-06 18:58:47,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:47,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2021-12-06 18:58:47,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:47,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2021-12-06 18:58:47,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:47,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2021-12-06 18:58:47,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:47,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 288 [2021-12-06 18:58:47,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:47,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 295 [2021-12-06 18:58:47,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:47,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 306 [2021-12-06 18:58:47,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:47,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 316 [2021-12-06 18:58:47,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:47,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 335 [2021-12-06 18:58:47,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:47,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 344 [2021-12-06 18:58:47,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:47,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 354 [2021-12-06 18:58:47,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:47,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 363 [2021-12-06 18:58:47,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:47,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 371 [2021-12-06 18:58:47,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:47,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1069 backedges. 19 proven. 14 refuted. 0 times theorem prover too weak. 1036 trivial. 0 not checked. [2021-12-06 18:58:47,696 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:58:47,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413761493] [2021-12-06 18:58:47,696 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413761493] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 18:58:47,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [337903416] [2021-12-06 18:58:47,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:58:47,697 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:58:47,697 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 18:58:47,697 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 18:58:47,698 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-12-06 18:58:47,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:47,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 1361 conjuncts, 62 conjunts are in the unsatisfiable core [2021-12-06 18:58:47,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 18:58:48,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1069 backedges. 546 proven. 221 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2021-12-06 18:58:48,661 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 18:58:49,404 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger: modulus not positive [2021-12-06 18:58:49,404 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-06 18:58:49,404 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2021-12-06 18:58:49,404 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565075250] [2021-12-06 18:58:49,404 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-06 18:58:49,405 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-06 18:58:49,405 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:58:49,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-06 18:58:49,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=2078, Unknown=0, NotChecked=0, Total=2256 [2021-12-06 18:58:49,405 INFO L87 Difference]: Start difference. First operand 4650 states and 5765 transitions. Second operand has 12 states, 12 states have (on average 11.75) internal successors, (141), 11 states have internal predecessors, (141), 6 states have call successors, (26), 3 states have call predecessors, (26), 1 states have return successors, (25), 6 states have call predecessors, (25), 6 states have call successors, (25) [2021-12-06 18:58:53,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:58:53,742 INFO L93 Difference]: Finished difference Result 18727 states and 23880 transitions. [2021-12-06 18:58:53,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-12-06 18:58:53,743 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 11.75) internal successors, (141), 11 states have internal predecessors, (141), 6 states have call successors, (26), 3 states have call predecessors, (26), 1 states have return successors, (25), 6 states have call predecessors, (25), 6 states have call successors, (25) Word has length 385 [2021-12-06 18:58:53,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:58:53,763 INFO L225 Difference]: With dead ends: 18727 [2021-12-06 18:58:53,763 INFO L226 Difference]: Without dead ends: 14736 [2021-12-06 18:58:53,768 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 802 GetRequests, 715 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1596 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=789, Invalid=7043, Unknown=0, NotChecked=0, Total=7832 [2021-12-06 18:58:53,768 INFO L933 BasicCegarLoop]: 762 mSDtfsCounter, 1371 mSDsluCounter, 2771 mSDsCounter, 0 mSdLazyCounter, 3003 mSolverCounterSat, 913 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1387 SdHoareTripleChecker+Valid, 3533 SdHoareTripleChecker+Invalid, 3916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 913 IncrementalHoareTripleChecker+Valid, 3003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-12-06 18:58:53,768 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1387 Valid, 3533 Invalid, 3916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [913 Valid, 3003 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-12-06 18:58:53,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14736 states. [2021-12-06 18:58:54,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14736 to 4660. [2021-12-06 18:58:54,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4660 states, 3840 states have (on average 1.2114583333333333) internal successors, (4652), 3880 states have internal predecessors, (4652), 564 states have call successors, (564), 255 states have call predecessors, (564), 255 states have return successors, (564), 524 states have call predecessors, (564), 564 states have call successors, (564) [2021-12-06 18:58:54,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4660 states to 4660 states and 5780 transitions. [2021-12-06 18:58:54,403 INFO L78 Accepts]: Start accepts. Automaton has 4660 states and 5780 transitions. Word has length 385 [2021-12-06 18:58:54,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:58:54,404 INFO L470 AbstractCegarLoop]: Abstraction has 4660 states and 5780 transitions. [2021-12-06 18:58:54,404 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.75) internal successors, (141), 11 states have internal predecessors, (141), 6 states have call successors, (26), 3 states have call predecessors, (26), 1 states have return successors, (25), 6 states have call predecessors, (25), 6 states have call successors, (25) [2021-12-06 18:58:54,404 INFO L276 IsEmpty]: Start isEmpty. Operand 4660 states and 5780 transitions. [2021-12-06 18:58:54,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2021-12-06 18:58:54,411 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:58:54,411 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 9, 9, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1] [2021-12-06 18:58:54,431 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2021-12-06 18:58:54,612 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2021-12-06 18:58:54,613 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:58:54,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:58:54,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1728202628, now seen corresponding path program 1 times [2021-12-06 18:58:54,615 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:58:54,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994759618] [2021-12-06 18:58:54,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:58:54,616 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:58:54,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:54,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:58:54,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:54,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:58:54,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:54,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:58:54,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:54,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:58:54,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:54,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:58:54,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:54,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:58:54,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:54,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:58:54,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:54,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:58:54,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:54,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:58:54,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:54,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:58:54,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:54,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:58:54,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:54,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:58:54,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:54,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:58:54,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:54,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:58:54,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:54,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:58:54,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:54,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:58:54,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:54,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-06 18:58:54,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:54,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-12-06 18:58:54,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:54,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2021-12-06 18:58:54,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:54,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2021-12-06 18:58:54,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:54,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2021-12-06 18:58:54,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:54,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2021-12-06 18:58:54,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:54,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2021-12-06 18:58:54,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:54,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2021-12-06 18:58:54,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:54,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 288 [2021-12-06 18:58:54,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:54,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 295 [2021-12-06 18:58:54,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:54,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 306 [2021-12-06 18:58:54,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:54,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 316 [2021-12-06 18:58:54,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:54,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 335 [2021-12-06 18:58:54,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:54,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 344 [2021-12-06 18:58:54,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:54,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 354 [2021-12-06 18:58:54,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:54,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 363 [2021-12-06 18:58:54,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:54,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 371 [2021-12-06 18:58:54,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:54,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1069 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1061 trivial. 0 not checked. [2021-12-06 18:58:54,783 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:58:54,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994759618] [2021-12-06 18:58:54,783 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994759618] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:58:54,783 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:58:54,783 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 18:58:54,783 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83572247] [2021-12-06 18:58:54,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:58:54,784 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 18:58:54,784 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:58:54,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 18:58:54,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-06 18:58:54,784 INFO L87 Difference]: Start difference. First operand 4660 states and 5780 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 4 states have call successors, (22), 3 states have call predecessors, (22), 1 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21) [2021-12-06 18:58:55,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:58:55,517 INFO L93 Difference]: Finished difference Result 8950 states and 11149 transitions. [2021-12-06 18:58:55,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 18:58:55,518 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 4 states have call successors, (22), 3 states have call predecessors, (22), 1 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21) Word has length 385 [2021-12-06 18:58:55,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:58:55,524 INFO L225 Difference]: With dead ends: 8950 [2021-12-06 18:58:55,524 INFO L226 Difference]: Without dead ends: 4680 [2021-12-06 18:58:55,527 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-06 18:58:55,527 INFO L933 BasicCegarLoop]: 225 mSDtfsCounter, 267 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 18:58:55,527 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [283 Valid, 489 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 18:58:55,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4680 states. [2021-12-06 18:58:56,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4680 to 4650. [2021-12-06 18:58:56,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4650 states, 3830 states have (on average 1.2107049608355092) internal successors, (4637), 3870 states have internal predecessors, (4637), 564 states have call successors, (564), 255 states have call predecessors, (564), 255 states have return successors, (564), 524 states have call predecessors, (564), 564 states have call successors, (564) [2021-12-06 18:58:56,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4650 states to 4650 states and 5765 transitions. [2021-12-06 18:58:56,057 INFO L78 Accepts]: Start accepts. Automaton has 4650 states and 5765 transitions. Word has length 385 [2021-12-06 18:58:56,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:58:56,057 INFO L470 AbstractCegarLoop]: Abstraction has 4650 states and 5765 transitions. [2021-12-06 18:58:56,057 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 4 states have call successors, (22), 3 states have call predecessors, (22), 1 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21) [2021-12-06 18:58:56,057 INFO L276 IsEmpty]: Start isEmpty. Operand 4650 states and 5765 transitions. [2021-12-06 18:58:56,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2021-12-06 18:58:56,062 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:58:56,062 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 9, 9, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:58:56,062 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-12-06 18:58:56,062 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:58:56,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:58:56,063 INFO L85 PathProgramCache]: Analyzing trace with hash -603829700, now seen corresponding path program 1 times [2021-12-06 18:58:56,063 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:58:56,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5679600] [2021-12-06 18:58:56,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:58:56,063 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:58:56,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:56,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:58:56,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:56,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:58:56,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:56,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:58:56,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:56,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:58:56,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:56,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:58:56,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:56,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:58:56,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:56,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:58:56,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:56,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:58:56,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:56,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:58:56,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:56,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:58:56,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:56,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:58:56,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:56,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:58:56,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:56,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:58:56,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:56,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:58:56,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:56,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:58:56,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:56,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:58:56,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:56,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-06 18:58:56,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:56,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-12-06 18:58:56,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:56,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-12-06 18:58:56,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:56,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2021-12-06 18:58:56,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:56,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2021-12-06 18:58:56,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:56,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2021-12-06 18:58:56,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:56,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2021-12-06 18:58:56,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:56,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2021-12-06 18:58:56,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:56,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2021-12-06 18:58:56,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:56,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 294 [2021-12-06 18:58:56,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:56,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2021-12-06 18:58:56,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:56,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-12-06 18:58:56,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:56,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 335 [2021-12-06 18:58:56,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:56,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 344 [2021-12-06 18:58:56,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:56,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 354 [2021-12-06 18:58:56,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:56,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 363 [2021-12-06 18:58:56,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:56,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 371 [2021-12-06 18:58:56,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:56,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1068 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 1037 trivial. 0 not checked. [2021-12-06 18:58:56,185 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:58:56,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5679600] [2021-12-06 18:58:56,186 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5679600] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:58:56,186 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:58:56,186 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-06 18:58:56,186 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579668193] [2021-12-06 18:58:56,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:58:56,186 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-06 18:58:56,186 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:58:56,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-06 18:58:56,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-12-06 18:58:56,187 INFO L87 Difference]: Start difference. First operand 4650 states and 5765 transitions. Second operand has 10 states, 10 states have (on average 13.6) internal successors, (136), 8 states have internal predecessors, (136), 3 states have call successors, (23), 3 states have call predecessors, (23), 2 states have return successors, (22), 4 states have call predecessors, (22), 3 states have call successors, (22) [2021-12-06 18:58:58,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:58:58,303 INFO L93 Difference]: Finished difference Result 13331 states and 17028 transitions. [2021-12-06 18:58:58,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-12-06 18:58:58,304 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.6) internal successors, (136), 8 states have internal predecessors, (136), 3 states have call successors, (23), 3 states have call predecessors, (23), 2 states have return successors, (22), 4 states have call predecessors, (22), 3 states have call successors, (22) Word has length 385 [2021-12-06 18:58:58,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:58:58,315 INFO L225 Difference]: With dead ends: 13331 [2021-12-06 18:58:58,315 INFO L226 Difference]: Without dead ends: 9340 [2021-12-06 18:58:58,319 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=221, Invalid=969, Unknown=0, NotChecked=0, Total=1190 [2021-12-06 18:58:58,319 INFO L933 BasicCegarLoop]: 567 mSDtfsCounter, 672 mSDsluCounter, 2478 mSDsCounter, 0 mSdLazyCounter, 1905 mSolverCounterSat, 239 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 684 SdHoareTripleChecker+Valid, 3045 SdHoareTripleChecker+Invalid, 2144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 239 IncrementalHoareTripleChecker+Valid, 1905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-06 18:58:58,319 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [684 Valid, 3045 Invalid, 2144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [239 Valid, 1905 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-06 18:58:58,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9340 states. [2021-12-06 18:58:58,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9340 to 4614. [2021-12-06 18:58:58,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4614 states, 3806 states have (on average 1.2078297425118234) internal successors, (4597), 3846 states have internal predecessors, (4597), 552 states have call successors, (552), 255 states have call predecessors, (552), 255 states have return successors, (552), 512 states have call predecessors, (552), 552 states have call successors, (552) [2021-12-06 18:58:58,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4614 states to 4614 states and 5701 transitions. [2021-12-06 18:58:58,890 INFO L78 Accepts]: Start accepts. Automaton has 4614 states and 5701 transitions. Word has length 385 [2021-12-06 18:58:58,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:58:58,891 INFO L470 AbstractCegarLoop]: Abstraction has 4614 states and 5701 transitions. [2021-12-06 18:58:58,891 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.6) internal successors, (136), 8 states have internal predecessors, (136), 3 states have call successors, (23), 3 states have call predecessors, (23), 2 states have return successors, (22), 4 states have call predecessors, (22), 3 states have call successors, (22) [2021-12-06 18:58:58,891 INFO L276 IsEmpty]: Start isEmpty. Operand 4614 states and 5701 transitions. [2021-12-06 18:58:58,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2021-12-06 18:58:58,896 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:58:58,896 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 9, 9, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:58:58,896 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2021-12-06 18:58:58,896 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:58:58,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:58:58,896 INFO L85 PathProgramCache]: Analyzing trace with hash -145166429, now seen corresponding path program 1 times [2021-12-06 18:58:58,896 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:58:58,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333185858] [2021-12-06 18:58:58,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:58:58,897 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:58:58,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:59,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:58:59,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:59,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:58:59,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:59,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:58:59,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:59,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:58:59,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:59,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:58:59,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:59,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:58:59,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:59,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:58:59,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:59,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:58:59,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:59,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:58:59,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:59,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:58:59,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:59,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:58:59,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:59,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:58:59,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:59,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:58:59,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:59,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:58:59,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:59,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:58:59,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:59,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:58:59,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:59,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-06 18:58:59,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:59,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-12-06 18:58:59,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:59,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2021-12-06 18:58:59,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:59,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2021-12-06 18:58:59,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:59,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2021-12-06 18:58:59,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:59,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2021-12-06 18:58:59,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:59,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2021-12-06 18:58:59,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:59,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 279 [2021-12-06 18:58:59,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:59,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 289 [2021-12-06 18:58:59,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:59,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 296 [2021-12-06 18:58:59,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:59,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 307 [2021-12-06 18:58:59,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:59,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 317 [2021-12-06 18:58:59,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:59,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 336 [2021-12-06 18:58:59,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:59,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 345 [2021-12-06 18:58:59,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:59,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 355 [2021-12-06 18:58:59,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:59,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 364 [2021-12-06 18:58:59,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:59,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 372 [2021-12-06 18:58:59,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:59,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1069 backedges. 16 proven. 29 refuted. 0 times theorem prover too weak. 1024 trivial. 0 not checked. [2021-12-06 18:58:59,127 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:58:59,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333185858] [2021-12-06 18:58:59,127 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333185858] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 18:58:59,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894110490] [2021-12-06 18:58:59,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:58:59,127 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:58:59,127 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 18:58:59,128 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 18:58:59,128 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2021-12-06 18:58:59,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:58:59,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 1362 conjuncts, 62 conjunts are in the unsatisfiable core [2021-12-06 18:58:59,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 18:59:00,141 INFO L134 CoverageAnalysis]: Checked inductivity of 1069 backedges. 546 proven. 221 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2021-12-06 18:59:00,141 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 18:59:01,026 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger: modulus not positive [2021-12-06 18:59:01,026 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-06 18:59:01,026 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2021-12-06 18:59:01,026 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734131406] [2021-12-06 18:59:01,026 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-06 18:59:01,026 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-06 18:59:01,026 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:59:01,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-06 18:59:01,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=2569, Unknown=0, NotChecked=0, Total=2756 [2021-12-06 18:59:01,027 INFO L87 Difference]: Start difference. First operand 4614 states and 5701 transitions. Second operand has 17 states, 17 states have (on average 8.470588235294118) internal successors, (144), 15 states have internal predecessors, (144), 6 states have call successors, (26), 3 states have call predecessors, (26), 2 states have return successors, (25), 7 states have call predecessors, (25), 6 states have call successors, (25) [2021-12-06 18:59:08,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:59:08,931 INFO L93 Difference]: Finished difference Result 22796 states and 29250 transitions. [2021-12-06 18:59:08,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2021-12-06 18:59:08,932 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 8.470588235294118) internal successors, (144), 15 states have internal predecessors, (144), 6 states have call successors, (26), 3 states have call predecessors, (26), 2 states have return successors, (25), 7 states have call predecessors, (25), 6 states have call successors, (25) Word has length 386 [2021-12-06 18:59:08,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:59:08,956 INFO L225 Difference]: With dead ends: 22796 [2021-12-06 18:59:08,956 INFO L226 Difference]: Without dead ends: 18841 [2021-12-06 18:59:08,962 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 849 GetRequests, 708 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5013 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1921, Invalid=18385, Unknown=0, NotChecked=0, Total=20306 [2021-12-06 18:59:08,962 INFO L933 BasicCegarLoop]: 668 mSDtfsCounter, 1649 mSDsluCounter, 5062 mSDsCounter, 0 mSdLazyCounter, 5843 mSolverCounterSat, 883 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1665 SdHoareTripleChecker+Valid, 5730 SdHoareTripleChecker+Invalid, 6726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 883 IncrementalHoareTripleChecker+Valid, 5843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2021-12-06 18:59:08,962 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1665 Valid, 5730 Invalid, 6726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [883 Valid, 5843 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2021-12-06 18:59:08,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18841 states. [2021-12-06 18:59:09,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18841 to 4614. [2021-12-06 18:59:09,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4614 states, 3806 states have (on average 1.2078297425118234) internal successors, (4597), 3846 states have internal predecessors, (4597), 552 states have call successors, (552), 255 states have call predecessors, (552), 255 states have return successors, (552), 512 states have call predecessors, (552), 552 states have call successors, (552) [2021-12-06 18:59:09,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4614 states to 4614 states and 5701 transitions. [2021-12-06 18:59:09,631 INFO L78 Accepts]: Start accepts. Automaton has 4614 states and 5701 transitions. Word has length 386 [2021-12-06 18:59:09,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:59:09,632 INFO L470 AbstractCegarLoop]: Abstraction has 4614 states and 5701 transitions. [2021-12-06 18:59:09,632 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 8.470588235294118) internal successors, (144), 15 states have internal predecessors, (144), 6 states have call successors, (26), 3 states have call predecessors, (26), 2 states have return successors, (25), 7 states have call predecessors, (25), 6 states have call successors, (25) [2021-12-06 18:59:09,632 INFO L276 IsEmpty]: Start isEmpty. Operand 4614 states and 5701 transitions. [2021-12-06 18:59:09,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2021-12-06 18:59:09,637 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:59:09,637 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 9, 9, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:59:09,657 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2021-12-06 18:59:09,838 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:59:09,840 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:59:09,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:59:09,841 INFO L85 PathProgramCache]: Analyzing trace with hash 997982211, now seen corresponding path program 1 times [2021-12-06 18:59:09,842 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:59:09,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469563336] [2021-12-06 18:59:09,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:59:09,843 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:59:09,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:10,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:59:10,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:10,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:59:10,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:10,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:59:10,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:10,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:59:10,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:10,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:59:10,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:10,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:59:10,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:10,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:59:10,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:10,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:59:10,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:10,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:59:10,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:10,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:59:10,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:10,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:59:10,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:10,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:59:10,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:10,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:59:10,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:10,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:59:10,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:10,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:59:10,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:10,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:59:10,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:10,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-06 18:59:10,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:10,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-12-06 18:59:10,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:10,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-12-06 18:59:10,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:10,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2021-12-06 18:59:10,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:10,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2021-12-06 18:59:10,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:10,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2021-12-06 18:59:10,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:10,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2021-12-06 18:59:10,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:10,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 279 [2021-12-06 18:59:10,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:10,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 289 [2021-12-06 18:59:10,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:10,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 296 [2021-12-06 18:59:10,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:10,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 307 [2021-12-06 18:59:10,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:10,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 317 [2021-12-06 18:59:10,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:10,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 336 [2021-12-06 18:59:10,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:10,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 345 [2021-12-06 18:59:10,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:10,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 355 [2021-12-06 18:59:10,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:10,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 364 [2021-12-06 18:59:10,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:10,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 372 [2021-12-06 18:59:10,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:10,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1069 backedges. 19 proven. 14 refuted. 0 times theorem prover too weak. 1036 trivial. 0 not checked. [2021-12-06 18:59:10,072 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:59:10,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469563336] [2021-12-06 18:59:10,072 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469563336] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 18:59:10,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838103901] [2021-12-06 18:59:10,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:59:10,073 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:59:10,073 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 18:59:10,073 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 18:59:10,074 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2021-12-06 18:59:10,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:10,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 1362 conjuncts, 62 conjunts are in the unsatisfiable core [2021-12-06 18:59:10,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 18:59:10,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1069 backedges. 546 proven. 221 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2021-12-06 18:59:10,994 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 18:59:11,752 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger: modulus not positive [2021-12-06 18:59:11,752 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-06 18:59:11,752 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2021-12-06 18:59:11,752 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834724487] [2021-12-06 18:59:11,752 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-06 18:59:11,753 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-06 18:59:11,753 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:59:11,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-06 18:59:11,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=2078, Unknown=0, NotChecked=0, Total=2256 [2021-12-06 18:59:11,753 INFO L87 Difference]: Start difference. First operand 4614 states and 5701 transitions. Second operand has 12 states, 12 states have (on average 11.833333333333334) internal successors, (142), 11 states have internal predecessors, (142), 6 states have call successors, (26), 3 states have call predecessors, (26), 1 states have return successors, (25), 6 states have call predecessors, (25), 6 states have call successors, (25) [2021-12-06 18:59:16,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:59:16,305 INFO L93 Difference]: Finished difference Result 18127 states and 23057 transitions. [2021-12-06 18:59:16,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-12-06 18:59:16,305 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 11.833333333333334) internal successors, (142), 11 states have internal predecessors, (142), 6 states have call successors, (26), 3 states have call predecessors, (26), 1 states have return successors, (25), 6 states have call predecessors, (25), 6 states have call successors, (25) Word has length 386 [2021-12-06 18:59:16,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:59:16,324 INFO L225 Difference]: With dead ends: 18127 [2021-12-06 18:59:16,324 INFO L226 Difference]: Without dead ends: 14172 [2021-12-06 18:59:16,329 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 804 GetRequests, 717 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1596 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=789, Invalid=7043, Unknown=0, NotChecked=0, Total=7832 [2021-12-06 18:59:16,329 INFO L933 BasicCegarLoop]: 725 mSDtfsCounter, 1483 mSDsluCounter, 2383 mSDsCounter, 0 mSdLazyCounter, 2654 mSolverCounterSat, 834 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1499 SdHoareTripleChecker+Valid, 3108 SdHoareTripleChecker+Invalid, 3488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 834 IncrementalHoareTripleChecker+Valid, 2654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-12-06 18:59:16,329 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1499 Valid, 3108 Invalid, 3488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [834 Valid, 2654 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2021-12-06 18:59:16,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14172 states. [2021-12-06 18:59:17,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14172 to 4624. [2021-12-06 18:59:17,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4624 states, 3816 states have (on average 1.2085953878406708) internal successors, (4612), 3856 states have internal predecessors, (4612), 552 states have call successors, (552), 255 states have call predecessors, (552), 255 states have return successors, (552), 512 states have call predecessors, (552), 552 states have call successors, (552) [2021-12-06 18:59:17,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4624 states to 4624 states and 5716 transitions. [2021-12-06 18:59:17,018 INFO L78 Accepts]: Start accepts. Automaton has 4624 states and 5716 transitions. Word has length 386 [2021-12-06 18:59:17,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:59:17,018 INFO L470 AbstractCegarLoop]: Abstraction has 4624 states and 5716 transitions. [2021-12-06 18:59:17,018 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.833333333333334) internal successors, (142), 11 states have internal predecessors, (142), 6 states have call successors, (26), 3 states have call predecessors, (26), 1 states have return successors, (25), 6 states have call predecessors, (25), 6 states have call successors, (25) [2021-12-06 18:59:17,018 INFO L276 IsEmpty]: Start isEmpty. Operand 4624 states and 5716 transitions. [2021-12-06 18:59:17,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2021-12-06 18:59:17,023 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:59:17,023 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 9, 9, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:59:17,043 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2021-12-06 18:59:17,224 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:59:17,225 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:59:17,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:59:17,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1088042501, now seen corresponding path program 1 times [2021-12-06 18:59:17,226 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:59:17,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782770798] [2021-12-06 18:59:17,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:59:17,227 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:59:17,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:17,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:59:17,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:17,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:59:17,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:17,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:59:17,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:17,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:59:17,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:17,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:59:17,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:17,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:59:17,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:17,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:59:17,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:17,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:59:17,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:17,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:59:17,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:17,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:59:17,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:17,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:59:17,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:17,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:59:17,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:17,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:59:17,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:17,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:59:17,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:17,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:59:17,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:17,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:59:17,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:17,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-06 18:59:17,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:17,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-12-06 18:59:17,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:17,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-12-06 18:59:17,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:17,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2021-12-06 18:59:17,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:17,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2021-12-06 18:59:17,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:17,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2021-12-06 18:59:17,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:17,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2021-12-06 18:59:17,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:17,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 279 [2021-12-06 18:59:17,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:17,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 289 [2021-12-06 18:59:17,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:17,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 296 [2021-12-06 18:59:17,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:17,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 307 [2021-12-06 18:59:17,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:17,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 317 [2021-12-06 18:59:17,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:17,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 336 [2021-12-06 18:59:17,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:17,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 345 [2021-12-06 18:59:17,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:17,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 355 [2021-12-06 18:59:17,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:17,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 364 [2021-12-06 18:59:17,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:17,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 372 [2021-12-06 18:59:17,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:17,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1069 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1061 trivial. 0 not checked. [2021-12-06 18:59:17,371 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:59:17,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782770798] [2021-12-06 18:59:17,371 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782770798] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:59:17,371 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:59:17,371 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 18:59:17,372 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902707184] [2021-12-06 18:59:17,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:59:17,372 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 18:59:17,372 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:59:17,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 18:59:17,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-06 18:59:17,372 INFO L87 Difference]: Start difference. First operand 4624 states and 5716 transitions. Second operand has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 5 states have internal predecessors, (125), 4 states have call successors, (22), 3 states have call predecessors, (22), 1 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21) [2021-12-06 18:59:18,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:59:18,241 INFO L93 Difference]: Finished difference Result 8878 states and 11021 transitions. [2021-12-06 18:59:18,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 18:59:18,242 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 5 states have internal predecessors, (125), 4 states have call successors, (22), 3 states have call predecessors, (22), 1 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21) Word has length 386 [2021-12-06 18:59:18,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:59:18,248 INFO L225 Difference]: With dead ends: 8878 [2021-12-06 18:59:18,248 INFO L226 Difference]: Without dead ends: 4644 [2021-12-06 18:59:18,252 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-06 18:59:18,252 INFO L933 BasicCegarLoop]: 225 mSDtfsCounter, 267 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 18:59:18,252 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [283 Valid, 457 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 18:59:18,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4644 states. [2021-12-06 18:59:18,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4644 to 4614. [2021-12-06 18:59:18,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4614 states, 3806 states have (on average 1.2078297425118234) internal successors, (4597), 3846 states have internal predecessors, (4597), 552 states have call successors, (552), 255 states have call predecessors, (552), 255 states have return successors, (552), 512 states have call predecessors, (552), 552 states have call successors, (552) [2021-12-06 18:59:18,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4614 states to 4614 states and 5701 transitions. [2021-12-06 18:59:18,886 INFO L78 Accepts]: Start accepts. Automaton has 4614 states and 5701 transitions. Word has length 386 [2021-12-06 18:59:18,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:59:18,887 INFO L470 AbstractCegarLoop]: Abstraction has 4614 states and 5701 transitions. [2021-12-06 18:59:18,887 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 5 states have internal predecessors, (125), 4 states have call successors, (22), 3 states have call predecessors, (22), 1 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21) [2021-12-06 18:59:18,887 INFO L276 IsEmpty]: Start isEmpty. Operand 4614 states and 5701 transitions. [2021-12-06 18:59:18,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2021-12-06 18:59:18,892 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:59:18,892 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 9, 9, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:59:18,892 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2021-12-06 18:59:18,892 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:59:18,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:59:18,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1646574981, now seen corresponding path program 1 times [2021-12-06 18:59:18,893 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:59:18,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55225195] [2021-12-06 18:59:18,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:59:18,893 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:59:18,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:18,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:59:18,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:18,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:59:18,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:18,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:59:18,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:18,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:59:18,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:18,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:59:18,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:18,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:59:18,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:18,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:59:18,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:18,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:59:18,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:18,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:59:18,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:18,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:59:18,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:18,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:59:18,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:18,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:59:18,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:18,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:59:18,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:18,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:59:18,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:18,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:59:18,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:18,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:59:18,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:18,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-06 18:59:18,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:18,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-12-06 18:59:18,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:18,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-12-06 18:59:18,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:18,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2021-12-06 18:59:18,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:18,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2021-12-06 18:59:18,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:18,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2021-12-06 18:59:18,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:18,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2021-12-06 18:59:18,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:18,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 279 [2021-12-06 18:59:18,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:18,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 289 [2021-12-06 18:59:18,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:18,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 296 [2021-12-06 18:59:18,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:18,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 307 [2021-12-06 18:59:18,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:18,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 317 [2021-12-06 18:59:18,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:18,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 336 [2021-12-06 18:59:18,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:18,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 345 [2021-12-06 18:59:18,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:18,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 355 [2021-12-06 18:59:18,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:18,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 364 [2021-12-06 18:59:18,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:18,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 372 [2021-12-06 18:59:18,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:18,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1069 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1061 trivial. 0 not checked. [2021-12-06 18:59:18,988 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:59:18,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55225195] [2021-12-06 18:59:18,988 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55225195] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:59:18,988 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:59:18,989 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 18:59:18,989 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429895369] [2021-12-06 18:59:18,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:59:18,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 18:59:18,989 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:59:18,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 18:59:18,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 18:59:18,990 INFO L87 Difference]: Start difference. First operand 4614 states and 5701 transitions. Second operand has 4 states, 4 states have (on average 31.25) internal successors, (125), 3 states have internal predecessors, (125), 2 states have call successors, (22), 3 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2021-12-06 18:59:19,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:59:19,663 INFO L93 Difference]: Finished difference Result 8510 states and 10560 transitions. [2021-12-06 18:59:19,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 18:59:19,663 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 3 states have internal predecessors, (125), 2 states have call successors, (22), 3 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 386 [2021-12-06 18:59:19,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:59:19,670 INFO L225 Difference]: With dead ends: 8510 [2021-12-06 18:59:19,670 INFO L226 Difference]: Without dead ends: 4272 [2021-12-06 18:59:19,674 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 18:59:19,675 INFO L933 BasicCegarLoop]: 231 mSDtfsCounter, 51 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 18:59:19,675 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 551 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 18:59:19,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4272 states. [2021-12-06 18:59:20,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4272 to 4272. [2021-12-06 18:59:20,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4272 states, 3474 states have (on average 1.201496833621186) internal successors, (4174), 3514 states have internal predecessors, (4174), 547 states have call successors, (547), 250 states have call predecessors, (547), 250 states have return successors, (547), 507 states have call predecessors, (547), 547 states have call successors, (547) [2021-12-06 18:59:20,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4272 states to 4272 states and 5268 transitions. [2021-12-06 18:59:20,279 INFO L78 Accepts]: Start accepts. Automaton has 4272 states and 5268 transitions. Word has length 386 [2021-12-06 18:59:20,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:59:20,280 INFO L470 AbstractCegarLoop]: Abstraction has 4272 states and 5268 transitions. [2021-12-06 18:59:20,280 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 3 states have internal predecessors, (125), 2 states have call successors, (22), 3 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2021-12-06 18:59:20,280 INFO L276 IsEmpty]: Start isEmpty. Operand 4272 states and 5268 transitions. [2021-12-06 18:59:20,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2021-12-06 18:59:20,285 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:59:20,285 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 9, 9, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:59:20,285 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2021-12-06 18:59:20,285 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:59:20,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:59:20,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1337463952, now seen corresponding path program 1 times [2021-12-06 18:59:20,285 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:59:20,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018077216] [2021-12-06 18:59:20,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:59:20,286 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:59:20,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:20,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:59:20,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:20,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:59:20,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:20,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:59:20,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:20,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:59:20,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:20,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:59:20,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:20,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:59:20,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:20,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:59:20,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:20,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:59:20,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:20,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:59:20,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:20,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:59:20,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:20,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:59:20,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:20,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:59:20,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:20,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:59:20,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:20,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:59:20,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:20,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:59:20,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:20,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:59:20,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:20,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-06 18:59:20,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:20,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-12-06 18:59:20,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:20,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2021-12-06 18:59:20,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:20,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2021-12-06 18:59:20,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:20,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2021-12-06 18:59:20,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:20,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2021-12-06 18:59:20,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:20,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2021-12-06 18:59:20,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:20,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2021-12-06 18:59:20,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:20,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 290 [2021-12-06 18:59:20,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:20,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 297 [2021-12-06 18:59:20,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:20,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 308 [2021-12-06 18:59:20,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:20,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 318 [2021-12-06 18:59:20,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:20,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 337 [2021-12-06 18:59:20,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:20,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 346 [2021-12-06 18:59:20,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:20,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 356 [2021-12-06 18:59:20,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:20,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 365 [2021-12-06 18:59:20,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:20,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 373 [2021-12-06 18:59:20,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:20,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1069 backedges. 16 proven. 29 refuted. 0 times theorem prover too weak. 1024 trivial. 0 not checked. [2021-12-06 18:59:20,521 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:59:20,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018077216] [2021-12-06 18:59:20,521 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018077216] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 18:59:20,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1664071116] [2021-12-06 18:59:20,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:59:20,522 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:59:20,522 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 18:59:20,522 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 18:59:20,523 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2021-12-06 18:59:20,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:20,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 1363 conjuncts, 62 conjunts are in the unsatisfiable core [2021-12-06 18:59:20,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 18:59:21,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1069 backedges. 546 proven. 221 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2021-12-06 18:59:21,492 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 18:59:22,296 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger: modulus not positive [2021-12-06 18:59:22,296 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-06 18:59:22,297 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2021-12-06 18:59:22,297 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098077007] [2021-12-06 18:59:22,297 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-06 18:59:22,297 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-06 18:59:22,297 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:59:22,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-06 18:59:22,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=2569, Unknown=0, NotChecked=0, Total=2756 [2021-12-06 18:59:22,298 INFO L87 Difference]: Start difference. First operand 4272 states and 5268 transitions. Second operand has 17 states, 17 states have (on average 8.529411764705882) internal successors, (145), 15 states have internal predecessors, (145), 6 states have call successors, (26), 3 states have call predecessors, (26), 2 states have return successors, (25), 7 states have call predecessors, (25), 6 states have call successors, (25) [2021-12-06 18:59:30,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:59:30,512 INFO L93 Difference]: Finished difference Result 20182 states and 25846 transitions. [2021-12-06 18:59:30,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2021-12-06 18:59:30,513 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 8.529411764705882) internal successors, (145), 15 states have internal predecessors, (145), 6 states have call successors, (26), 3 states have call predecessors, (26), 2 states have return successors, (25), 7 states have call predecessors, (25), 6 states have call successors, (25) Word has length 387 [2021-12-06 18:59:30,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:59:30,535 INFO L225 Difference]: With dead ends: 20182 [2021-12-06 18:59:30,535 INFO L226 Difference]: Without dead ends: 16515 [2021-12-06 18:59:30,541 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 851 GetRequests, 710 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4931 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1928, Invalid=18378, Unknown=0, NotChecked=0, Total=20306 [2021-12-06 18:59:30,541 INFO L933 BasicCegarLoop]: 692 mSDtfsCounter, 1509 mSDsluCounter, 5130 mSDsCounter, 0 mSdLazyCounter, 5827 mSolverCounterSat, 841 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1525 SdHoareTripleChecker+Valid, 5822 SdHoareTripleChecker+Invalid, 6668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 841 IncrementalHoareTripleChecker+Valid, 5827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2021-12-06 18:59:30,541 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1525 Valid, 5822 Invalid, 6668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [841 Valid, 5827 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2021-12-06 18:59:30,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16515 states. [2021-12-06 18:59:31,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16515 to 4262. [2021-12-06 18:59:31,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4262 states, 3464 states have (on average 1.202078521939954) internal successors, (4164), 3504 states have internal predecessors, (4164), 547 states have call successors, (547), 250 states have call predecessors, (547), 250 states have return successors, (547), 507 states have call predecessors, (547), 547 states have call successors, (547) [2021-12-06 18:59:31,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4262 states to 4262 states and 5258 transitions. [2021-12-06 18:59:31,252 INFO L78 Accepts]: Start accepts. Automaton has 4262 states and 5258 transitions. Word has length 387 [2021-12-06 18:59:31,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:59:31,253 INFO L470 AbstractCegarLoop]: Abstraction has 4262 states and 5258 transitions. [2021-12-06 18:59:31,253 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 8.529411764705882) internal successors, (145), 15 states have internal predecessors, (145), 6 states have call successors, (26), 3 states have call predecessors, (26), 2 states have return successors, (25), 7 states have call predecessors, (25), 6 states have call successors, (25) [2021-12-06 18:59:31,253 INFO L276 IsEmpty]: Start isEmpty. Operand 4262 states and 5258 transitions. [2021-12-06 18:59:31,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2021-12-06 18:59:31,258 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:59:31,258 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 9, 9, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:59:31,278 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2021-12-06 18:59:31,459 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2021-12-06 18:59:31,460 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:59:31,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:59:31,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1553634158, now seen corresponding path program 1 times [2021-12-06 18:59:31,461 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:59:31,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097044817] [2021-12-06 18:59:31,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:59:31,462 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:59:31,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:31,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:59:31,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:31,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:59:31,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:31,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:59:31,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:31,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:59:31,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:31,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:59:31,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:31,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:59:31,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:31,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:59:31,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:31,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:59:31,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:31,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:59:31,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:31,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:59:31,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:31,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:59:31,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:31,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:59:31,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:31,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:59:31,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:31,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:59:31,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:31,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:59:31,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:31,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:59:31,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:31,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-06 18:59:31,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:31,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-12-06 18:59:31,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:31,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2021-12-06 18:59:31,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:31,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2021-12-06 18:59:31,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:31,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2021-12-06 18:59:31,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:31,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2021-12-06 18:59:31,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:31,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2021-12-06 18:59:31,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:31,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2021-12-06 18:59:31,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:31,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 290 [2021-12-06 18:59:31,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:31,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 297 [2021-12-06 18:59:31,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:31,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 308 [2021-12-06 18:59:31,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:31,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 318 [2021-12-06 18:59:31,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:31,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 337 [2021-12-06 18:59:31,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:31,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 346 [2021-12-06 18:59:31,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:31,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 356 [2021-12-06 18:59:31,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:31,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 365 [2021-12-06 18:59:31,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:31,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 373 [2021-12-06 18:59:31,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:31,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1069 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2021-12-06 18:59:31,567 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:59:31,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097044817] [2021-12-06 18:59:31,567 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097044817] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:59:31,567 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:59:31,567 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 18:59:31,567 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114848213] [2021-12-06 18:59:31,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:59:31,567 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 18:59:31,568 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:59:31,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 18:59:31,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 18:59:31,568 INFO L87 Difference]: Start difference. First operand 4262 states and 5258 transitions. Second operand has 4 states, 4 states have (on average 32.5) internal successors, (130), 3 states have internal predecessors, (130), 2 states have call successors, (23), 3 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2021-12-06 18:59:32,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:59:32,101 INFO L93 Difference]: Finished difference Result 6699 states and 8269 transitions. [2021-12-06 18:59:32,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 18:59:32,101 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 3 states have internal predecessors, (130), 2 states have call successors, (23), 3 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 387 [2021-12-06 18:59:32,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:59:32,117 INFO L225 Difference]: With dead ends: 6699 [2021-12-06 18:59:32,118 INFO L226 Difference]: Without dead ends: 2797 [2021-12-06 18:59:32,120 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 18:59:32,120 INFO L933 BasicCegarLoop]: 213 mSDtfsCounter, 51 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 18:59:32,121 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 503 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 18:59:32,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2797 states. [2021-12-06 18:59:32,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2797 to 2797. [2021-12-06 18:59:32,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2797 states, 2299 states have (on average 1.1857329273597217) internal successors, (2726), 2323 states have internal predecessors, (2726), 335 states have call successors, (335), 162 states have call predecessors, (335), 162 states have return successors, (335), 311 states have call predecessors, (335), 335 states have call successors, (335) [2021-12-06 18:59:32,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2797 states to 2797 states and 3396 transitions. [2021-12-06 18:59:32,548 INFO L78 Accepts]: Start accepts. Automaton has 2797 states and 3396 transitions. Word has length 387 [2021-12-06 18:59:32,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:59:32,549 INFO L470 AbstractCegarLoop]: Abstraction has 2797 states and 3396 transitions. [2021-12-06 18:59:32,549 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 3 states have internal predecessors, (130), 2 states have call successors, (23), 3 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2021-12-06 18:59:32,549 INFO L276 IsEmpty]: Start isEmpty. Operand 2797 states and 3396 transitions. [2021-12-06 18:59:32,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2021-12-06 18:59:32,552 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:59:32,552 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 10, 10, 10, 9, 8, 8, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:59:32,552 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2021-12-06 18:59:32,553 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:59:32,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:59:32,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1599502361, now seen corresponding path program 1 times [2021-12-06 18:59:32,553 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:59:32,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257651508] [2021-12-06 18:59:32,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:59:32,553 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:59:32,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:32,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:59:32,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:32,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:59:32,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:32,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:59:32,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:32,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:59:32,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:32,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:59:32,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:32,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:59:32,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:32,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:59:32,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:32,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:59:32,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:32,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:59:32,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:32,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:59:32,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:32,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:59:32,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:32,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:59:32,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:32,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:59:32,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:32,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:59:32,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:32,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:59:32,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:32,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:59:32,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:32,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-06 18:59:32,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:32,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-12-06 18:59:32,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:32,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2021-12-06 18:59:32,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:32,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2021-12-06 18:59:32,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:32,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2021-12-06 18:59:32,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:32,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2021-12-06 18:59:32,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:32,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2021-12-06 18:59:32,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:32,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2021-12-06 18:59:32,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:32,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 288 [2021-12-06 18:59:32,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:32,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 295 [2021-12-06 18:59:32,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:32,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 306 [2021-12-06 18:59:32,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:32,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 316 [2021-12-06 18:59:32,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:32,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 335 [2021-12-06 18:59:32,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:32,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 344 [2021-12-06 18:59:32,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:32,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 353 [2021-12-06 18:59:32,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:32,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 361 [2021-12-06 18:59:32,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:32,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 369 [2021-12-06 18:59:32,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:32,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 377 [2021-12-06 18:59:32,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:32,671 INFO L134 CoverageAnalysis]: Checked inductivity of 1061 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 1024 trivial. 0 not checked. [2021-12-06 18:59:32,672 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:59:32,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257651508] [2021-12-06 18:59:32,672 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257651508] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:59:32,672 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:59:32,672 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-06 18:59:32,672 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853403841] [2021-12-06 18:59:32,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:59:32,672 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 18:59:32,673 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:59:32,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 18:59:32,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-06 18:59:32,673 INFO L87 Difference]: Start difference. First operand 2797 states and 3396 transitions. Second operand has 9 states, 9 states have (on average 15.222222222222221) internal successors, (137), 7 states have internal predecessors, (137), 3 states have call successors, (24), 3 states have call predecessors, (24), 2 states have return successors, (23), 3 states have call predecessors, (23), 2 states have call successors, (23) [2021-12-06 18:59:33,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:59:33,800 INFO L93 Difference]: Finished difference Result 6083 states and 7483 transitions. [2021-12-06 18:59:33,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-06 18:59:33,801 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 15.222222222222221) internal successors, (137), 7 states have internal predecessors, (137), 3 states have call successors, (24), 3 states have call predecessors, (24), 2 states have return successors, (23), 3 states have call predecessors, (23), 2 states have call successors, (23) Word has length 390 [2021-12-06 18:59:33,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:59:33,806 INFO L225 Difference]: With dead ends: 6083 [2021-12-06 18:59:33,806 INFO L226 Difference]: Without dead ends: 3810 [2021-12-06 18:59:33,808 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2021-12-06 18:59:33,808 INFO L933 BasicCegarLoop]: 324 mSDtfsCounter, 431 mSDsluCounter, 1433 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 1757 SdHoareTripleChecker+Invalid, 907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 18:59:33,808 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [439 Valid, 1757 Invalid, 907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 18:59:33,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3810 states. [2021-12-06 18:59:34,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3810 to 2884. [2021-12-06 18:59:34,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2884 states, 2362 states have (on average 1.1858594411515664) internal successors, (2801), 2386 states have internal predecessors, (2801), 353 states have call successors, (353), 168 states have call predecessors, (353), 168 states have return successors, (353), 329 states have call predecessors, (353), 353 states have call successors, (353) [2021-12-06 18:59:34,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2884 states to 2884 states and 3507 transitions. [2021-12-06 18:59:34,276 INFO L78 Accepts]: Start accepts. Automaton has 2884 states and 3507 transitions. Word has length 390 [2021-12-06 18:59:34,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:59:34,276 INFO L470 AbstractCegarLoop]: Abstraction has 2884 states and 3507 transitions. [2021-12-06 18:59:34,276 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.222222222222221) internal successors, (137), 7 states have internal predecessors, (137), 3 states have call successors, (24), 3 states have call predecessors, (24), 2 states have return successors, (23), 3 states have call predecessors, (23), 2 states have call successors, (23) [2021-12-06 18:59:34,276 INFO L276 IsEmpty]: Start isEmpty. Operand 2884 states and 3507 transitions. [2021-12-06 18:59:34,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2021-12-06 18:59:34,280 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:59:34,280 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 10, 10, 10, 9, 8, 8, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:59:34,280 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2021-12-06 18:59:34,280 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:59:34,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:59:34,280 INFO L85 PathProgramCache]: Analyzing trace with hash -849745400, now seen corresponding path program 1 times [2021-12-06 18:59:34,280 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:59:34,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59448609] [2021-12-06 18:59:34,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:59:34,281 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:59:34,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:34,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:59:34,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:34,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:59:34,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:34,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:59:34,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:34,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:59:34,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:34,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:59:34,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:34,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:59:34,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:34,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:59:34,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:34,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:59:34,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:34,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:59:34,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:34,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:59:34,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:34,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:59:34,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:34,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:59:34,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:34,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:59:34,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:34,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:59:34,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:34,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:59:34,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:34,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:59:34,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:34,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-06 18:59:34,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:34,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-12-06 18:59:34,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:34,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-12-06 18:59:34,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:34,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2021-12-06 18:59:34,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:34,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2021-12-06 18:59:34,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:34,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2021-12-06 18:59:34,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:34,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2021-12-06 18:59:34,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:34,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2021-12-06 18:59:34,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:34,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2021-12-06 18:59:34,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:34,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 294 [2021-12-06 18:59:34,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:34,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2021-12-06 18:59:34,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:34,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-12-06 18:59:34,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:34,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 335 [2021-12-06 18:59:34,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:34,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 344 [2021-12-06 18:59:34,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:34,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 353 [2021-12-06 18:59:34,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:34,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 361 [2021-12-06 18:59:34,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:34,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 369 [2021-12-06 18:59:34,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:34,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 377 [2021-12-06 18:59:34,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:34,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1060 backedges. 35 proven. 2 refuted. 0 times theorem prover too weak. 1023 trivial. 0 not checked. [2021-12-06 18:59:34,387 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:59:34,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59448609] [2021-12-06 18:59:34,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59448609] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 18:59:34,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565211825] [2021-12-06 18:59:34,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:59:34,388 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:59:34,388 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 18:59:34,388 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 18:59:34,389 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2021-12-06 18:59:34,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:34,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 1383 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-06 18:59:34,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 18:59:34,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1060 backedges. 127 proven. 307 refuted. 0 times theorem prover too weak. 626 trivial. 0 not checked. [2021-12-06 18:59:34,908 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 18:59:35,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1060 backedges. 17 proven. 33 refuted. 0 times theorem prover too weak. 1010 trivial. 0 not checked. [2021-12-06 18:59:35,218 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1565211825] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 18:59:35,218 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 18:59:35,218 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 12] total 20 [2021-12-06 18:59:35,218 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540199462] [2021-12-06 18:59:35,218 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 18:59:35,219 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-06 18:59:35,219 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:59:35,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-06 18:59:35,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2021-12-06 18:59:35,219 INFO L87 Difference]: Start difference. First operand 2884 states and 3507 transitions. Second operand has 20 states, 20 states have (on average 15.5) internal successors, (310), 17 states have internal predecessors, (310), 7 states have call successors, (71), 7 states have call predecessors, (71), 9 states have return successors, (70), 9 states have call predecessors, (70), 7 states have call successors, (70) [2021-12-06 18:59:39,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:59:39,880 INFO L93 Difference]: Finished difference Result 12129 states and 15182 transitions. [2021-12-06 18:59:39,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2021-12-06 18:59:39,881 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 15.5) internal successors, (310), 17 states have internal predecessors, (310), 7 states have call successors, (71), 7 states have call predecessors, (71), 9 states have return successors, (70), 9 states have call predecessors, (70), 7 states have call successors, (70) Word has length 390 [2021-12-06 18:59:39,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:59:39,893 INFO L225 Difference]: With dead ends: 12129 [2021-12-06 18:59:39,893 INFO L226 Difference]: Without dead ends: 9769 [2021-12-06 18:59:39,896 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 950 GetRequests, 864 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2149 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=742, Invalid=6740, Unknown=0, NotChecked=0, Total=7482 [2021-12-06 18:59:39,896 INFO L933 BasicCegarLoop]: 667 mSDtfsCounter, 1665 mSDsluCounter, 7766 mSDsCounter, 0 mSdLazyCounter, 4978 mSolverCounterSat, 704 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1677 SdHoareTripleChecker+Valid, 8433 SdHoareTripleChecker+Invalid, 5682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 704 IncrementalHoareTripleChecker+Valid, 4978 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-12-06 18:59:39,896 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1677 Valid, 8433 Invalid, 5682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [704 Valid, 4978 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2021-12-06 18:59:39,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9769 states. [2021-12-06 18:59:40,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9769 to 5014. [2021-12-06 18:59:40,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5014 states, 4123 states have (on average 1.18627213194276) internal successors, (4891), 4162 states have internal predecessors, (4891), 599 states have call successors, (599), 291 states have call predecessors, (599), 291 states have return successors, (599), 560 states have call predecessors, (599), 599 states have call successors, (599) [2021-12-06 18:59:40,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5014 states to 5014 states and 6089 transitions. [2021-12-06 18:59:40,762 INFO L78 Accepts]: Start accepts. Automaton has 5014 states and 6089 transitions. Word has length 390 [2021-12-06 18:59:40,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:59:40,762 INFO L470 AbstractCegarLoop]: Abstraction has 5014 states and 6089 transitions. [2021-12-06 18:59:40,762 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 15.5) internal successors, (310), 17 states have internal predecessors, (310), 7 states have call successors, (71), 7 states have call predecessors, (71), 9 states have return successors, (70), 9 states have call predecessors, (70), 7 states have call successors, (70) [2021-12-06 18:59:40,762 INFO L276 IsEmpty]: Start isEmpty. Operand 5014 states and 6089 transitions. [2021-12-06 18:59:40,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2021-12-06 18:59:40,766 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:59:40,766 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 10, 9, 8, 8, 8, 7, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 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, 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] [2021-12-06 18:59:40,786 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2021-12-06 18:59:40,966 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:59:40,968 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:59:40,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:59:40,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1023811215, now seen corresponding path program 1 times [2021-12-06 18:59:40,969 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:59:40,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940664426] [2021-12-06 18:59:40,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:59:40,970 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:59:40,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:41,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:59:41,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:41,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:59:41,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:41,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:59:41,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:41,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:59:41,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:41,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:59:41,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:41,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:59:41,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:41,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:59:41,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:41,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:59:41,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:41,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:59:41,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:41,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:59:41,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:41,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:59:41,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:41,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:59:41,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:41,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:59:41,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:41,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:59:41,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:41,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:59:41,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:41,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:59:41,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:41,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-06 18:59:41,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:41,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-12-06 18:59:41,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:41,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-12-06 18:59:41,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:41,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2021-12-06 18:59:41,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:41,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2021-12-06 18:59:41,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:41,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2021-12-06 18:59:41,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:41,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2021-12-06 18:59:41,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:41,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2021-12-06 18:59:41,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:41,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2021-12-06 18:59:41,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:41,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2021-12-06 18:59:41,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:41,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 304 [2021-12-06 18:59:41,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:41,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 314 [2021-12-06 18:59:41,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:41,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 333 [2021-12-06 18:59:41,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:41,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 342 [2021-12-06 18:59:41,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:41,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 352 [2021-12-06 18:59:41,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:41,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 363 [2021-12-06 18:59:41,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:41,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 371 [2021-12-06 18:59:41,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:41,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 379 [2021-12-06 18:59:41,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:41,089 INFO L134 CoverageAnalysis]: Checked inductivity of 1120 backedges. 32 proven. 2 refuted. 0 times theorem prover too weak. 1086 trivial. 0 not checked. [2021-12-06 18:59:41,089 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:59:41,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940664426] [2021-12-06 18:59:41,090 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940664426] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 18:59:41,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [343529079] [2021-12-06 18:59:41,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:59:41,090 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:59:41,090 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 18:59:41,090 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 18:59:41,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2021-12-06 18:59:41,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:41,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 1391 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-06 18:59:41,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 18:59:41,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1120 backedges. 286 proven. 0 refuted. 0 times theorem prover too weak. 834 trivial. 0 not checked. [2021-12-06 18:59:41,447 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 18:59:41,447 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [343529079] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:59:41,447 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 18:59:41,447 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 11 [2021-12-06 18:59:41,447 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48558821] [2021-12-06 18:59:41,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:59:41,448 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 18:59:41,448 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:59:41,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 18:59:41,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-12-06 18:59:41,448 INFO L87 Difference]: Start difference. First operand 5014 states and 6089 transitions. Second operand has 9 states, 9 states have (on average 16.77777777777778) internal successors, (151), 8 states have internal predecessors, (151), 3 states have call successors, (24), 3 states have call predecessors, (24), 4 states have return successors, (23), 4 states have call predecessors, (23), 3 states have call successors, (23) [2021-12-06 18:59:43,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:59:43,740 INFO L93 Difference]: Finished difference Result 10591 states and 13138 transitions. [2021-12-06 18:59:43,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-06 18:59:43,741 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 16.77777777777778) internal successors, (151), 8 states have internal predecessors, (151), 3 states have call successors, (24), 3 states have call predecessors, (24), 4 states have return successors, (23), 4 states have call predecessors, (23), 3 states have call successors, (23) Word has length 394 [2021-12-06 18:59:43,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:59:43,753 INFO L225 Difference]: With dead ends: 10591 [2021-12-06 18:59:43,753 INFO L226 Difference]: Without dead ends: 8174 [2021-12-06 18:59:43,756 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 488 GetRequests, 467 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2021-12-06 18:59:43,756 INFO L933 BasicCegarLoop]: 595 mSDtfsCounter, 858 mSDsluCounter, 2701 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 867 SdHoareTripleChecker+Valid, 3296 SdHoareTripleChecker+Invalid, 1245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 18:59:43,756 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [867 Valid, 3296 Invalid, 1245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 1040 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-06 18:59:43,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8174 states. [2021-12-06 18:59:44,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8174 to 4984. [2021-12-06 18:59:44,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4984 states, 4099 states have (on average 1.1829714564527933) internal successors, (4849), 4138 states have internal predecessors, (4849), 593 states have call successors, (593), 291 states have call predecessors, (593), 291 states have return successors, (593), 554 states have call predecessors, (593), 593 states have call successors, (593) [2021-12-06 18:59:44,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4984 states to 4984 states and 6035 transitions. [2021-12-06 18:59:44,621 INFO L78 Accepts]: Start accepts. Automaton has 4984 states and 6035 transitions. Word has length 394 [2021-12-06 18:59:44,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:59:44,622 INFO L470 AbstractCegarLoop]: Abstraction has 4984 states and 6035 transitions. [2021-12-06 18:59:44,622 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.77777777777778) internal successors, (151), 8 states have internal predecessors, (151), 3 states have call successors, (24), 3 states have call predecessors, (24), 4 states have return successors, (23), 4 states have call predecessors, (23), 3 states have call successors, (23) [2021-12-06 18:59:44,622 INFO L276 IsEmpty]: Start isEmpty. Operand 4984 states and 6035 transitions. [2021-12-06 18:59:44,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2021-12-06 18:59:44,625 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:59:44,626 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 10, 9, 8, 8, 8, 7, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 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, 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] [2021-12-06 18:59:44,645 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2021-12-06 18:59:44,826 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:59:44,827 INFO L402 AbstractCegarLoop]: === Iteration 64 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:59:44,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:59:44,828 INFO L85 PathProgramCache]: Analyzing trace with hash -443947144, now seen corresponding path program 1 times [2021-12-06 18:59:44,828 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:59:44,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088310442] [2021-12-06 18:59:44,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:59:44,830 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:59:44,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:44,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:59:44,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:44,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:59:44,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:44,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:59:44,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:44,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:59:44,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:44,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:59:44,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:44,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:59:44,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:44,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:59:44,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:44,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:59:44,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:44,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:59:44,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:44,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:59:44,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:44,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:59:44,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:44,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:59:44,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:44,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:59:44,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:44,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:59:44,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:44,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:59:44,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:44,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:59:44,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:44,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-06 18:59:44,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:44,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-12-06 18:59:44,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:44,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-12-06 18:59:44,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:44,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2021-12-06 18:59:44,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:44,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2021-12-06 18:59:44,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:44,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2021-12-06 18:59:44,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:44,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2021-12-06 18:59:44,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:44,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2021-12-06 18:59:44,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:44,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2021-12-06 18:59:44,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:44,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2021-12-06 18:59:44,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:44,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 304 [2021-12-06 18:59:44,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:44,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 314 [2021-12-06 18:59:44,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:44,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 334 [2021-12-06 18:59:44,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:44,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 343 [2021-12-06 18:59:44,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:44,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 353 [2021-12-06 18:59:44,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:44,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 364 [2021-12-06 18:59:44,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:44,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 372 [2021-12-06 18:59:44,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:44,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 380 [2021-12-06 18:59:44,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:44,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1119 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 1086 trivial. 0 not checked. [2021-12-06 18:59:44,983 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:59:44,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088310442] [2021-12-06 18:59:44,983 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088310442] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:59:44,984 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:59:44,984 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-06 18:59:44,984 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833407506] [2021-12-06 18:59:44,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:59:44,984 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-06 18:59:44,984 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:59:44,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-06 18:59:44,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-12-06 18:59:44,985 INFO L87 Difference]: Start difference. First operand 4984 states and 6035 transitions. Second operand has 10 states, 10 states have (on average 13.2) internal successors, (132), 8 states have internal predecessors, (132), 3 states have call successors, (24), 3 states have call predecessors, (24), 2 states have return successors, (23), 3 states have call predecessors, (23), 2 states have call successors, (23) [2021-12-06 18:59:47,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:59:47,796 INFO L93 Difference]: Finished difference Result 12970 states and 15999 transitions. [2021-12-06 18:59:47,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-06 18:59:47,796 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.2) internal successors, (132), 8 states have internal predecessors, (132), 3 states have call successors, (24), 3 states have call predecessors, (24), 2 states have return successors, (23), 3 states have call predecessors, (23), 2 states have call successors, (23) Word has length 396 [2021-12-06 18:59:47,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:59:47,807 INFO L225 Difference]: With dead ends: 12970 [2021-12-06 18:59:47,808 INFO L226 Difference]: Without dead ends: 8450 [2021-12-06 18:59:47,811 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=149, Invalid=607, Unknown=0, NotChecked=0, Total=756 [2021-12-06 18:59:47,812 INFO L933 BasicCegarLoop]: 627 mSDtfsCounter, 709 mSDsluCounter, 2842 mSDsCounter, 0 mSdLazyCounter, 1784 mSolverCounterSat, 266 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 734 SdHoareTripleChecker+Valid, 3469 SdHoareTripleChecker+Invalid, 2050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 266 IncrementalHoareTripleChecker+Valid, 1784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-06 18:59:47,812 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [734 Valid, 3469 Invalid, 2050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [266 Valid, 1784 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-06 18:59:47,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8450 states. [2021-12-06 18:59:48,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8450 to 4924. [2021-12-06 18:59:48,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4924 states, 4051 states have (on average 1.1755122192051346) internal successors, (4762), 4090 states have internal predecessors, (4762), 581 states have call successors, (581), 291 states have call predecessors, (581), 291 states have return successors, (581), 542 states have call predecessors, (581), 581 states have call successors, (581) [2021-12-06 18:59:48,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4924 states to 4924 states and 5924 transitions. [2021-12-06 18:59:48,701 INFO L78 Accepts]: Start accepts. Automaton has 4924 states and 5924 transitions. Word has length 396 [2021-12-06 18:59:48,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:59:48,701 INFO L470 AbstractCegarLoop]: Abstraction has 4924 states and 5924 transitions. [2021-12-06 18:59:48,701 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.2) internal successors, (132), 8 states have internal predecessors, (132), 3 states have call successors, (24), 3 states have call predecessors, (24), 2 states have return successors, (23), 3 states have call predecessors, (23), 2 states have call successors, (23) [2021-12-06 18:59:48,701 INFO L276 IsEmpty]: Start isEmpty. Operand 4924 states and 5924 transitions. [2021-12-06 18:59:48,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2021-12-06 18:59:48,705 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:59:48,705 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 10, 9, 8, 8, 8, 7, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 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, 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] [2021-12-06 18:59:48,705 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2021-12-06 18:59:48,705 INFO L402 AbstractCegarLoop]: === Iteration 65 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:59:48,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:59:48,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1417038198, now seen corresponding path program 1 times [2021-12-06 18:59:48,705 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:59:48,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835483930] [2021-12-06 18:59:48,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:59:48,706 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:59:48,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:48,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:59:48,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:48,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:59:48,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:48,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:59:48,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:48,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:59:48,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:48,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:59:48,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:48,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:59:48,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:48,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:59:48,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:48,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:59:48,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:48,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:59:48,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:48,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:59:48,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:48,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:59:48,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:48,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:59:48,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:48,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:59:48,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:48,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:59:48,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:48,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:59:48,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:48,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:59:48,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:48,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-06 18:59:48,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:48,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-12-06 18:59:48,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:48,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-12-06 18:59:48,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:48,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2021-12-06 18:59:48,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:48,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2021-12-06 18:59:48,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:48,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2021-12-06 18:59:48,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:48,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2021-12-06 18:59:48,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:48,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2021-12-06 18:59:48,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:48,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2021-12-06 18:59:48,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:48,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2021-12-06 18:59:48,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:48,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 304 [2021-12-06 18:59:48,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:48,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 314 [2021-12-06 18:59:48,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:48,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 334 [2021-12-06 18:59:48,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:48,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 343 [2021-12-06 18:59:48,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:48,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 353 [2021-12-06 18:59:48,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:48,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 364 [2021-12-06 18:59:48,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:48,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 372 [2021-12-06 18:59:48,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:48,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 380 [2021-12-06 18:59:48,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:48,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1119 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 1100 trivial. 0 not checked. [2021-12-06 18:59:48,805 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:59:48,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835483930] [2021-12-06 18:59:48,805 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835483930] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:59:48,805 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:59:48,805 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 18:59:48,805 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755664675] [2021-12-06 18:59:48,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:59:48,806 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 18:59:48,806 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:59:48,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 18:59:48,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 18:59:48,806 INFO L87 Difference]: Start difference. First operand 4924 states and 5924 transitions. Second operand has 4 states, 4 states have (on average 32.5) internal successors, (130), 3 states have internal predecessors, (130), 3 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2021-12-06 18:59:49,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:59:49,993 INFO L93 Difference]: Finished difference Result 7880 states and 9489 transitions. [2021-12-06 18:59:49,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 18:59:49,993 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 3 states have internal predecessors, (130), 3 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 396 [2021-12-06 18:59:49,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:59:50,001 INFO L225 Difference]: With dead ends: 7880 [2021-12-06 18:59:50,001 INFO L226 Difference]: Without dead ends: 5529 [2021-12-06 18:59:50,003 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-06 18:59:50,004 INFO L933 BasicCegarLoop]: 338 mSDtfsCounter, 173 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 18:59:50,004 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [183 Valid, 679 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 18:59:50,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5529 states. [2021-12-06 18:59:50,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5529 to 4924. [2021-12-06 18:59:50,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4924 states, 4051 states have (on average 1.1695877561096026) internal successors, (4738), 4090 states have internal predecessors, (4738), 581 states have call successors, (581), 291 states have call predecessors, (581), 291 states have return successors, (581), 542 states have call predecessors, (581), 581 states have call successors, (581) [2021-12-06 18:59:50,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4924 states to 4924 states and 5900 transitions. [2021-12-06 18:59:50,865 INFO L78 Accepts]: Start accepts. Automaton has 4924 states and 5900 transitions. Word has length 396 [2021-12-06 18:59:50,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:59:50,865 INFO L470 AbstractCegarLoop]: Abstraction has 4924 states and 5900 transitions. [2021-12-06 18:59:50,865 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 3 states have internal predecessors, (130), 3 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2021-12-06 18:59:50,865 INFO L276 IsEmpty]: Start isEmpty. Operand 4924 states and 5900 transitions. [2021-12-06 18:59:50,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2021-12-06 18:59:50,869 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:59:50,869 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 10, 9, 8, 8, 8, 7, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:59:50,869 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2021-12-06 18:59:50,870 INFO L402 AbstractCegarLoop]: === Iteration 66 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:59:50,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:59:50,870 INFO L85 PathProgramCache]: Analyzing trace with hash 572086290, now seen corresponding path program 1 times [2021-12-06 18:59:50,870 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:59:50,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379772132] [2021-12-06 18:59:50,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:59:50,870 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:59:50,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:50,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:59:50,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:50,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:59:50,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:50,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:59:50,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:50,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:59:50,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:50,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:59:50,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:50,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:59:50,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:50,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:59:50,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:50,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:59:50,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:50,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:59:51,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:51,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:59:51,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:51,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:59:51,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:51,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:59:51,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:51,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:59:51,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:51,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:59:51,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:51,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:59:51,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:51,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:59:51,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:51,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-06 18:59:51,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:51,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-12-06 18:59:51,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:51,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2021-12-06 18:59:51,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:51,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2021-12-06 18:59:51,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:51,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2021-12-06 18:59:51,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:51,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2021-12-06 18:59:51,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:51,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2021-12-06 18:59:51,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:51,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2021-12-06 18:59:51,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:51,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 288 [2021-12-06 18:59:51,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:51,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 295 [2021-12-06 18:59:51,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:51,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 306 [2021-12-06 18:59:51,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:51,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 316 [2021-12-06 18:59:51,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:51,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 335 [2021-12-06 18:59:51,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:51,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 344 [2021-12-06 18:59:51,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:51,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 354 [2021-12-06 18:59:51,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:51,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 365 [2021-12-06 18:59:51,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:51,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 373 [2021-12-06 18:59:51,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:51,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 381 [2021-12-06 18:59:51,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:51,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1114 backedges. 36 proven. 67 refuted. 0 times theorem prover too weak. 1011 trivial. 0 not checked. [2021-12-06 18:59:51,092 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:59:51,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379772132] [2021-12-06 18:59:51,092 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379772132] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 18:59:51,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440080605] [2021-12-06 18:59:51,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:59:51,092 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:59:51,093 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 18:59:51,093 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 18:59:51,094 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2021-12-06 18:59:51,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:51,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 1394 conjuncts, 62 conjunts are in the unsatisfiable core [2021-12-06 18:59:51,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 18:59:52,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1114 backedges. 576 proven. 221 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2021-12-06 18:59:52,050 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 18:59:52,840 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger: modulus not positive [2021-12-06 18:59:52,840 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-06 18:59:52,840 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2021-12-06 18:59:52,840 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525004305] [2021-12-06 18:59:52,840 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-06 18:59:52,840 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-06 18:59:52,840 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:59:52,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-06 18:59:52,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=2345, Unknown=0, NotChecked=0, Total=2550 [2021-12-06 18:59:52,841 INFO L87 Difference]: Start difference. First operand 4924 states and 5900 transitions. Second operand has 15 states, 15 states have (on average 10.466666666666667) internal successors, (157), 12 states have internal predecessors, (157), 5 states have call successors, (27), 3 states have call predecessors, (27), 6 states have return successors, (26), 7 states have call predecessors, (26), 5 states have call successors, (26) [2021-12-06 18:59:55,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:59:55,715 INFO L93 Difference]: Finished difference Result 9584 states and 11452 transitions. [2021-12-06 18:59:55,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-12-06 18:59:55,716 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 10.466666666666667) internal successors, (157), 12 states have internal predecessors, (157), 5 states have call successors, (27), 3 states have call predecessors, (27), 6 states have return successors, (26), 7 states have call predecessors, (26), 5 states have call successors, (26) Word has length 396 [2021-12-06 18:59:55,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:59:55,723 INFO L225 Difference]: With dead ends: 9584 [2021-12-06 18:59:55,723 INFO L226 Difference]: Without dead ends: 6129 [2021-12-06 18:59:55,727 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 811 GetRequests, 726 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1589 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=810, Invalid=6672, Unknown=0, NotChecked=0, Total=7482 [2021-12-06 18:59:55,727 INFO L933 BasicCegarLoop]: 599 mSDtfsCounter, 609 mSDsluCounter, 4344 mSDsCounter, 0 mSdLazyCounter, 2263 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 636 SdHoareTripleChecker+Valid, 4943 SdHoareTripleChecker+Invalid, 2460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 2263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-06 18:59:55,727 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [636 Valid, 4943 Invalid, 2460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 2263 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-12-06 18:59:55,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6129 states. [2021-12-06 18:59:56,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6129 to 4672. [2021-12-06 18:59:56,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4672 states, 3914 states have (on average 1.157639243740419) internal successors, (4531), 3942 states have internal predecessors, (4531), 471 states have call successors, (471), 286 states have call predecessors, (471), 286 states have return successors, (471), 443 states have call predecessors, (471), 471 states have call successors, (471) [2021-12-06 18:59:56,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4672 states to 4672 states and 5473 transitions. [2021-12-06 18:59:56,640 INFO L78 Accepts]: Start accepts. Automaton has 4672 states and 5473 transitions. Word has length 396 [2021-12-06 18:59:56,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:59:56,641 INFO L470 AbstractCegarLoop]: Abstraction has 4672 states and 5473 transitions. [2021-12-06 18:59:56,641 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 10.466666666666667) internal successors, (157), 12 states have internal predecessors, (157), 5 states have call successors, (27), 3 states have call predecessors, (27), 6 states have return successors, (26), 7 states have call predecessors, (26), 5 states have call successors, (26) [2021-12-06 18:59:56,641 INFO L276 IsEmpty]: Start isEmpty. Operand 4672 states and 5473 transitions. [2021-12-06 18:59:56,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2021-12-06 18:59:56,644 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:59:56,644 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 10, 9, 8, 8, 8, 7, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 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, 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:59:56,664 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2021-12-06 18:59:56,845 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable65 [2021-12-06 18:59:56,846 INFO L402 AbstractCegarLoop]: === Iteration 67 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:59:56,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:59:56,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1327426607, now seen corresponding path program 1 times [2021-12-06 18:59:56,848 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:59:56,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176191690] [2021-12-06 18:59:56,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:59:56,849 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:59:56,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:56,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 18:59:56,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:56,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 18:59:56,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:56,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 18:59:56,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:56,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 18:59:56,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:56,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 18:59:56,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:56,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 18:59:56,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:56,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 18:59:56,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:56,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 18:59:56,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:56,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 18:59:56,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:56,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 18:59:56,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:56,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:59:56,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:56,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 18:59:56,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:56,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 18:59:56,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:56,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 18:59:56,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:56,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 18:59:56,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:56,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 18:59:56,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:56,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-06 18:59:56,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:56,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-12-06 18:59:56,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:56,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-12-06 18:59:56,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:56,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2021-12-06 18:59:56,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:56,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2021-12-06 18:59:56,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:56,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2021-12-06 18:59:56,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:56,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2021-12-06 18:59:56,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:56,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2021-12-06 18:59:56,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:56,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2021-12-06 18:59:56,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:56,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2021-12-06 18:59:56,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:56,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 304 [2021-12-06 18:59:56,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:56,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 314 [2021-12-06 18:59:56,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:56,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 334 [2021-12-06 18:59:56,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:56,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 343 [2021-12-06 18:59:56,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:56,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 353 [2021-12-06 18:59:56,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:56,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 364 [2021-12-06 18:59:56,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:56,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 372 [2021-12-06 18:59:56,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:56,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 380 [2021-12-06 18:59:56,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:56,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1119 backedges. 31 proven. 2 refuted. 0 times theorem prover too weak. 1086 trivial. 0 not checked. [2021-12-06 18:59:56,999 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:59:56,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176191690] [2021-12-06 18:59:56,999 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176191690] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 18:59:56,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [278803469] [2021-12-06 18:59:56,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:59:56,999 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:59:56,999 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 18:59:57,000 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 18:59:57,000 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2021-12-06 18:59:57,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:59:57,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 1398 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-06 18:59:57,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 18:59:57,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1119 backedges. 285 proven. 0 refuted. 0 times theorem prover too weak. 834 trivial. 0 not checked. [2021-12-06 18:59:57,361 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 18:59:57,362 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [278803469] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:59:57,362 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 18:59:57,362 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 11 [2021-12-06 18:59:57,362 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126450258] [2021-12-06 18:59:57,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:59:57,363 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 18:59:57,363 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:59:57,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 18:59:57,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-12-06 18:59:57,363 INFO L87 Difference]: Start difference. First operand 4672 states and 5473 transitions. Second operand has 9 states, 9 states have (on average 17.11111111111111) internal successors, (154), 8 states have internal predecessors, (154), 3 states have call successors, (24), 3 states have call predecessors, (24), 4 states have return successors, (23), 4 states have call predecessors, (23), 3 states have call successors, (23) [2021-12-06 18:59:59,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:59:59,089 INFO L93 Difference]: Finished difference Result 8881 states and 10519 transitions. [2021-12-06 18:59:59,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 18:59:59,090 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.11111111111111) internal successors, (154), 8 states have internal predecessors, (154), 3 states have call successors, (24), 3 states have call predecessors, (24), 4 states have return successors, (23), 4 states have call predecessors, (23), 3 states have call successors, (23) Word has length 397 [2021-12-06 18:59:59,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:59:59,097 INFO L225 Difference]: With dead ends: 8881 [2021-12-06 18:59:59,097 INFO L226 Difference]: Without dead ends: 6532 [2021-12-06 18:59:59,099 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 467 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2021-12-06 18:59:59,099 INFO L933 BasicCegarLoop]: 395 mSDtfsCounter, 553 mSDsluCounter, 1828 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 2223 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 18:59:59,099 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [553 Valid, 2223 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 18:59:59,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6532 states. [2021-12-06 19:00:00,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6532 to 4648. [2021-12-06 19:00:00,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4648 states, 3898 states have (on average 1.1521292970754233) internal successors, (4491), 3926 states have internal predecessors, (4491), 463 states have call successors, (463), 286 states have call predecessors, (463), 286 states have return successors, (463), 435 states have call predecessors, (463), 463 states have call successors, (463) [2021-12-06 19:00:00,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4648 states to 4648 states and 5417 transitions. [2021-12-06 19:00:00,020 INFO L78 Accepts]: Start accepts. Automaton has 4648 states and 5417 transitions. Word has length 397 [2021-12-06 19:00:00,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:00:00,021 INFO L470 AbstractCegarLoop]: Abstraction has 4648 states and 5417 transitions. [2021-12-06 19:00:00,021 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.11111111111111) internal successors, (154), 8 states have internal predecessors, (154), 3 states have call successors, (24), 3 states have call predecessors, (24), 4 states have return successors, (23), 4 states have call predecessors, (23), 3 states have call successors, (23) [2021-12-06 19:00:00,021 INFO L276 IsEmpty]: Start isEmpty. Operand 4648 states and 5417 transitions. [2021-12-06 19:00:00,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2021-12-06 19:00:00,024 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:00:00,024 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 10, 9, 8, 8, 8, 7, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 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, 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 19:00:00,044 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2021-12-06 19:00:00,225 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:00:00,226 INFO L402 AbstractCegarLoop]: === Iteration 68 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:00:00,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:00:00,227 INFO L85 PathProgramCache]: Analyzing trace with hash -666718099, now seen corresponding path program 1 times [2021-12-06 19:00:00,227 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:00:00,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981530960] [2021-12-06 19:00:00,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:00:00,228 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:00:00,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:00,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 19:00:00,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:00,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 19:00:00,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:00,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 19:00:00,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:00,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 19:00:00,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:00,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 19:00:00,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:00,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:00:00,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:00,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 19:00:00,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:00,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 19:00:00,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:00,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 19:00:00,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:00,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 19:00:00,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:00,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 19:00:00,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:00,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 19:00:00,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:00,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 19:00:00,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:00,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 19:00:00,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:00,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 19:00:00,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:00,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 19:00:00,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:00,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-06 19:00:00,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:00,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-12-06 19:00:00,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:00,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-12-06 19:00:00,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:00,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2021-12-06 19:00:00,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:00,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2021-12-06 19:00:00,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:00,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2021-12-06 19:00:00,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:00,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2021-12-06 19:00:00,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:00,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2021-12-06 19:00:00,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:00,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2021-12-06 19:00:00,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:00,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2021-12-06 19:00:00,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:00,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 304 [2021-12-06 19:00:00,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:00,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 314 [2021-12-06 19:00:00,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:00,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 334 [2021-12-06 19:00:00,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:00,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 343 [2021-12-06 19:00:00,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:00,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 353 [2021-12-06 19:00:00,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:00,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 364 [2021-12-06 19:00:00,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:00,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 372 [2021-12-06 19:00:00,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:00,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 380 [2021-12-06 19:00:00,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:00,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1119 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 1086 trivial. 0 not checked. [2021-12-06 19:00:00,380 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:00:00,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981530960] [2021-12-06 19:00:00,380 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981530960] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:00:00,380 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:00:00,380 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-06 19:00:00,380 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700160112] [2021-12-06 19:00:00,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:00:00,381 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-06 19:00:00,381 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:00:00,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-06 19:00:00,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-12-06 19:00:00,381 INFO L87 Difference]: Start difference. First operand 4648 states and 5417 transitions. Second operand has 10 states, 10 states have (on average 13.3) internal successors, (133), 8 states have internal predecessors, (133), 3 states have call successors, (24), 3 states have call predecessors, (24), 2 states have return successors, (23), 3 states have call predecessors, (23), 2 states have call successors, (23) [2021-12-06 19:00:02,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:00:02,689 INFO L93 Difference]: Finished difference Result 9369 states and 11093 transitions. [2021-12-06 19:00:02,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-06 19:00:02,690 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.3) internal successors, (133), 8 states have internal predecessors, (133), 3 states have call successors, (24), 3 states have call predecessors, (24), 2 states have return successors, (23), 3 states have call predecessors, (23), 2 states have call successors, (23) Word has length 397 [2021-12-06 19:00:02,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:00:02,698 INFO L225 Difference]: With dead ends: 9369 [2021-12-06 19:00:02,698 INFO L226 Difference]: Without dead ends: 7172 [2021-12-06 19:00:02,700 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2021-12-06 19:00:02,700 INFO L933 BasicCegarLoop]: 413 mSDtfsCounter, 630 mSDsluCounter, 2080 mSDsCounter, 0 mSdLazyCounter, 1132 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 649 SdHoareTripleChecker+Valid, 2493 SdHoareTripleChecker+Invalid, 1286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 1132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-06 19:00:02,700 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [649 Valid, 2493 Invalid, 1286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 1132 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-06 19:00:02,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7172 states. [2021-12-06 19:00:03,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7172 to 4612. [2021-12-06 19:00:03,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4612 states, 3862 states have (on average 1.149404453650958) internal successors, (4439), 3890 states have internal predecessors, (4439), 463 states have call successors, (463), 286 states have call predecessors, (463), 286 states have return successors, (463), 435 states have call predecessors, (463), 463 states have call successors, (463) [2021-12-06 19:00:03,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4612 states to 4612 states and 5365 transitions. [2021-12-06 19:00:03,648 INFO L78 Accepts]: Start accepts. Automaton has 4612 states and 5365 transitions. Word has length 397 [2021-12-06 19:00:03,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:00:03,648 INFO L470 AbstractCegarLoop]: Abstraction has 4612 states and 5365 transitions. [2021-12-06 19:00:03,648 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.3) internal successors, (133), 8 states have internal predecessors, (133), 3 states have call successors, (24), 3 states have call predecessors, (24), 2 states have return successors, (23), 3 states have call predecessors, (23), 2 states have call successors, (23) [2021-12-06 19:00:03,648 INFO L276 IsEmpty]: Start isEmpty. Operand 4612 states and 5365 transitions. [2021-12-06 19:00:03,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2021-12-06 19:00:03,653 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:00:03,653 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 10, 9, 8, 8, 8, 7, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 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, 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 19:00:03,653 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2021-12-06 19:00:03,653 INFO L402 AbstractCegarLoop]: === Iteration 69 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:00:03,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:00:03,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1059745109, now seen corresponding path program 1 times [2021-12-06 19:00:03,654 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:00:03,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849593308] [2021-12-06 19:00:03,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:00:03,654 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:00:03,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:03,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 19:00:03,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:03,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 19:00:03,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:03,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 19:00:03,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:03,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 19:00:03,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:03,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 19:00:03,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:03,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:00:03,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:03,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 19:00:03,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:03,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 19:00:03,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:03,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 19:00:03,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:03,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 19:00:03,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:03,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 19:00:03,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:03,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 19:00:03,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:03,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 19:00:03,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:03,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 19:00:03,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:03,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 19:00:03,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:03,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 19:00:03,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:03,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-06 19:00:03,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:03,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-12-06 19:00:03,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:03,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-12-06 19:00:03,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:03,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2021-12-06 19:00:03,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:03,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2021-12-06 19:00:03,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:03,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2021-12-06 19:00:03,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:03,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2021-12-06 19:00:03,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:03,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2021-12-06 19:00:03,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:03,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2021-12-06 19:00:03,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:03,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2021-12-06 19:00:03,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:03,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 304 [2021-12-06 19:00:03,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:03,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 314 [2021-12-06 19:00:03,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:03,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 334 [2021-12-06 19:00:03,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:03,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 343 [2021-12-06 19:00:03,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:03,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 353 [2021-12-06 19:00:03,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:03,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 364 [2021-12-06 19:00:03,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:03,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 372 [2021-12-06 19:00:03,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:03,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 380 [2021-12-06 19:00:03,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:03,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1119 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1115 trivial. 0 not checked. [2021-12-06 19:00:03,756 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:00:03,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849593308] [2021-12-06 19:00:03,756 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849593308] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:00:03,756 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:00:03,756 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 19:00:03,756 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096189303] [2021-12-06 19:00:03,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:00:03,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 19:00:03,757 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:00:03,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 19:00:03,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 19:00:03,757 INFO L87 Difference]: Start difference. First operand 4612 states and 5365 transitions. Second operand has 5 states, 5 states have (on average 24.0) internal successors, (120), 4 states have internal predecessors, (120), 4 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2021-12-06 19:00:05,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:00:05,040 INFO L93 Difference]: Finished difference Result 7492 states and 8862 transitions. [2021-12-06 19:00:05,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 19:00:05,041 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 4 states have internal predecessors, (120), 4 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 397 [2021-12-06 19:00:05,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:00:05,047 INFO L225 Difference]: With dead ends: 7492 [2021-12-06 19:00:05,047 INFO L226 Difference]: Without dead ends: 5331 [2021-12-06 19:00:05,049 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 19:00:05,050 INFO L933 BasicCegarLoop]: 294 mSDtfsCounter, 121 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 19:00:05,050 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [133 Valid, 881 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 19:00:05,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5331 states. [2021-12-06 19:00:05,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5331 to 4608. [2021-12-06 19:00:05,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4608 states, 3858 states have (on average 1.1454121306376361) internal successors, (4419), 3886 states have internal predecessors, (4419), 463 states have call successors, (463), 286 states have call predecessors, (463), 286 states have return successors, (463), 435 states have call predecessors, (463), 463 states have call successors, (463) [2021-12-06 19:00:05,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4608 states to 4608 states and 5345 transitions. [2021-12-06 19:00:05,970 INFO L78 Accepts]: Start accepts. Automaton has 4608 states and 5345 transitions. Word has length 397 [2021-12-06 19:00:05,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:00:05,970 INFO L470 AbstractCegarLoop]: Abstraction has 4608 states and 5345 transitions. [2021-12-06 19:00:05,970 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 4 states have internal predecessors, (120), 4 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2021-12-06 19:00:05,970 INFO L276 IsEmpty]: Start isEmpty. Operand 4608 states and 5345 transitions. [2021-12-06 19:00:05,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2021-12-06 19:00:05,973 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:00:05,974 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 10, 9, 8, 8, 8, 7, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 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, 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 19:00:05,974 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2021-12-06 19:00:05,974 INFO L402 AbstractCegarLoop]: === Iteration 70 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:00:05,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:00:05,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1258621476, now seen corresponding path program 1 times [2021-12-06 19:00:05,974 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:00:05,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375436303] [2021-12-06 19:00:05,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:00:05,974 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:00:06,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:06,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 19:00:06,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:06,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 19:00:06,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:06,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 19:00:06,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:06,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 19:00:06,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:06,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 19:00:06,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:06,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:00:06,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:06,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 19:00:06,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:06,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 19:00:06,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:06,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 19:00:06,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:06,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 19:00:06,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:06,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 19:00:06,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:06,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 19:00:06,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:06,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 19:00:06,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:06,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 19:00:06,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:06,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 19:00:06,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:06,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 19:00:06,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:06,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-06 19:00:06,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:06,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-12-06 19:00:06,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:06,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-12-06 19:00:06,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:06,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2021-12-06 19:00:06,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:06,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2021-12-06 19:00:06,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:06,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2021-12-06 19:00:06,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:06,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2021-12-06 19:00:06,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:06,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2021-12-06 19:00:06,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:06,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2021-12-06 19:00:06,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:06,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2021-12-06 19:00:06,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:06,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 304 [2021-12-06 19:00:06,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:06,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 314 [2021-12-06 19:00:06,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:06,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 334 [2021-12-06 19:00:06,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:06,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 343 [2021-12-06 19:00:06,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:06,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 353 [2021-12-06 19:00:06,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:06,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 364 [2021-12-06 19:00:06,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:06,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 372 [2021-12-06 19:00:06,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:06,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 380 [2021-12-06 19:00:06,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:06,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1119 backedges. 57 proven. 55 refuted. 0 times theorem prover too weak. 1007 trivial. 0 not checked. [2021-12-06 19:00:06,195 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:00:06,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375436303] [2021-12-06 19:00:06,195 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375436303] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:00:06,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636123559] [2021-12-06 19:00:06,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:00:06,195 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:00:06,195 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:00:06,196 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:00:06,197 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2021-12-06 19:00:06,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:06,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 1393 conjuncts, 62 conjunts are in the unsatisfiable core [2021-12-06 19:00:06,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:00:07,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1119 backedges. 581 proven. 221 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2021-12-06 19:00:07,139 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:00:07,896 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger: modulus not positive [2021-12-06 19:00:07,896 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-06 19:00:07,896 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2021-12-06 19:00:07,896 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156974392] [2021-12-06 19:00:07,896 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-06 19:00:07,897 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-06 19:00:07,897 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:00:07,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-06 19:00:07,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=2270, Unknown=0, NotChecked=0, Total=2450 [2021-12-06 19:00:07,897 INFO L87 Difference]: Start difference. First operand 4608 states and 5345 transitions. Second operand has 14 states, 14 states have (on average 11.5) internal successors, (161), 11 states have internal predecessors, (161), 4 states have call successors, (27), 3 states have call predecessors, (27), 6 states have return successors, (26), 6 states have call predecessors, (26), 4 states have call successors, (26) [2021-12-06 19:00:12,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:00:12,346 INFO L93 Difference]: Finished difference Result 14952 states and 17641 transitions. [2021-12-06 19:00:12,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-12-06 19:00:12,346 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 11.5) internal successors, (161), 11 states have internal predecessors, (161), 4 states have call successors, (27), 3 states have call predecessors, (27), 6 states have return successors, (26), 6 states have call predecessors, (26), 4 states have call successors, (26) Word has length 397 [2021-12-06 19:00:12,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:00:12,362 INFO L225 Difference]: With dead ends: 14952 [2021-12-06 19:00:12,362 INFO L226 Difference]: Without dead ends: 12299 [2021-12-06 19:00:12,367 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 835 GetRequests, 748 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1447 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=652, Invalid=7180, Unknown=0, NotChecked=0, Total=7832 [2021-12-06 19:00:12,367 INFO L933 BasicCegarLoop]: 448 mSDtfsCounter, 935 mSDsluCounter, 3145 mSDsCounter, 0 mSdLazyCounter, 1981 mSolverCounterSat, 349 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 952 SdHoareTripleChecker+Valid, 3593 SdHoareTripleChecker+Invalid, 2330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 349 IncrementalHoareTripleChecker+Valid, 1981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-06 19:00:12,367 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [952 Valid, 3593 Invalid, 2330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [349 Valid, 1981 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-06 19:00:12,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12299 states. [2021-12-06 19:00:13,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12299 to 5840. [2021-12-06 19:00:13,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5840 states, 4873 states have (on average 1.142006977221424) internal successors, (5565), 4908 states have internal predecessors, (5565), 593 states have call successors, (593), 373 states have call predecessors, (593), 373 states have return successors, (593), 558 states have call predecessors, (593), 593 states have call successors, (593) [2021-12-06 19:00:13,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5840 states to 5840 states and 6751 transitions. [2021-12-06 19:00:13,687 INFO L78 Accepts]: Start accepts. Automaton has 5840 states and 6751 transitions. Word has length 397 [2021-12-06 19:00:13,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:00:13,687 INFO L470 AbstractCegarLoop]: Abstraction has 5840 states and 6751 transitions. [2021-12-06 19:00:13,687 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 11.5) internal successors, (161), 11 states have internal predecessors, (161), 4 states have call successors, (27), 3 states have call predecessors, (27), 6 states have return successors, (26), 6 states have call predecessors, (26), 4 states have call successors, (26) [2021-12-06 19:00:13,687 INFO L276 IsEmpty]: Start isEmpty. Operand 5840 states and 6751 transitions. [2021-12-06 19:00:13,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2021-12-06 19:00:13,692 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:00:13,692 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 10, 9, 8, 8, 8, 7, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:00:13,712 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2021-12-06 19:00:13,892 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable69 [2021-12-06 19:00:13,893 INFO L402 AbstractCegarLoop]: === Iteration 71 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:00:13,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:00:13,894 INFO L85 PathProgramCache]: Analyzing trace with hash 860577601, now seen corresponding path program 1 times [2021-12-06 19:00:13,894 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:00:13,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531839612] [2021-12-06 19:00:13,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:00:13,895 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:00:13,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:14,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 19:00:14,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:14,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 19:00:14,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:14,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 19:00:14,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:14,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 19:00:14,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:14,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 19:00:14,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:14,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:00:14,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:14,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 19:00:14,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:14,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 19:00:14,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:14,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 19:00:14,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:14,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 19:00:14,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:14,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 19:00:14,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:14,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 19:00:14,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:14,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 19:00:14,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:14,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 19:00:14,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:14,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 19:00:14,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:14,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 19:00:14,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:14,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-06 19:00:14,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:14,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-12-06 19:00:14,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:14,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-12-06 19:00:14,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:14,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2021-12-06 19:00:14,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:14,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2021-12-06 19:00:14,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:14,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2021-12-06 19:00:14,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:14,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2021-12-06 19:00:14,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:14,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2021-12-06 19:00:14,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:14,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 288 [2021-12-06 19:00:14,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:14,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 295 [2021-12-06 19:00:14,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:14,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 306 [2021-12-06 19:00:14,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:14,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 316 [2021-12-06 19:00:14,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:14,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 336 [2021-12-06 19:00:14,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:14,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 345 [2021-12-06 19:00:14,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:14,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 355 [2021-12-06 19:00:14,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:14,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 366 [2021-12-06 19:00:14,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:14,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 374 [2021-12-06 19:00:14,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:14,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 382 [2021-12-06 19:00:14,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:14,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1117 backedges. 4 proven. 32 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2021-12-06 19:00:14,101 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:00:14,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531839612] [2021-12-06 19:00:14,101 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531839612] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:00:14,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101796633] [2021-12-06 19:00:14,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:00:14,101 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:00:14,101 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:00:14,102 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:00:14,102 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2021-12-06 19:00:14,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:14,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 1408 conjuncts, 62 conjunts are in the unsatisfiable core [2021-12-06 19:00:14,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:00:15,022 INFO L134 CoverageAnalysis]: Checked inductivity of 1117 backedges. 579 proven. 221 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2021-12-06 19:00:15,022 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:00:15,830 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger: modulus not positive [2021-12-06 19:00:15,830 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-06 19:00:15,830 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2021-12-06 19:00:15,830 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773771669] [2021-12-06 19:00:15,830 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-06 19:00:15,830 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-06 19:00:15,831 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:00:15,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-06 19:00:15,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=2078, Unknown=0, NotChecked=0, Total=2256 [2021-12-06 19:00:15,831 INFO L87 Difference]: Start difference. First operand 5840 states and 6751 transitions. Second operand has 12 states, 12 states have (on average 12.333333333333334) internal successors, (148), 11 states have internal predecessors, (148), 7 states have call successors, (27), 3 states have call predecessors, (27), 1 states have return successors, (26), 6 states have call predecessors, (26), 6 states have call successors, (26) [2021-12-06 19:00:21,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:00:21,050 INFO L93 Difference]: Finished difference Result 18411 states and 21328 transitions. [2021-12-06 19:00:21,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-12-06 19:00:21,051 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 12.333333333333334) internal successors, (148), 11 states have internal predecessors, (148), 7 states have call successors, (27), 3 states have call predecessors, (27), 1 states have return successors, (26), 6 states have call predecessors, (26), 6 states have call successors, (26) Word has length 399 [2021-12-06 19:00:21,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:00:21,069 INFO L225 Difference]: With dead ends: 18411 [2021-12-06 19:00:21,069 INFO L226 Difference]: Without dead ends: 15672 [2021-12-06 19:00:21,073 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 820 GetRequests, 738 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1338 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=680, Invalid=6292, Unknown=0, NotChecked=0, Total=6972 [2021-12-06 19:00:21,074 INFO L933 BasicCegarLoop]: 599 mSDtfsCounter, 709 mSDsluCounter, 2277 mSDsCounter, 0 mSdLazyCounter, 2177 mSolverCounterSat, 290 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 709 SdHoareTripleChecker+Valid, 2876 SdHoareTripleChecker+Invalid, 2467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 290 IncrementalHoareTripleChecker+Valid, 2177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-12-06 19:00:21,074 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [709 Valid, 2876 Invalid, 2467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [290 Valid, 2177 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-12-06 19:00:21,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15672 states. [2021-12-06 19:00:22,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15672 to 7984. [2021-12-06 19:00:22,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7984 states, 6626 states have (on average 1.139903410805916) internal successors, (7553), 6680 states have internal predecessors, (7553), 840 states have call successors, (840), 517 states have call predecessors, (840), 517 states have return successors, (840), 786 states have call predecessors, (840), 840 states have call successors, (840) [2021-12-06 19:00:22,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7984 states to 7984 states and 9233 transitions. [2021-12-06 19:00:22,852 INFO L78 Accepts]: Start accepts. Automaton has 7984 states and 9233 transitions. Word has length 399 [2021-12-06 19:00:22,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:00:22,853 INFO L470 AbstractCegarLoop]: Abstraction has 7984 states and 9233 transitions. [2021-12-06 19:00:22,853 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.333333333333334) internal successors, (148), 11 states have internal predecessors, (148), 7 states have call successors, (27), 3 states have call predecessors, (27), 1 states have return successors, (26), 6 states have call predecessors, (26), 6 states have call successors, (26) [2021-12-06 19:00:22,853 INFO L276 IsEmpty]: Start isEmpty. Operand 7984 states and 9233 transitions. [2021-12-06 19:00:22,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2021-12-06 19:00:22,858 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:00:22,858 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 10, 9, 8, 8, 8, 7, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:00:22,878 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2021-12-06 19:00:23,059 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable70 [2021-12-06 19:00:23,060 INFO L402 AbstractCegarLoop]: === Iteration 72 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:00:23,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:00:23,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1627317021, now seen corresponding path program 1 times [2021-12-06 19:00:23,061 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:00:23,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985775931] [2021-12-06 19:00:23,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:00:23,062 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:00:23,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:23,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 19:00:23,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:23,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 19:00:23,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:23,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 19:00:23,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:23,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 19:00:23,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:23,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 19:00:23,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:23,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:00:23,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:23,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 19:00:23,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:23,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 19:00:23,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:23,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 19:00:23,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:23,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 19:00:23,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:23,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 19:00:23,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:23,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 19:00:23,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:23,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 19:00:23,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:23,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 19:00:23,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:23,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 19:00:23,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:23,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 19:00:23,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:23,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-06 19:00:23,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:23,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-12-06 19:00:23,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:23,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2021-12-06 19:00:23,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:23,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2021-12-06 19:00:23,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:23,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2021-12-06 19:00:23,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:23,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2021-12-06 19:00:23,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:23,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2021-12-06 19:00:23,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:23,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 279 [2021-12-06 19:00:23,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:23,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 289 [2021-12-06 19:00:23,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:23,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 296 [2021-12-06 19:00:23,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:23,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 307 [2021-12-06 19:00:23,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:23,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 317 [2021-12-06 19:00:23,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:23,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 337 [2021-12-06 19:00:23,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:23,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 346 [2021-12-06 19:00:23,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:23,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 356 [2021-12-06 19:00:23,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:23,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 367 [2021-12-06 19:00:23,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:23,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 375 [2021-12-06 19:00:23,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:23,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 383 [2021-12-06 19:00:23,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:23,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1117 backedges. 4 proven. 32 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2021-12-06 19:00:23,273 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:00:23,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985775931] [2021-12-06 19:00:23,273 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985775931] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:00:23,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [311980278] [2021-12-06 19:00:23,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:00:23,274 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:00:23,274 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:00:23,274 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:00:23,275 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2021-12-06 19:00:23,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:23,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 1409 conjuncts, 62 conjunts are in the unsatisfiable core [2021-12-06 19:00:23,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:00:24,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1117 backedges. 579 proven. 221 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2021-12-06 19:00:24,259 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:00:25,089 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger: modulus not positive [2021-12-06 19:00:25,089 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-06 19:00:25,090 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2021-12-06 19:00:25,090 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406748086] [2021-12-06 19:00:25,090 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-06 19:00:25,090 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-06 19:00:25,090 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:00:25,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-06 19:00:25,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=2078, Unknown=0, NotChecked=0, Total=2256 [2021-12-06 19:00:25,091 INFO L87 Difference]: Start difference. First operand 7984 states and 9233 transitions. Second operand has 12 states, 12 states have (on average 12.416666666666666) internal successors, (149), 11 states have internal predecessors, (149), 7 states have call successors, (27), 3 states have call predecessors, (27), 1 states have return successors, (26), 6 states have call predecessors, (26), 6 states have call successors, (26) [2021-12-06 19:00:31,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:00:31,299 INFO L93 Difference]: Finished difference Result 23460 states and 27174 transitions. [2021-12-06 19:00:31,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-12-06 19:00:31,299 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 12.416666666666666) internal successors, (149), 11 states have internal predecessors, (149), 7 states have call successors, (27), 3 states have call predecessors, (27), 1 states have return successors, (26), 6 states have call predecessors, (26), 6 states have call successors, (26) Word has length 400 [2021-12-06 19:00:31,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:00:31,323 INFO L225 Difference]: With dead ends: 23460 [2021-12-06 19:00:31,323 INFO L226 Difference]: Without dead ends: 19662 [2021-12-06 19:00:31,329 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 822 GetRequests, 740 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1336 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=680, Invalid=6292, Unknown=0, NotChecked=0, Total=6972 [2021-12-06 19:00:31,329 INFO L933 BasicCegarLoop]: 629 mSDtfsCounter, 643 mSDsluCounter, 2670 mSDsCounter, 0 mSdLazyCounter, 2474 mSolverCounterSat, 311 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 643 SdHoareTripleChecker+Valid, 3299 SdHoareTripleChecker+Invalid, 2785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 311 IncrementalHoareTripleChecker+Valid, 2474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-06 19:00:31,329 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [643 Valid, 3299 Invalid, 2785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [311 Valid, 2474 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-12-06 19:00:31,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19662 states. [2021-12-06 19:00:33,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19662 to 7984. [2021-12-06 19:00:33,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7984 states, 6626 states have (on average 1.139903410805916) internal successors, (7553), 6680 states have internal predecessors, (7553), 840 states have call successors, (840), 517 states have call predecessors, (840), 517 states have return successors, (840), 786 states have call predecessors, (840), 840 states have call successors, (840) [2021-12-06 19:00:33,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7984 states to 7984 states and 9233 transitions. [2021-12-06 19:00:33,168 INFO L78 Accepts]: Start accepts. Automaton has 7984 states and 9233 transitions. Word has length 400 [2021-12-06 19:00:33,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:00:33,168 INFO L470 AbstractCegarLoop]: Abstraction has 7984 states and 9233 transitions. [2021-12-06 19:00:33,169 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.416666666666666) internal successors, (149), 11 states have internal predecessors, (149), 7 states have call successors, (27), 3 states have call predecessors, (27), 1 states have return successors, (26), 6 states have call predecessors, (26), 6 states have call successors, (26) [2021-12-06 19:00:33,169 INFO L276 IsEmpty]: Start isEmpty. Operand 7984 states and 9233 transitions. [2021-12-06 19:00:33,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2021-12-06 19:00:33,174 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:00:33,174 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 10, 9, 8, 8, 8, 7, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:00:33,194 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2021-12-06 19:00:33,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:00:33,376 INFO L402 AbstractCegarLoop]: === Iteration 73 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:00:33,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:00:33,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1928199716, now seen corresponding path program 1 times [2021-12-06 19:00:33,377 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:00:33,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865776792] [2021-12-06 19:00:33,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:00:33,378 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:00:33,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:33,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 19:00:33,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:33,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 19:00:33,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:33,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 19:00:33,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:33,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 19:00:33,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:33,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 19:00:33,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:33,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:00:33,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:33,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 19:00:33,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:33,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 19:00:33,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:33,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 19:00:33,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:33,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 19:00:33,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:33,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 19:00:33,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:33,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 19:00:33,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:33,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 19:00:33,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:33,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 19:00:33,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:33,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 19:00:33,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:33,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 19:00:33,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:33,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-06 19:00:33,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:33,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-12-06 19:00:33,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:33,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2021-12-06 19:00:33,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:33,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2021-12-06 19:00:33,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:33,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2021-12-06 19:00:33,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:33,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2021-12-06 19:00:33,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:33,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2021-12-06 19:00:33,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:33,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2021-12-06 19:00:33,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:33,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 290 [2021-12-06 19:00:33,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:33,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 297 [2021-12-06 19:00:33,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:33,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 308 [2021-12-06 19:00:33,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:33,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 318 [2021-12-06 19:00:33,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:33,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 338 [2021-12-06 19:00:33,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:33,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 347 [2021-12-06 19:00:33,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:33,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 357 [2021-12-06 19:00:33,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:33,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 368 [2021-12-06 19:00:33,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:33,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2021-12-06 19:00:33,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:33,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 384 [2021-12-06 19:00:33,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:33,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1117 backedges. 4 proven. 32 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2021-12-06 19:00:33,595 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:00:33,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865776792] [2021-12-06 19:00:33,595 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865776792] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:00:33,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367310358] [2021-12-06 19:00:33,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:00:33,595 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:00:33,595 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:00:33,596 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:00:33,596 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2021-12-06 19:00:33,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:33,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 1410 conjuncts, 62 conjunts are in the unsatisfiable core [2021-12-06 19:00:33,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:00:34,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1117 backedges. 579 proven. 221 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2021-12-06 19:00:34,522 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:00:35,260 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger: modulus not positive [2021-12-06 19:00:35,260 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-06 19:00:35,260 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2021-12-06 19:00:35,260 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339179313] [2021-12-06 19:00:35,260 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-06 19:00:35,260 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-06 19:00:35,260 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:00:35,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-06 19:00:35,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=2079, Unknown=0, NotChecked=0, Total=2256 [2021-12-06 19:00:35,261 INFO L87 Difference]: Start difference. First operand 7984 states and 9233 transitions. Second operand has 12 states, 12 states have (on average 12.5) internal successors, (150), 11 states have internal predecessors, (150), 7 states have call successors, (27), 3 states have call predecessors, (27), 1 states have return successors, (26), 6 states have call predecessors, (26), 6 states have call successors, (26) [2021-12-06 19:00:41,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:00:41,702 INFO L93 Difference]: Finished difference Result 22445 states and 25997 transitions. [2021-12-06 19:00:41,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-12-06 19:00:41,703 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 12.5) internal successors, (150), 11 states have internal predecessors, (150), 7 states have call successors, (27), 3 states have call predecessors, (27), 1 states have return successors, (26), 6 states have call predecessors, (26), 6 states have call successors, (26) Word has length 401 [2021-12-06 19:00:41,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:00:41,726 INFO L225 Difference]: With dead ends: 22445 [2021-12-06 19:00:41,726 INFO L226 Difference]: Without dead ends: 18647 [2021-12-06 19:00:41,731 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 828 GetRequests, 742 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1448 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=745, Invalid=6911, Unknown=0, NotChecked=0, Total=7656 [2021-12-06 19:00:41,732 INFO L933 BasicCegarLoop]: 656 mSDtfsCounter, 544 mSDsluCounter, 2866 mSDsCounter, 0 mSdLazyCounter, 2574 mSolverCounterSat, 280 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 3522 SdHoareTripleChecker+Invalid, 2854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 280 IncrementalHoareTripleChecker+Valid, 2574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-06 19:00:41,732 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [544 Valid, 3522 Invalid, 2854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [280 Valid, 2574 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-12-06 19:00:41,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18647 states. [2021-12-06 19:00:43,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18647 to 7652. [2021-12-06 19:00:43,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7652 states, 6320 states have (on average 1.1375) internal successors, (7189), 6374 states have internal predecessors, (7189), 827 states have call successors, (827), 504 states have call predecessors, (827), 504 states have return successors, (827), 773 states have call predecessors, (827), 827 states have call successors, (827) [2021-12-06 19:00:43,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7652 states to 7652 states and 8843 transitions. [2021-12-06 19:00:43,488 INFO L78 Accepts]: Start accepts. Automaton has 7652 states and 8843 transitions. Word has length 401 [2021-12-06 19:00:43,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:00:43,489 INFO L470 AbstractCegarLoop]: Abstraction has 7652 states and 8843 transitions. [2021-12-06 19:00:43,489 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.5) internal successors, (150), 11 states have internal predecessors, (150), 7 states have call successors, (27), 3 states have call predecessors, (27), 1 states have return successors, (26), 6 states have call predecessors, (26), 6 states have call successors, (26) [2021-12-06 19:00:43,489 INFO L276 IsEmpty]: Start isEmpty. Operand 7652 states and 8843 transitions. [2021-12-06 19:00:43,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2021-12-06 19:00:43,494 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:00:43,494 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 10, 9, 8, 8, 8, 7, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:00:43,514 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2021-12-06 19:00:43,695 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:00:43,696 INFO L402 AbstractCegarLoop]: === Iteration 74 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:00:43,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:00:43,697 INFO L85 PathProgramCache]: Analyzing trace with hash -2056129788, now seen corresponding path program 1 times [2021-12-06 19:00:43,698 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:00:43,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142838923] [2021-12-06 19:00:43,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:00:43,699 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:00:43,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:43,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 19:00:43,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:43,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 19:00:43,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:43,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 19:00:43,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:43,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 19:00:43,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:43,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 19:00:43,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:43,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:00:43,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:43,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 19:00:43,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:43,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 19:00:43,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:43,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 19:00:43,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:43,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 19:00:43,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:43,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 19:00:43,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:43,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 19:00:43,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:43,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 19:00:43,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:43,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 19:00:43,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:43,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 19:00:43,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:43,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 19:00:43,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:43,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-06 19:00:43,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:43,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-12-06 19:00:43,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:43,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-12-06 19:00:43,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:43,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2021-12-06 19:00:43,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:43,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2021-12-06 19:00:43,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:43,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2021-12-06 19:00:43,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:43,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2021-12-06 19:00:43,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:43,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2021-12-06 19:00:43,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:43,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 290 [2021-12-06 19:00:43,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:43,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 297 [2021-12-06 19:00:43,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:43,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 308 [2021-12-06 19:00:43,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:43,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 318 [2021-12-06 19:00:43,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:43,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 338 [2021-12-06 19:00:43,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:43,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 347 [2021-12-06 19:00:43,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:43,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 357 [2021-12-06 19:00:43,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:43,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 368 [2021-12-06 19:00:43,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:43,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2021-12-06 19:00:43,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:43,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 384 [2021-12-06 19:00:43,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:43,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1115 backedges. 147 proven. 128 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2021-12-06 19:00:43,978 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:00:43,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142838923] [2021-12-06 19:00:43,978 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142838923] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:00:43,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533033242] [2021-12-06 19:00:43,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:00:43,979 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:00:43,979 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:00:43,979 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:00:43,980 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2021-12-06 19:00:44,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:44,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 1423 conjuncts, 62 conjunts are in the unsatisfiable core [2021-12-06 19:00:44,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:00:45,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1115 backedges. 577 proven. 221 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2021-12-06 19:00:45,247 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:00:46,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1115 backedges. 165 proven. 149 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked. [2021-12-06 19:00:46,228 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1533033242] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 19:00:46,228 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 19:00:46,228 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 25, 20] total 48 [2021-12-06 19:00:46,228 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533562985] [2021-12-06 19:00:46,228 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 19:00:46,229 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2021-12-06 19:00:46,229 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:00:46,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-12-06 19:00:46,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=2048, Unknown=0, NotChecked=0, Total=2256 [2021-12-06 19:00:46,230 INFO L87 Difference]: Start difference. First operand 7652 states and 8843 transitions. Second operand has 48 states, 48 states have (on average 8.333333333333334) internal successors, (400), 40 states have internal predecessors, (400), 14 states have call successors, (64), 11 states have call predecessors, (64), 24 states have return successors, (64), 18 states have call predecessors, (64), 14 states have call successors, (64) [2021-12-06 19:00:51,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:00:51,443 INFO L93 Difference]: Finished difference Result 16086 states and 18903 transitions. [2021-12-06 19:00:51,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-12-06 19:00:51,443 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 8.333333333333334) internal successors, (400), 40 states have internal predecessors, (400), 14 states have call successors, (64), 11 states have call predecessors, (64), 24 states have return successors, (64), 18 states have call predecessors, (64), 14 states have call successors, (64) Word has length 401 [2021-12-06 19:00:51,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:00:51,455 INFO L225 Difference]: With dead ends: 16086 [2021-12-06 19:00:51,456 INFO L226 Difference]: Without dead ends: 9030 [2021-12-06 19:00:51,476 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 924 GetRequests, 839 SyntacticMatches, 3 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1635 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=801, Invalid=6171, Unknown=0, NotChecked=0, Total=6972 [2021-12-06 19:00:51,476 INFO L933 BasicCegarLoop]: 302 mSDtfsCounter, 1199 mSDsluCounter, 4865 mSDsCounter, 0 mSdLazyCounter, 3620 mSolverCounterSat, 413 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1219 SdHoareTripleChecker+Valid, 5167 SdHoareTripleChecker+Invalid, 4033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 413 IncrementalHoareTripleChecker+Valid, 3620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-12-06 19:00:51,476 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1219 Valid, 5167 Invalid, 4033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [413 Valid, 3620 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2021-12-06 19:00:51,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9030 states. [2021-12-06 19:00:53,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9030 to 7659. [2021-12-06 19:00:53,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7659 states, 6326 states have (on average 1.1364211191906417) internal successors, (7189), 6380 states have internal predecessors, (7189), 827 states have call successors, (827), 505 states have call predecessors, (827), 505 states have return successors, (827), 773 states have call predecessors, (827), 827 states have call successors, (827) [2021-12-06 19:00:53,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7659 states to 7659 states and 8843 transitions. [2021-12-06 19:00:53,179 INFO L78 Accepts]: Start accepts. Automaton has 7659 states and 8843 transitions. Word has length 401 [2021-12-06 19:00:53,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:00:53,179 INFO L470 AbstractCegarLoop]: Abstraction has 7659 states and 8843 transitions. [2021-12-06 19:00:53,179 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 8.333333333333334) internal successors, (400), 40 states have internal predecessors, (400), 14 states have call successors, (64), 11 states have call predecessors, (64), 24 states have return successors, (64), 18 states have call predecessors, (64), 14 states have call successors, (64) [2021-12-06 19:00:53,179 INFO L276 IsEmpty]: Start isEmpty. Operand 7659 states and 8843 transitions. [2021-12-06 19:00:53,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2021-12-06 19:00:53,184 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:00:53,185 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 11, 11, 11, 10, 10, 9, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:00:53,204 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2021-12-06 19:00:53,385 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:00:53,387 INFO L402 AbstractCegarLoop]: === Iteration 75 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:00:53,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:00:53,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1758866053, now seen corresponding path program 1 times [2021-12-06 19:00:53,389 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:00:53,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758028158] [2021-12-06 19:00:53,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:00:53,390 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:00:53,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:53,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 19:00:53,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:53,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 19:00:53,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:53,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 19:00:53,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:53,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 19:00:53,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:53,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 19:00:53,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:53,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:00:53,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:53,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 19:00:53,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:53,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 19:00:53,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:53,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 19:00:53,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:53,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 19:00:53,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:53,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 19:00:53,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:53,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 19:00:53,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:53,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 19:00:53,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:53,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 19:00:53,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:53,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 19:00:53,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:53,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 19:00:53,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:53,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-06 19:00:53,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:53,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-12-06 19:00:53,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:53,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-12-06 19:00:53,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:53,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2021-12-06 19:00:53,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:53,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2021-12-06 19:00:53,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:53,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2021-12-06 19:00:53,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:53,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2021-12-06 19:00:53,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:53,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 279 [2021-12-06 19:00:53,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:53,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2021-12-06 19:00:53,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:53,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 297 [2021-12-06 19:00:53,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:53,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 306 [2021-12-06 19:00:53,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:53,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 316 [2021-12-06 19:00:53,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:53,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 323 [2021-12-06 19:00:53,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:53,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 334 [2021-12-06 19:00:53,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:53,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 344 [2021-12-06 19:00:53,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:53,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 364 [2021-12-06 19:00:53,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:53,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 373 [2021-12-06 19:00:53,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:53,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 383 [2021-12-06 19:00:53,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:53,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 394 [2021-12-06 19:00:53,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:53,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 402 [2021-12-06 19:00:53,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:53,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 410 [2021-12-06 19:00:53,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:53,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1261 backedges. 9 proven. 36 refuted. 0 times theorem prover too weak. 1216 trivial. 0 not checked. [2021-12-06 19:00:53,661 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:00:53,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758028158] [2021-12-06 19:00:53,661 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758028158] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:00:53,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1706709528] [2021-12-06 19:00:53,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:00:53,661 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:00:53,661 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:00:53,662 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:00:53,662 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2021-12-06 19:00:53,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:00:53,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 1510 conjuncts, 64 conjunts are in the unsatisfiable core [2021-12-06 19:00:53,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:00:54,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1261 backedges. 362 proven. 320 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked. [2021-12-06 19:00:54,599 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:00:55,352 INFO L134 CoverageAnalysis]: Checked inductivity of 1261 backedges. 60 proven. 55 refuted. 0 times theorem prover too weak. 1146 trivial. 0 not checked. [2021-12-06 19:00:55,352 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1706709528] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 19:00:55,352 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 19:00:55,353 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 24, 16] total 50 [2021-12-06 19:00:55,353 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882552052] [2021-12-06 19:00:55,353 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 19:00:55,354 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2021-12-06 19:00:55,354 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:00:55,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-12-06 19:00:55,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=2227, Unknown=0, NotChecked=0, Total=2450 [2021-12-06 19:00:55,354 INFO L87 Difference]: Start difference. First operand 7659 states and 8843 transitions. Second operand has 50 states, 50 states have (on average 8.64) internal successors, (432), 46 states have internal predecessors, (432), 16 states have call successors, (80), 11 states have call predecessors, (80), 12 states have return successors, (79), 17 states have call predecessors, (79), 16 states have call successors, (79) [2021-12-06 19:01:20,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:01:20,789 INFO L93 Difference]: Finished difference Result 39838 states and 47669 transitions. [2021-12-06 19:01:20,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 322 states. [2021-12-06 19:01:20,790 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 8.64) internal successors, (432), 46 states have internal predecessors, (432), 16 states have call successors, (80), 11 states have call predecessors, (80), 12 states have return successors, (79), 17 states have call predecessors, (79), 16 states have call successors, (79) Word has length 427 [2021-12-06 19:01:20,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:01:20,838 INFO L225 Difference]: With dead ends: 39838 [2021-12-06 19:01:20,838 INFO L226 Difference]: Without dead ends: 34691 [2021-12-06 19:01:20,851 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1304 GetRequests, 946 SyntacticMatches, 0 SemanticMatches, 358 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53649 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=10179, Invalid=119061, Unknown=0, NotChecked=0, Total=129240 [2021-12-06 19:01:20,851 INFO L933 BasicCegarLoop]: 1092 mSDtfsCounter, 5946 mSDsluCounter, 18745 mSDsCounter, 0 mSdLazyCounter, 17037 mSolverCounterSat, 3763 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5958 SdHoareTripleChecker+Valid, 19837 SdHoareTripleChecker+Invalid, 20800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3763 IncrementalHoareTripleChecker+Valid, 17037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2021-12-06 19:01:20,851 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5958 Valid, 19837 Invalid, 20800 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3763 Valid, 17037 Invalid, 0 Unknown, 0 Unchecked, 7.6s Time] [2021-12-06 19:01:20,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34691 states. [2021-12-06 19:01:23,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34691 to 10682. [2021-12-06 19:01:23,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10682 states, 8851 states have (on average 1.1402101457462435) internal successors, (10092), 8923 states have internal predecessors, (10092), 1129 states have call successors, (1129), 701 states have call predecessors, (1129), 701 states have return successors, (1129), 1057 states have call predecessors, (1129), 1129 states have call successors, (1129) [2021-12-06 19:01:23,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10682 states to 10682 states and 12350 transitions. [2021-12-06 19:01:23,616 INFO L78 Accepts]: Start accepts. Automaton has 10682 states and 12350 transitions. Word has length 427 [2021-12-06 19:01:23,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:01:23,616 INFO L470 AbstractCegarLoop]: Abstraction has 10682 states and 12350 transitions. [2021-12-06 19:01:23,616 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 8.64) internal successors, (432), 46 states have internal predecessors, (432), 16 states have call successors, (80), 11 states have call predecessors, (80), 12 states have return successors, (79), 17 states have call predecessors, (79), 16 states have call successors, (79) [2021-12-06 19:01:23,617 INFO L276 IsEmpty]: Start isEmpty. Operand 10682 states and 12350 transitions. [2021-12-06 19:01:23,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2021-12-06 19:01:23,623 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:01:23,624 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 11, 11, 11, 10, 10, 9, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:01:23,644 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2021-12-06 19:01:23,824 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:01:23,825 INFO L402 AbstractCegarLoop]: === Iteration 76 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:01:23,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:01:23,827 INFO L85 PathProgramCache]: Analyzing trace with hash 832613405, now seen corresponding path program 1 times [2021-12-06 19:01:23,827 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:01:23,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143156668] [2021-12-06 19:01:23,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:01:23,828 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:01:23,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:01:23,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 19:01:23,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:01:23,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 19:01:23,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:01:23,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-06 19:01:23,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:01:23,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-06 19:01:23,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:01:23,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 19:01:23,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:01:23,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 19:01:23,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:01:23,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 19:01:23,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:01:23,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-06 19:01:23,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:01:23,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 19:01:23,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:01:23,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-06 19:01:23,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:01:23,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 19:01:23,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:01:23,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 19:01:23,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:01:23,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 19:01:23,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:01:23,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-06 19:01:23,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:01:23,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 19:01:23,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:01:23,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-06 19:01:23,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:01:24,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-06 19:01:24,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:01:24,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-12-06 19:01:24,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:01:24,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2021-12-06 19:01:24,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:01:24,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2021-12-06 19:01:24,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:01:24,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2021-12-06 19:01:24,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:01:24,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2021-12-06 19:01:24,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:01:24,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2021-12-06 19:01:24,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:01:24,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2021-12-06 19:01:24,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:01:24,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 288 [2021-12-06 19:01:24,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:01:24,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 298 [2021-12-06 19:01:24,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:01:24,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 307 [2021-12-06 19:01:24,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:01:24,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 317 [2021-12-06 19:01:24,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:01:24,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 324 [2021-12-06 19:01:24,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:01:24,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 335 [2021-12-06 19:01:24,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:01:24,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 345 [2021-12-06 19:01:24,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:01:24,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 365 [2021-12-06 19:01:24,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:01:24,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 374 [2021-12-06 19:01:24,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:01:24,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 384 [2021-12-06 19:01:24,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:01:24,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 395 [2021-12-06 19:01:24,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:01:24,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 403 [2021-12-06 19:01:24,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:01:24,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 411 [2021-12-06 19:01:24,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:01:24,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1261 backedges. 15 proven. 30 refuted. 0 times theorem prover too weak. 1216 trivial. 0 not checked. [2021-12-06 19:01:24,039 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:01:24,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143156668] [2021-12-06 19:01:24,039 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143156668] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:01:24,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493516923] [2021-12-06 19:01:24,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:01:24,039 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:01:24,040 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:01:24,040 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:01:24,041 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2021-12-06 19:01:24,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:01:24,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 1511 conjuncts, 52 conjunts are in the unsatisfiable core [2021-12-06 19:01:24,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:01:24,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1261 backedges. 381 proven. 271 refuted. 0 times theorem prover too weak. 609 trivial. 0 not checked. [2021-12-06 19:01:24,859 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:01:25,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1261 backedges. 35 proven. 75 refuted. 0 times theorem prover too weak. 1151 trivial. 0 not checked. [2021-12-06 19:01:25,506 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [493516923] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 19:01:25,506 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 19:01:25,507 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 19, 16] total 41 [2021-12-06 19:01:25,507 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638898438] [2021-12-06 19:01:25,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 19:01:25,508 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2021-12-06 19:01:25,508 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:01:25,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-12-06 19:01:25,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1519, Unknown=0, NotChecked=0, Total=1640 [2021-12-06 19:01:25,508 INFO L87 Difference]: Start difference. First operand 10682 states and 12350 transitions. Second operand has 41 states, 41 states have (on average 9.268292682926829) internal successors, (380), 38 states have internal predecessors, (380), 12 states have call successors, (67), 8 states have call predecessors, (67), 9 states have return successors, (65), 11 states have call predecessors, (65), 11 states have call successors, (65) [2021-12-06 19:03:01,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:03:01,700 INFO L93 Difference]: Finished difference Result 118658 states and 141951 transitions. [2021-12-06 19:03:01,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 1130 states. [2021-12-06 19:03:01,700 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 9.268292682926829) internal successors, (380), 38 states have internal predecessors, (380), 12 states have call successors, (67), 8 states have call predecessors, (67), 9 states have return successors, (65), 11 states have call predecessors, (65), 11 states have call successors, (65) Word has length 428 [2021-12-06 19:03:01,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:03:01,911 INFO L225 Difference]: With dead ends: 118658 [2021-12-06 19:03:01,911 INFO L226 Difference]: Without dead ends: 111924 [2021-12-06 19:03:02,002 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2285 GetRequests, 1130 SyntacticMatches, 0 SemanticMatches, 1155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 617544 ImplicationChecksByTransitivity, 31.2s TimeCoverageRelationStatistics Valid=58490, Invalid=1279002, Unknown=0, NotChecked=0, Total=1337492 [2021-12-06 19:03:02,003 INFO L933 BasicCegarLoop]: 2779 mSDtfsCounter, 3080 mSDsluCounter, 59520 mSDsCounter, 0 mSdLazyCounter, 52633 mSolverCounterSat, 4471 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3099 SdHoareTripleChecker+Valid, 62299 SdHoareTripleChecker+Invalid, 57104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 4471 IncrementalHoareTripleChecker+Valid, 52633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.4s IncrementalHoareTripleChecker+Time [2021-12-06 19:03:02,003 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3099 Valid, 62299 Invalid, 57104 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [4471 Valid, 52633 Invalid, 0 Unknown, 0 Unchecked, 22.4s Time] [2021-12-06 19:03:02,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111924 states. [2021-12-06 19:03:08,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111924 to 18952. [2021-12-06 19:03:08,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18952 states, 15790 states have (on average 1.1450918302723243) internal successors, (18081), 15907 states have internal predecessors, (18081), 1927 states have call successors, (1927), 1234 states have call predecessors, (1927), 1234 states have return successors, (1927), 1810 states have call predecessors, (1927), 1927 states have call successors, (1927) [2021-12-06 19:03:08,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18952 states to 18952 states and 21935 transitions. [2021-12-06 19:03:08,062 INFO L78 Accepts]: Start accepts. Automaton has 18952 states and 21935 transitions. Word has length 428 [2021-12-06 19:03:08,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:03:08,062 INFO L470 AbstractCegarLoop]: Abstraction has 18952 states and 21935 transitions. [2021-12-06 19:03:08,063 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 9.268292682926829) internal successors, (380), 38 states have internal predecessors, (380), 12 states have call successors, (67), 8 states have call predecessors, (67), 9 states have return successors, (65), 11 states have call predecessors, (65), 11 states have call successors, (65) [2021-12-06 19:03:08,063 INFO L276 IsEmpty]: Start isEmpty. Operand 18952 states and 21935 transitions. [2021-12-06 19:03:08,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2021-12-06 19:03:08,075 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:03:08,075 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 11, 11, 11, 10, 10, 9, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:03:08,096 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2021-12-06 19:03:08,276 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:03:08,277 INFO L402 AbstractCegarLoop]: === Iteration 77 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:03:08,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:03:08,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1326878899, now seen corresponding path program 1 times [2021-12-06 19:03:08,279 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:03:08,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962331000] [2021-12-06 19:03:08,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:03:08,280 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:03:08,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 19:03:08,344 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-06 19:03:08,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 19:03:08,485 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-06 19:03:08,485 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-06 19:03:08,485 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-06 19:03:08,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2021-12-06 19:03:08,489 INFO L732 BasicCegarLoop]: Path program histogram: [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:03:08,491 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-06 19:03:08,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 07:03:08 BoogieIcfgContainer [2021-12-06 19:03:08,658 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-06 19:03:08,658 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-06 19:03:08,658 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-06 19:03:08,659 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-06 19:03:08,659 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:57:25" (3/4) ... [2021-12-06 19:03:08,660 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-06 19:03:08,942 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/bin/uautomizer-DrprNOufMa/witness.graphml [2021-12-06 19:03:08,942 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-06 19:03:08,943 INFO L158 Benchmark]: Toolchain (without parser) took 343760.84ms. Allocated memory was 107.0MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 81.4MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 2.0GB. Max. memory is 16.1GB. [2021-12-06 19:03:08,943 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 75.5MB. Free memory is still 44.3MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-06 19:03:08,943 INFO L158 Benchmark]: CACSL2BoogieTranslator took 230.69ms. Allocated memory is still 107.0MB. Free memory was 81.1MB in the beginning and 65.7MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-12-06 19:03:08,944 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.41ms. Allocated memory is still 107.0MB. Free memory was 65.7MB in the beginning and 62.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-06 19:03:08,944 INFO L158 Benchmark]: Boogie Preprocessor took 30.67ms. Allocated memory is still 107.0MB. Free memory was 62.9MB in the beginning and 60.6MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-06 19:03:08,944 INFO L158 Benchmark]: RCFGBuilder took 468.83ms. Allocated memory is still 107.0MB. Free memory was 60.6MB in the beginning and 71.4MB in the end (delta: -10.8MB). Peak memory consumption was 20.9MB. Max. memory is 16.1GB. [2021-12-06 19:03:08,944 INFO L158 Benchmark]: TraceAbstraction took 342702.72ms. Allocated memory was 107.0MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 71.0MB in the beginning and 490.1MB in the end (delta: -419.0MB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. [2021-12-06 19:03:08,944 INFO L158 Benchmark]: Witness Printer took 284.20ms. Allocated memory is still 2.5GB. Free memory was 490.1MB in the beginning and 1.7GB in the end (delta: -1.2GB). Peak memory consumption was 59.8MB. Max. memory is 16.1GB. [2021-12-06 19:03:08,945 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.13ms. Allocated memory is still 75.5MB. Free memory is still 44.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 230.69ms. Allocated memory is still 107.0MB. Free memory was 81.1MB in the beginning and 65.7MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.41ms. Allocated memory is still 107.0MB. Free memory was 65.7MB in the beginning and 62.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.67ms. Allocated memory is still 107.0MB. Free memory was 62.9MB in the beginning and 60.6MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 468.83ms. Allocated memory is still 107.0MB. Free memory was 60.6MB in the beginning and 71.4MB in the end (delta: -10.8MB). Peak memory consumption was 20.9MB. Max. memory is 16.1GB. * TraceAbstraction took 342702.72ms. Allocated memory was 107.0MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 71.0MB in the beginning and 490.1MB in the end (delta: -419.0MB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. * Witness Printer took 284.20ms. Allocated memory is still 2.5GB. Free memory was 490.1MB in the beginning and 1.7GB in the end (delta: -1.2GB). Peak memory consumption was 59.8MB. 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 - CounterExampleResult [Line: 531]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L23] msg_t nomsg = (msg_t )-1; [L24] port_t g1v ; [L25] int8_t g1v_old ; [L26] int8_t g1v_new ; [L27] port_t g2v ; [L28] int8_t g2v_old ; [L29] int8_t g2v_new ; [L30] port_t g3v ; [L31] int8_t g3v_old ; [L32] int8_t g3v_new ; [L36] _Bool gate1Failed ; [L37] _Bool gate2Failed ; [L38] _Bool gate3Failed ; [L39] msg_t VALUE1 ; [L40] msg_t VALUE2 ; [L41] msg_t VALUE3 ; [L43] _Bool gate1Failed_History_0 ; [L44] _Bool gate1Failed_History_1 ; [L45] _Bool gate1Failed_History_2 ; [L46] _Bool gate2Failed_History_0 ; [L47] _Bool gate2Failed_History_1 ; [L48] _Bool gate2Failed_History_2 ; [L49] _Bool gate3Failed_History_0 ; [L50] _Bool gate3Failed_History_1 ; [L51] _Bool gate3Failed_History_2 ; [L52] int8_t votedValue_History_0 ; [L53] int8_t votedValue_History_1 ; [L54] int8_t votedValue_History_2 ; VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=0, votedValue_History_1=0, votedValue_History_2=0] [L472] int c1 ; [L473] int i2 ; [L476] c1 = 0 [L477] gate1Failed = __VERIFIER_nondet_bool() [L478] gate2Failed = __VERIFIER_nondet_bool() [L479] gate3Failed = __VERIFIER_nondet_bool() [L480] VALUE1 = __VERIFIER_nondet_char() [L481] VALUE2 = __VERIFIER_nondet_char() [L482] VALUE3 = __VERIFIER_nondet_char() [L483] gate1Failed_History_0 = __VERIFIER_nondet_bool() [L484] gate1Failed_History_1 = __VERIFIER_nondet_bool() [L485] gate1Failed_History_2 = __VERIFIER_nondet_bool() [L486] gate2Failed_History_0 = __VERIFIER_nondet_bool() [L487] gate2Failed_History_1 = __VERIFIER_nondet_bool() [L488] gate2Failed_History_2 = __VERIFIER_nondet_bool() [L489] gate3Failed_History_0 = __VERIFIER_nondet_bool() [L490] gate3Failed_History_1 = __VERIFIER_nondet_bool() [L491] gate3Failed_History_2 = __VERIFIER_nondet_bool() [L492] votedValue_History_0 = __VERIFIER_nondet_char() [L493] votedValue_History_1 = __VERIFIER_nondet_char() [L494] votedValue_History_2 = __VERIFIER_nondet_char() [L495] CALL, EXPR init() [L203] int tmp ; [L204] int tmp___0 ; [L205] int tmp___1 ; [L206] int tmp___2 ; VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L209] CALL, EXPR add_history_type(0) VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L59] _Bool ini_bool ; [L60] int8_t ini_int ; [L61] int var ; [L62] int tmp ; [L63] int tmp___0 ; [L64] int tmp___1 ; [L65] int tmp___2 ; [L68] ini_bool = (_Bool)0 [L69] ini_int = (int8_t )-2 [L70] var = 0 VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND TRUE history_id == 0 VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] CALL, EXPR read_history_bool(0, 0) VAL [\old(history_id)=0, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] COND TRUE history_id == 0 VAL [\old(history_id)=0, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, history_id=0, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L127] COND TRUE historyIndex == 0 [L128] return (gate1Failed_History_0); VAL [\old(history_id)=0, \old(historyIndex)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] RET, EXPR read_history_bool(0, 0) VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, read_history_bool(0, 0)=0, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] tmp = (int )read_history_bool(0, 0) [L74] COND FALSE !(! (tmp == (int )ini_bool)) VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND TRUE history_id == 0 VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] CALL, EXPR read_history_bool(0, 0) VAL [\old(history_id)=0, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] COND TRUE history_id == 0 VAL [\old(history_id)=0, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L127] COND TRUE historyIndex == 0 [L128] return (gate1Failed_History_0); VAL [\old(history_id)=0, \old(historyIndex)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] RET, EXPR read_history_bool(0, 0) VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, read_history_bool(0, 0)=0, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] tmp = (int )read_history_bool(0, 0) [L74] COND FALSE !(! (tmp == (int )ini_bool)) VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND TRUE history_id == 0 VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] CALL, EXPR read_history_bool(0, 0) VAL [\old(history_id)=0, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] COND TRUE history_id == 0 VAL [\old(history_id)=0, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L127] COND TRUE historyIndex == 0 [L128] return (gate1Failed_History_0); VAL [\old(history_id)=0, \old(historyIndex)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] RET, EXPR read_history_bool(0, 0) VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, read_history_bool(0, 0)=0, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] tmp = (int )read_history_bool(0, 0) [L74] COND FALSE !(! (tmp == (int )ini_bool)) VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND FALSE !(var < 3) VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L98] return (1); VAL [\old(history_id)=0, \result=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L209] RET, EXPR add_history_type(0) VAL [add_history_type(0)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L209] tmp = add_history_type(0) [L210] COND FALSE !(! tmp) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, nomsg=-1, tmp=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L213] CALL, EXPR add_history_type(1) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L59] _Bool ini_bool ; [L60] int8_t ini_int ; [L61] int var ; [L62] int tmp ; [L63] int tmp___0 ; [L64] int tmp___1 ; [L65] int tmp___2 ; [L68] ini_bool = (_Bool)0 [L69] ini_int = (int8_t )-2 [L70] var = 0 VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L78] COND TRUE history_id == 1 VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] CALL, EXPR read_history_bool(1, 0) VAL [\old(history_id)=1, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] COND FALSE !(history_id == 0) VAL [\old(history_id)=1, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=1, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] COND TRUE history_id == 1 VAL [\old(history_id)=1, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=1, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L137] COND TRUE historyIndex == 0 [L138] return (gate2Failed_History_0); VAL [\old(history_id)=1, \old(historyIndex)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] RET, EXPR read_history_bool(1, 0) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, read_history_bool(1, 0)=0, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] tmp___0 = (int )read_history_bool(1, 0) [L80] COND FALSE !(! (tmp___0 == (int )ini_bool)) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L78] COND TRUE history_id == 1 VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] CALL, EXPR read_history_bool(1, 0) VAL [\old(history_id)=1, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] COND FALSE !(history_id == 0) VAL [\old(history_id)=1, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] COND TRUE history_id == 1 VAL [\old(history_id)=1, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L137] COND TRUE historyIndex == 0 [L138] return (gate2Failed_History_0); VAL [\old(history_id)=1, \old(historyIndex)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] RET, EXPR read_history_bool(1, 0) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, read_history_bool(1, 0)=0, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] tmp___0 = (int )read_history_bool(1, 0) [L80] COND FALSE !(! (tmp___0 == (int )ini_bool)) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L78] COND TRUE history_id == 1 VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] CALL, EXPR read_history_bool(1, 0) VAL [\old(history_id)=1, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] COND FALSE !(history_id == 0) VAL [\old(history_id)=1, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] COND TRUE history_id == 1 VAL [\old(history_id)=1, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L137] COND TRUE historyIndex == 0 [L138] return (gate2Failed_History_0); VAL [\old(history_id)=1, \old(historyIndex)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] RET, EXPR read_history_bool(1, 0) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, read_history_bool(1, 0)=0, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] tmp___0 = (int )read_history_bool(1, 0) [L80] COND FALSE !(! (tmp___0 == (int )ini_bool)) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND FALSE !(var < 3) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L98] return (1); VAL [\old(history_id)=1, \result=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L213] RET, EXPR add_history_type(1) VAL [add_history_type(1)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, nomsg=-1, tmp=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L213] tmp___0 = add_history_type(1) [L214] COND FALSE !(! tmp___0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, nomsg=-1, tmp=1, tmp___0=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L217] CALL, EXPR add_history_type(2) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L59] _Bool ini_bool ; [L60] int8_t ini_int ; [L61] int var ; [L62] int tmp ; [L63] int tmp___0 ; [L64] int tmp___1 ; [L65] int tmp___2 ; [L68] ini_bool = (_Bool)0 [L69] ini_int = (int8_t )-2 [L70] var = 0 VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L78] COND FALSE !(history_id == 1) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L84] COND TRUE history_id == 2 VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] CALL, EXPR read_history_bool(2, 0) VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] COND FALSE !(history_id == 0) VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] COND FALSE !(history_id == 1) VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L146] COND TRUE history_id == 2 VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L147] COND TRUE historyIndex == 0 [L148] return (gate3Failed_History_0); VAL [\old(history_id)=2, \old(historyIndex)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] RET, EXPR read_history_bool(2, 0) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, read_history_bool(2, 0)=0, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] tmp___1 = (int )read_history_bool(2, 0) [L86] COND FALSE !(! (tmp___1 == (int )ini_bool)) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L78] COND FALSE !(history_id == 1) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L84] COND TRUE history_id == 2 VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] CALL, EXPR read_history_bool(2, 0) VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] COND FALSE !(history_id == 0) VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] COND FALSE !(history_id == 1) VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L146] COND TRUE history_id == 2 VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L147] COND TRUE historyIndex == 0 [L148] return (gate3Failed_History_0); VAL [\old(history_id)=2, \old(historyIndex)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] RET, EXPR read_history_bool(2, 0) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, read_history_bool(2, 0)=0, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] tmp___1 = (int )read_history_bool(2, 0) [L86] COND FALSE !(! (tmp___1 == (int )ini_bool)) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L78] COND FALSE !(history_id == 1) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L84] COND TRUE history_id == 2 VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] CALL, EXPR read_history_bool(2, 0) VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] COND FALSE !(history_id == 0) VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] COND FALSE !(history_id == 1) VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L146] COND TRUE history_id == 2 VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L147] COND TRUE historyIndex == 0 [L148] return (gate3Failed_History_0); VAL [\old(history_id)=2, \old(historyIndex)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] RET, EXPR read_history_bool(2, 0) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, read_history_bool(2, 0)=0, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] tmp___1 = (int )read_history_bool(2, 0) [L86] COND FALSE !(! (tmp___1 == (int )ini_bool)) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND FALSE !(var < 3) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L98] return (1); VAL [\old(history_id)=2, \result=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L217] RET, EXPR add_history_type(2) VAL [add_history_type(2)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, tmp=1, tmp___0=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L217] tmp___1 = add_history_type(2) [L218] COND FALSE !(! tmp___1) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, tmp=1, tmp___0=1, tmp___1=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L221] CALL, EXPR add_history_type(3) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L59] _Bool ini_bool ; [L60] int8_t ini_int ; [L61] int var ; [L62] int tmp ; [L63] int tmp___0 ; [L64] int tmp___1 ; [L65] int tmp___2 ; [L68] ini_bool = (_Bool)0 [L69] ini_int = (int8_t )-2 [L70] var = 0 VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L78] COND FALSE !(history_id == 1) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L84] COND FALSE !(history_id == 2) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L90] COND TRUE history_id == 3 VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L91] CALL, EXPR read_history_int8(3, 0) VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L106] COND TRUE history_id == 3 VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [\old(history_id)=3, \old(historyIndex)=0, \result=-2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L91] RET, EXPR read_history_int8(3, 0) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, read_history_int8(3, 0)=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L91] tmp___2 = (int )read_history_int8(3, 0) [L92] COND FALSE !(! (tmp___2 == (int )ini_int)) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L78] COND FALSE !(history_id == 1) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L84] COND FALSE !(history_id == 2) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L90] COND TRUE history_id == 3 VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L91] CALL, EXPR read_history_int8(3, 0) VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L106] COND TRUE history_id == 3 VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [\old(history_id)=3, \old(historyIndex)=0, \result=-2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L91] RET, EXPR read_history_int8(3, 0) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, read_history_int8(3, 0)=-2, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L91] tmp___2 = (int )read_history_int8(3, 0) [L92] COND FALSE !(! (tmp___2 == (int )ini_int)) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L78] COND FALSE !(history_id == 1) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L84] COND FALSE !(history_id == 2) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L90] COND TRUE history_id == 3 VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L91] CALL, EXPR read_history_int8(3, 0) VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L106] COND TRUE history_id == 3 VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [\old(history_id)=3, \old(historyIndex)=0, \result=-2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L91] RET, EXPR read_history_int8(3, 0) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, read_history_int8(3, 0)=-2, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L91] tmp___2 = (int )read_history_int8(3, 0) [L92] COND FALSE !(! (tmp___2 == (int )ini_int)) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND FALSE !(var < 3) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L98] return (1); VAL [\old(history_id)=3, \result=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L221] RET, EXPR add_history_type(3) VAL [add_history_type(3)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, tmp=1, tmp___0=1, tmp___1=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L221] tmp___2 = add_history_type(3) [L222] COND FALSE !(! tmp___2) [L225] return (1); VAL [\result=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, tmp=1, tmp___0=1, tmp___1=1, tmp___2=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L495] RET, EXPR init() [L495] i2 = init() [L496] COND FALSE !(!(i2)) VAL [c1=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, i2=1, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L497] g1v_old = nomsg [L498] g1v_new = nomsg [L499] g2v_old = nomsg [L500] g2v_new = nomsg [L501] g3v_old = nomsg [L502] g3v_new = nomsg [L503] i2 = 0 VAL [c1=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, i2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L504] COND TRUE i2 < 10 [L506] CALL gate1_each_pals_period() [L338] int8_t next_state ; [L339] msg_t tmp ; [L340] int tmp___0 ; [L343] gate1Failed = __VERIFIER_nondet_bool() [L344] CALL write_history_bool(0, gate1Failed) VAL [\old(buf)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=4, \old(gate1Failed_History_2)=2, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=5, \old(gate2Failed_History_2)=6, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=7, \old(gate3Failed_History_2)=3, \old(history_id)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed_History_0=0, gate1Failed_History_1=4, gate1Failed_History_2=2, gate2Failed_History_0=0, gate2Failed_History_1=5, gate2Failed_History_2=6, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L181] COND TRUE history_id == 0 [L182] gate1Failed_History_2 = gate1Failed_History_1 [L183] gate1Failed_History_1 = gate1Failed_History_0 [L184] gate1Failed_History_0 = buf VAL [\old(buf)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=4, \old(gate1Failed_History_2)=2, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=5, \old(gate2Failed_History_2)=6, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=7, \old(gate3Failed_History_2)=3, \old(history_id)=0, buf=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed_History_0=0, gate2Failed_History_1=5, gate2Failed_History_2=6, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, history_id=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L344] RET write_history_bool(0, gate1Failed) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed_History_0=0, gate2Failed_History_1=5, gate2Failed_History_2=6, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L345] COND FALSE !(\read(gate1Failed)) [L349] tmp = __VERIFIER_nondet_char() [L350] next_state = tmp VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed_History_0=0, gate2Failed_History_1=5, gate2Failed_History_2=6, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, next_state=1, nomsg=-1, tmp=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L351] COND FALSE !((int )next_state == 0) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed_History_0=0, gate2Failed_History_1=5, gate2Failed_History_2=6, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, next_state=1, nomsg=-1, tmp=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L354] COND TRUE (int )next_state == 1 [L355] tmp___0 = 1 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed_History_0=0, gate2Failed_History_1=5, gate2Failed_History_2=6, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, next_state=1, nomsg=-1, tmp=1, tmp___0=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L362] COND FALSE !(!((_Bool )tmp___0)) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed_History_0=0, gate2Failed_History_1=5, gate2Failed_History_2=6, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, next_state=1, nomsg=-1, tmp=1, tmp___0=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L363] EXPR next_state != nomsg && g1v_new == nomsg ? next_state : g1v_new VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed_History_0=0, gate2Failed_History_1=5, gate2Failed_History_2=6, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, next_state=1, next_state != nomsg && g1v_new == nomsg ? next_state : g1v_new=1, nomsg=-1, tmp=1, tmp___0=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L363] g1v_new = next_state != nomsg && g1v_new == nomsg ? next_state : g1v_new [L506] RET gate1_each_pals_period() [L507] CALL gate2_each_pals_period() [L369] int8_t next_state ; [L370] msg_t tmp ; [L371] int tmp___0 ; [L374] gate2Failed = __VERIFIER_nondet_bool() [L375] CALL write_history_bool(1, gate2Failed) VAL [\old(buf)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=4, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=5, \old(gate2Failed_History_2)=6, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=7, \old(gate3Failed_History_2)=3, \old(history_id)=1, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed_History_0=0, gate2Failed_History_1=5, gate2Failed_History_2=6, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L181] COND FALSE !(history_id == 0) VAL [\old(buf)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=4, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=5, \old(gate2Failed_History_2)=6, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=7, \old(gate3Failed_History_2)=3, \old(history_id)=1, buf=0, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed_History_0=0, gate2Failed_History_1=5, gate2Failed_History_2=6, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, history_id=1, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L186] COND TRUE history_id == 1 [L187] gate2Failed_History_2 = gate2Failed_History_1 [L188] gate2Failed_History_1 = gate2Failed_History_0 [L189] gate2Failed_History_0 = buf VAL [\old(buf)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=4, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=5, \old(gate2Failed_History_2)=6, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=7, \old(gate3Failed_History_2)=3, \old(history_id)=1, buf=0, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, history_id=1, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L375] RET write_history_bool(1, gate2Failed) VAL [g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L376] COND FALSE !(\read(gate2Failed)) [L380] tmp = __VERIFIER_nondet_char() [L381] next_state = tmp VAL [g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, next_state=0, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L382] COND TRUE (int )next_state == 0 [L383] tmp___0 = 1 VAL [g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, next_state=0, nomsg=-1, tmp=0, tmp___0=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L393] COND FALSE !(!((_Bool )tmp___0)) VAL [g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, next_state=0, nomsg=-1, tmp=0, tmp___0=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L394] EXPR next_state != nomsg && g2v_new == nomsg ? next_state : g2v_new VAL [g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, next_state=0, next_state != nomsg && g2v_new == nomsg ? next_state : g2v_new=0, nomsg=-1, tmp=0, tmp___0=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L394] g2v_new = next_state != nomsg && g2v_new == nomsg ? next_state : g2v_new [L507] RET gate2_each_pals_period() [L508] CALL gate3_each_pals_period() [L400] int8_t next_state ; [L401] msg_t tmp ; [L402] int tmp___0 ; [L405] gate3Failed = __VERIFIER_nondet_bool() [L406] CALL write_history_bool(2, gate3Failed) VAL [\old(buf)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=4, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=5, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=7, \old(gate3Failed_History_2)=3, \old(history_id)=2, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L181] COND FALSE !(history_id == 0) VAL [\old(buf)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=4, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=5, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=7, \old(gate3Failed_History_2)=3, \old(history_id)=2, buf=0, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, history_id=2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L186] COND FALSE !(history_id == 1) VAL [\old(buf)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=4, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=5, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=7, \old(gate3Failed_History_2)=3, \old(history_id)=2, buf=0, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, history_id=2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L191] COND TRUE history_id == 2 [L192] gate3Failed_History_2 = gate3Failed_History_1 [L193] gate3Failed_History_1 = gate3Failed_History_0 [L194] gate3Failed_History_0 = buf VAL [\old(buf)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=4, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=5, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=7, \old(gate3Failed_History_2)=3, \old(history_id)=2, buf=0, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L406] RET write_history_bool(2, gate3Failed) VAL [g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L407] COND FALSE !(\read(gate3Failed)) [L411] tmp = __VERIFIER_nondet_char() [L412] next_state = tmp VAL [g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, next_state=0, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L413] COND TRUE (int )next_state == 0 [L414] tmp___0 = 1 VAL [g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, next_state=0, nomsg=-1, tmp=0, tmp___0=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L424] COND FALSE !(!((_Bool )tmp___0)) VAL [g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, next_state=0, nomsg=-1, tmp=0, tmp___0=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L425] EXPR next_state != nomsg && g3v_new == nomsg ? next_state : g3v_new VAL [g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, next_state=0, next_state != nomsg && g3v_new == nomsg ? next_state : g3v_new=0, nomsg=-1, tmp=0, tmp___0=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L425] g3v_new = next_state != nomsg && g3v_new == nomsg ? next_state : g3v_new [L508] RET gate3_each_pals_period() [L509] CALL voter() [L431] int8_t voted_value ; [L434] voted_value = nomsg [L435] VALUE1 = g1v_old [L436] g1v_old = nomsg [L437] VALUE2 = g2v_old [L438] g2v_old = nomsg [L439] VALUE3 = g3v_old [L440] g3v_old = nomsg VAL [g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, voted_value=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L441] COND TRUE (int )VALUE1 == (int )VALUE2 VAL [g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, voted_value=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L442] COND TRUE (int )VALUE1 == (int )nomsg [L443] voted_value = VALUE3 VAL [g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, voted_value=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L466] CALL write_history_int8(3, voted_value) [L166] COND TRUE history_id == 3 [L167] votedValue_History_2 = votedValue_History_1 [L168] votedValue_History_1 = votedValue_History_0 [L169] votedValue_History_0 = buf VAL [\old(buf)=255, \old(history_id)=3, buf=255, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L466] RET write_history_int8(3, voted_value) [L509] RET voter() [L510] g1v_old = g1v_new [L511] g1v_new = nomsg [L512] g2v_old = g2v_new [L513] g2v_new = nomsg [L514] g3v_old = g3v_new [L515] g3v_new = nomsg [L516] CALL, EXPR check() [L230] int tmp ; [L231] int temp_count ; [L232] int8_t tmp___0 ; [L233] int8_t tmp___1 ; [L234] int8_t tmp___2 ; [L235] _Bool tmp___3 ; [L236] _Bool tmp___4 ; [L237] _Bool tmp___5 ; [L238] int8_t tmp___6 ; [L239] _Bool tmp___7 ; [L240] _Bool tmp___8 ; [L241] _Bool tmp___9 ; [L242] int8_t tmp___10 ; [L243] int8_t tmp___11 ; [L244] int8_t tmp___12 ; [L245] int8_t tmp___13 ; [L246] int8_t tmp___14 ; VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L249] COND TRUE ! gate1Failed [L250] tmp = 1 VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, tmp=1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L260] COND FALSE !(!((_Bool )tmp)) VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, tmp=1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L261] CALL, EXPR read_history_bool(0, 1) VAL [\old(history_id)=0, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L126] COND TRUE history_id == 0 VAL [\old(history_id)=0, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=0, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L127] COND FALSE !(historyIndex == 0) VAL [\old(history_id)=0, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=0, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L130] COND TRUE historyIndex == 1 [L131] return (gate1Failed_History_1); VAL [\old(history_id)=0, \old(historyIndex)=1, \result=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=0, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L261] RET, EXPR read_history_bool(0, 1) VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, read_history_bool(0, 1)=0, tmp=1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L261] tmp___3 = read_history_bool(0, 1) [L262] COND TRUE ! tmp___3 VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, tmp=1, tmp___3=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L263] CALL, EXPR read_history_bool(1, 1) VAL [\old(history_id)=1, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L126] COND FALSE !(history_id == 0) VAL [\old(history_id)=1, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=1, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L136] COND TRUE history_id == 1 VAL [\old(history_id)=1, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=1, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L137] COND FALSE !(historyIndex == 0) VAL [\old(history_id)=1, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=1, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L140] COND TRUE historyIndex == 1 [L141] return (gate2Failed_History_1); VAL [\old(history_id)=1, \old(historyIndex)=1, \result=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=1, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L263] RET, EXPR read_history_bool(1, 1) VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, read_history_bool(1, 1)=0, tmp=1, tmp___3=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L263] tmp___4 = read_history_bool(1, 1) [L264] COND TRUE ! tmp___4 VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, tmp=1, tmp___3=0, tmp___4=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L265] CALL, EXPR read_history_bool(2, 1) VAL [\old(history_id)=2, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L126] COND FALSE !(history_id == 0) VAL [\old(history_id)=2, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=2, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L136] COND FALSE !(history_id == 1) VAL [\old(history_id)=2, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=2, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L146] COND TRUE history_id == 2 VAL [\old(history_id)=2, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=2, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L147] COND FALSE !(historyIndex == 0) VAL [\old(history_id)=2, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=2, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L150] COND TRUE historyIndex == 1 [L151] return (gate3Failed_History_1); VAL [\old(history_id)=2, \old(historyIndex)=1, \result=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=2, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L265] RET, EXPR read_history_bool(2, 1) VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, read_history_bool(2, 1)=0, tmp=1, tmp___3=0, tmp___4=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L265] tmp___5 = read_history_bool(2, 1) [L266] COND TRUE ! tmp___5 [L267] temp_count = 0 VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, temp_count=0, tmp=1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L268] CALL, EXPR read_history_int8(3, 0) VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L106] COND TRUE history_id == 3 VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [\old(history_id)=3, \old(historyIndex)=0, \result=-1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L268] RET, EXPR read_history_int8(3, 0) VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, read_history_int8(3, 0)=-1, temp_count=0, tmp=1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L268] tmp___0 = read_history_int8(3, 0) [L269] COND TRUE (int )VALUE1 == (int )tmp___0 [L270] temp_count ++ VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, temp_count=1, tmp=1, tmp___0=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L272] CALL, EXPR read_history_int8(3, 0) VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L106] COND TRUE history_id == 3 VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [\old(history_id)=3, \old(historyIndex)=0, \result=-1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L272] RET, EXPR read_history_int8(3, 0) VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, read_history_int8(3, 0)=-1, temp_count=1, tmp=1, tmp___0=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L272] tmp___1 = read_history_int8(3, 0) [L273] COND TRUE (int )VALUE2 == (int )tmp___1 [L274] temp_count ++ VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, temp_count=2, tmp=1, tmp___0=-1, tmp___1=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L276] CALL, EXPR read_history_int8(3, 0) VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L106] COND TRUE history_id == 3 VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [\old(history_id)=3, \old(historyIndex)=0, \result=-1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L276] RET, EXPR read_history_int8(3, 0) VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, read_history_int8(3, 0)=-1, temp_count=2, tmp=1, tmp___0=-1, tmp___1=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L276] tmp___2 = read_history_int8(3, 0) [L277] COND TRUE (int )VALUE3 == (int )tmp___2 [L278] temp_count ++ VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L280] COND FALSE !((int )VALUE1 != (int )VALUE2) VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L294] COND FALSE !(! (temp_count > 1)) VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L300] CALL, EXPR read_history_int8(3, 1) VAL [\old(history_id)=3, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L106] COND TRUE history_id == 3 VAL [\old(history_id)=3, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=3, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L107] COND FALSE !(historyIndex == 0) VAL [\old(history_id)=3, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=3, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L110] COND TRUE historyIndex == 1 [L111] return (votedValue_History_1); VAL [\old(history_id)=3, \old(historyIndex)=1, \result=-2, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=3, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L300] RET, EXPR read_history_int8(3, 1) VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, read_history_int8(3, 1)=-2, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L300] tmp___10 = read_history_int8(3, 1) [L301] COND FALSE !((int )tmp___10 > -2) VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___10=-2, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L320] CALL, EXPR read_history_int8(3, 0) VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L106] COND TRUE history_id == 3 VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [\old(history_id)=3, \old(historyIndex)=0, \result=-1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L320] RET, EXPR read_history_int8(3, 0) VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, read_history_int8(3, 0)=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___10=-2, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L320] tmp___11 = read_history_int8(3, 0) [L321] COND FALSE !((int )tmp___11 != (int )nomsg) VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___10=-2, tmp___11=-1, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L333] return (1); VAL [\result=1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___10=-2, tmp___11=-1, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L516] RET, EXPR check() [L516] c1 = check() [L517] CALL assert(c1) VAL [\old(arg)=1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L529] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L517] RET assert(c1) VAL [c1=1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, i2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L518] i2 ++ VAL [c1=1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, i2=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L504] COND TRUE i2 < 10 [L506] CALL gate1_each_pals_period() [L338] int8_t next_state ; [L339] msg_t tmp ; [L340] int tmp___0 ; [L343] gate1Failed = __VERIFIER_nondet_bool() [L344] CALL write_history_bool(0, gate1Failed) VAL [\old(buf)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=4, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=5, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=7, \old(history_id)=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L181] COND TRUE history_id == 0 [L182] gate1Failed_History_2 = gate1Failed_History_1 [L183] gate1Failed_History_1 = gate1Failed_History_0 [L184] gate1Failed_History_0 = buf VAL [\old(buf)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=4, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=5, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=7, \old(history_id)=0, buf=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L344] RET write_history_bool(0, gate1Failed) VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L345] COND FALSE !(\read(gate1Failed)) [L349] tmp = __VERIFIER_nondet_char() [L350] next_state = tmp VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, next_state=0, nomsg=-1, tmp=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L351] COND TRUE (int )next_state == 0 [L352] tmp___0 = 1 VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, next_state=0, nomsg=-1, tmp=0, tmp___0=1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L362] COND FALSE !(!((_Bool )tmp___0)) VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, next_state=0, nomsg=-1, tmp=0, tmp___0=1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L363] EXPR next_state != nomsg && g1v_new == nomsg ? next_state : g1v_new VAL [g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, next_state=0, next_state != nomsg && g1v_new == nomsg ? next_state : g1v_new=0, nomsg=-1, tmp=0, tmp___0=1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L363] g1v_new = next_state != nomsg && g1v_new == nomsg ? next_state : g1v_new [L506] RET gate1_each_pals_period() [L507] CALL gate2_each_pals_period() [L369] int8_t next_state ; [L370] msg_t tmp ; [L371] int tmp___0 ; [L374] gate2Failed = __VERIFIER_nondet_bool() [L375] CALL write_history_bool(1, gate2Failed) VAL [\old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=5, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=7, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L181] COND FALSE !(history_id == 0) VAL [\old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=5, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=7, \old(history_id)=1, buf=1, g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L186] COND TRUE history_id == 1 [L187] gate2Failed_History_2 = gate2Failed_History_1 [L188] gate2Failed_History_1 = gate2Failed_History_0 [L189] gate2Failed_History_0 = buf VAL [\old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=5, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=7, \old(history_id)=1, buf=1, g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L375] RET write_history_bool(1, gate2Failed) VAL [g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L376] COND TRUE \read(gate2Failed) VAL [g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L377] EXPR nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new VAL [g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L377] g2v_new = nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new [L507] RET gate2_each_pals_period() [L508] CALL gate3_each_pals_period() [L400] int8_t next_state ; [L401] msg_t tmp ; [L402] int tmp___0 ; [L405] gate3Failed = __VERIFIER_nondet_bool() [L406] CALL write_history_bool(2, gate3Failed) VAL [\old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=7, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L181] COND FALSE !(history_id == 0) VAL [\old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=7, \old(history_id)=2, buf=1, g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=2, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L186] COND FALSE !(history_id == 1) VAL [\old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=7, \old(history_id)=2, buf=1, g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=2, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L191] COND TRUE history_id == 2 [L192] gate3Failed_History_2 = gate3Failed_History_1 [L193] gate3Failed_History_1 = gate3Failed_History_0 [L194] gate3Failed_History_0 = buf VAL [\old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=7, \old(history_id)=2, buf=1, g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L406] RET write_history_bool(2, gate3Failed) VAL [g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L407] COND TRUE \read(gate3Failed) VAL [g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L408] EXPR nomsg != nomsg && g3v_new == nomsg ? nomsg : g3v_new VAL [g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, nomsg != nomsg && g3v_new == nomsg ? nomsg : g3v_new=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L408] g3v_new = nomsg != nomsg && g3v_new == nomsg ? nomsg : g3v_new [L508] RET gate3_each_pals_period() [L509] CALL voter() [L431] int8_t voted_value ; [L434] voted_value = nomsg [L435] VALUE1 = g1v_old [L436] g1v_old = nomsg [L437] VALUE2 = g2v_old [L438] g2v_old = nomsg [L439] VALUE3 = g3v_old [L440] g3v_old = nomsg VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, voted_value=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L441] COND FALSE !((int )VALUE1 == (int )VALUE2) VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, voted_value=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L448] COND FALSE !((int )VALUE1 == (int )VALUE3) VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, voted_value=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L455] COND TRUE (int )VALUE1 != (int )nomsg [L456] voted_value = VALUE1 VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, voted_value=1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L466] CALL write_history_int8(3, voted_value) [L166] COND TRUE history_id == 3 [L167] votedValue_History_2 = votedValue_History_1 [L168] votedValue_History_1 = votedValue_History_0 [L169] votedValue_History_0 = buf VAL [\old(buf)=1, \old(history_id)=3, buf=1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L466] RET write_history_int8(3, voted_value) [L509] RET voter() [L510] g1v_old = g1v_new [L511] g1v_new = nomsg [L512] g2v_old = g2v_new [L513] g2v_new = nomsg [L514] g3v_old = g3v_new [L515] g3v_new = nomsg [L516] CALL, EXPR check() [L230] int tmp ; [L231] int temp_count ; [L232] int8_t tmp___0 ; [L233] int8_t tmp___1 ; [L234] int8_t tmp___2 ; [L235] _Bool tmp___3 ; [L236] _Bool tmp___4 ; [L237] _Bool tmp___5 ; [L238] int8_t tmp___6 ; [L239] _Bool tmp___7 ; [L240] _Bool tmp___8 ; [L241] _Bool tmp___9 ; [L242] int8_t tmp___10 ; [L243] int8_t tmp___11 ; [L244] int8_t tmp___12 ; [L245] int8_t tmp___13 ; [L246] int8_t tmp___14 ; VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L249] COND TRUE ! gate1Failed [L250] tmp = 1 VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L260] COND FALSE !(!((_Bool )tmp)) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L261] CALL, EXPR read_history_bool(0, 1) VAL [\old(history_id)=0, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L126] COND TRUE history_id == 0 VAL [\old(history_id)=0, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=0, historyIndex=1, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L127] COND FALSE !(historyIndex == 0) VAL [\old(history_id)=0, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=0, historyIndex=1, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L130] COND TRUE historyIndex == 1 [L131] return (gate1Failed_History_1); VAL [\old(history_id)=0, \old(historyIndex)=1, \result=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=0, historyIndex=1, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L261] RET, EXPR read_history_bool(0, 1) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, read_history_bool(0, 1)=0, tmp=1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L261] tmp___3 = read_history_bool(0, 1) [L262] COND TRUE ! tmp___3 VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___3=0, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L263] CALL, EXPR read_history_bool(1, 1) VAL [\old(history_id)=1, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L126] COND FALSE !(history_id == 0) VAL [\old(history_id)=1, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=1, historyIndex=1, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L136] COND TRUE history_id == 1 VAL [\old(history_id)=1, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=1, historyIndex=1, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L137] COND FALSE !(historyIndex == 0) VAL [\old(history_id)=1, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=1, historyIndex=1, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L140] COND TRUE historyIndex == 1 [L141] return (gate2Failed_History_1); VAL [\old(history_id)=1, \old(historyIndex)=1, \result=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=1, historyIndex=1, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L263] RET, EXPR read_history_bool(1, 1) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, read_history_bool(1, 1)=0, tmp=1, tmp___3=0, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L263] tmp___4 = read_history_bool(1, 1) [L264] COND TRUE ! tmp___4 VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___3=0, tmp___4=0, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L265] CALL, EXPR read_history_bool(2, 1) VAL [\old(history_id)=2, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L126] COND FALSE !(history_id == 0) VAL [\old(history_id)=2, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, historyIndex=1, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L136] COND FALSE !(history_id == 1) VAL [\old(history_id)=2, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, historyIndex=1, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L146] COND TRUE history_id == 2 VAL [\old(history_id)=2, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, historyIndex=1, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L147] COND FALSE !(historyIndex == 0) VAL [\old(history_id)=2, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, historyIndex=1, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L150] COND TRUE historyIndex == 1 [L151] return (gate3Failed_History_1); VAL [\old(history_id)=2, \old(historyIndex)=1, \result=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, historyIndex=1, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L265] RET, EXPR read_history_bool(2, 1) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, read_history_bool(2, 1)=0, tmp=1, tmp___3=0, tmp___4=0, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L265] tmp___5 = read_history_bool(2, 1) [L266] COND TRUE ! tmp___5 [L267] temp_count = 0 VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, temp_count=0, tmp=1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L268] CALL, EXPR read_history_int8(3, 0) VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L106] COND TRUE history_id == 3 VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, historyIndex=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [\old(history_id)=3, \old(historyIndex)=0, \result=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, historyIndex=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L268] RET, EXPR read_history_int8(3, 0) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, read_history_int8(3, 0)=1, temp_count=0, tmp=1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L268] tmp___0 = read_history_int8(3, 0) [L269] COND TRUE (int )VALUE1 == (int )tmp___0 [L270] temp_count ++ VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, temp_count=1, tmp=1, tmp___0=1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L272] CALL, EXPR read_history_int8(3, 0) VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L106] COND TRUE history_id == 3 VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, historyIndex=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [\old(history_id)=3, \old(historyIndex)=0, \result=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, historyIndex=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L272] RET, EXPR read_history_int8(3, 0) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, read_history_int8(3, 0)=1, temp_count=1, tmp=1, tmp___0=1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L272] tmp___1 = read_history_int8(3, 0) [L273] COND FALSE !((int )VALUE2 == (int )tmp___1) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, temp_count=1, tmp=1, tmp___0=1, tmp___1=1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L276] CALL, EXPR read_history_int8(3, 0) VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L106] COND TRUE history_id == 3 VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, historyIndex=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [\old(history_id)=3, \old(historyIndex)=0, \result=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, historyIndex=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L276] RET, EXPR read_history_int8(3, 0) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, read_history_int8(3, 0)=1, temp_count=1, tmp=1, tmp___0=1, tmp___1=1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L276] tmp___2 = read_history_int8(3, 0) [L277] COND FALSE !((int )VALUE3 == (int )tmp___2) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, temp_count=1, tmp=1, tmp___0=1, tmp___1=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L280] COND TRUE (int )VALUE1 != (int )VALUE2 VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, temp_count=1, tmp=1, tmp___0=1, tmp___1=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L281] COND TRUE (int )VALUE1 != (int )VALUE3 VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, temp_count=1, tmp=1, tmp___0=1, tmp___1=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L282] COND FALSE !((int )VALUE2 != (int )VALUE3) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, temp_count=1, tmp=1, tmp___0=1, tmp___1=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L294] COND TRUE ! (temp_count > 1) [L295] return (0); VAL [\result=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, temp_count=1, tmp=1, tmp___0=1, tmp___1=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L516] RET, EXPR check() [L516] c1 = check() [L517] CALL assert(c1) VAL [\old(arg)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L529] COND TRUE ! arg VAL [\old(arg)=0, arg=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L531] reach_error() VAL [\old(arg)=0, arg=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 183 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 342.5s, OverallIterations: 77, TraceHistogramMax: 15, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.3s, AutomataDifference: 252.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 50166 SdHoareTripleChecker+Valid, 76.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 49326 mSDsluCounter, 262340 SdHoareTripleChecker+Invalid, 64.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 228961 mSDsCounter, 24605 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 181192 IncrementalHoareTripleChecker+Invalid, 205797 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24605 mSolverCounterUnsat, 33379 mSDtfsCounter, 181192 mSolverCounterSat, 0.8s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25724 GetRequests, 21909 SyntacticMatches, 11 SemanticMatches, 3804 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 739627 ImplicationChecksByTransitivity, 75.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18952occurred in iteration=76, InterpolantAutomatonStates: 3133, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 36.1s AutomataMinimizationTime, 76 MinimizatonAttempts, 279031 StatesRemovedByMinimization, 58 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.9s SsaConstructionTime, 2.9s SatisfiabilityAnalysisTime, 21.7s InterpolantComputationTime, 29876 NumberOfCodeBlocks, 29876 NumberOfCodeBlocksAsserted, 101 NumberOfCheckSat, 32566 ConstructedInterpolants, 0 QuantifiedInterpolants, 73365 SizeOfPredicates, 108 NumberOfNonLiveVariables, 25903 ConjunctsInSsa, 500 ConjunctsInUnsatCore, 110 InterpolantComputations, 56 PerfectInterpolantSequences, 82824/86032 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-12-06 19:03:08,996 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103e4f0e-7916-4209-892c-528c3b8d19dd/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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE